{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:24V7J4BMQLZPATF35RG3V4KXM5","short_pith_number":"pith:24V7J4BM","canonical_record":{"source":{"id":"1401.7360","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-28T22:43:57Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"b2cb0e7ac8e914b2f2a27786cf1468693ca3d633810f0a2d7173463181b540e9","abstract_canon_sha256":"f577109b65297c7fa0f4872f4f9d8c984a587712f3d9906e33e2401d996c9f0e"},"schema_version":"1.0"},"canonical_sha256":"d72bf4f02c82f2f04cbbec4dbaf157677a6d766da8253cdce1edf5b94e910389","source":{"kind":"arxiv","id":"1401.7360","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7360","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7360v3","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7360","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"24V7J4BMQLZP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"24V7J4BMQLZPATF3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"24V7J4BM","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:24V7J4BMQLZPATF35RG3V4KXM5","target":"record","payload":{"canonical_record":{"source":{"id":"1401.7360","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-28T22:43:57Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"b2cb0e7ac8e914b2f2a27786cf1468693ca3d633810f0a2d7173463181b540e9","abstract_canon_sha256":"f577109b65297c7fa0f4872f4f9d8c984a587712f3d9906e33e2401d996c9f0e"},"schema_version":"1.0"},"canonical_sha256":"d72bf4f02c82f2f04cbbec4dbaf157677a6d766da8253cdce1edf5b94e910389","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:48.192743Z","signature_b64":"5y4fW1Dmtfo9IbYpbEoDFm9FNigr6kj8gbzfLRSBMlpCUHTIavdi3rzHIJPPlTc91R5K0JE/Y6crfGvHVgUaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d72bf4f02c82f2f04cbbec4dbaf157677a6d766da8253cdce1edf5b94e910389","last_reissued_at":"2026-05-18T00:43:48.192280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:48.192280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.7360","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pF7c05QcqV/mLmtbnbBr7+DqaxCMzs/L75Ld43UR00fjLf7Dj2WcPwHJcrenDGhhyk+taJLUxGf/ihji5SYlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:28:18.757654Z"},"content_sha256":"3cd3ffbb435de590c70af1185aeec6b0ed1d35d903e963c4bc442c060d342657","schema_version":"1.0","event_id":"sha256:3cd3ffbb435de590c70af1185aeec6b0ed1d35d903e963c4bc442c060d342657"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:24V7J4BMQLZPATF35RG3V4KXM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Shannon Approach to Secure Multi-party Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanuel Abbe, Eun Jee Lee","submitted_at":"2014-01-28T22:43:57Z","abstract_excerpt":"In secure multi-party computations (SMC), parties wish to compute a function on their private data without revealing more information about their data than what the function reveals. In this paper, we investigate two Shannon-type questions on this problem. We first consider the traditional one-shot model for SMC which does not assume a probabilistic prior on the data. In this model, private communication and randomness are the key enablers to secure computing, and we investigate a notion of randomness cost and capacity. We then move to a probabilistic model for the data, and propose a Shannon "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7360","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XTB6HE0tZs8D04FR9h9NvXOW5SWrSKX6LQlIptU+IE6VrEOZIXEV/YlpZnN+giuGgGOz/TsJMavWF7d/OpJLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:28:18.758326Z"},"content_sha256":"4c113eb3afcc1a5171330b07639e62301879af4ffa3e19ecb0e962a5750ce36f","schema_version":"1.0","event_id":"sha256:4c113eb3afcc1a5171330b07639e62301879af4ffa3e19ecb0e962a5750ce36f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24V7J4BMQLZPATF35RG3V4KXM5/bundle.json","state_url":"https://pith.science/pith/24V7J4BMQLZPATF35RG3V4KXM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24V7J4BMQLZPATF35RG3V4KXM5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T14:28:18Z","links":{"resolver":"https://pith.science/pith/24V7J4BMQLZPATF35RG3V4KXM5","bundle":"https://pith.science/pith/24V7J4BMQLZPATF35RG3V4KXM5/bundle.json","state":"https://pith.science/pith/24V7J4BMQLZPATF35RG3V4KXM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24V7J4BMQLZPATF35RG3V4KXM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:24V7J4BMQLZPATF35RG3V4KXM5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f577109b65297c7fa0f4872f4f9d8c984a587712f3d9906e33e2401d996c9f0e","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-28T22:43:57Z","title_canon_sha256":"b2cb0e7ac8e914b2f2a27786cf1468693ca3d633810f0a2d7173463181b540e9"},"schema_version":"1.0","source":{"id":"1401.7360","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7360","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7360v3","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7360","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"24V7J4BMQLZP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"24V7J4BMQLZPATF3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"24V7J4BM","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:4c113eb3afcc1a5171330b07639e62301879af4ffa3e19ecb0e962a5750ce36f","target":"graph","created_at":"2026-05-18T00:43:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In secure multi-party computations (SMC), parties wish to compute a function on their private data without revealing more information about their data than what the function reveals. In this paper, we investigate two Shannon-type questions on this problem. We first consider the traditional one-shot model for SMC which does not assume a probabilistic prior on the data. In this model, private communication and randomness are the key enablers to secure computing, and we investigate a notion of randomness cost and capacity. We then move to a probabilistic model for the data, and propose a Shannon ","authors_text":"Emmanuel Abbe, Eun Jee Lee","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-28T22:43:57Z","title":"A Shannon Approach to Secure Multi-party Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7360","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3cd3ffbb435de590c70af1185aeec6b0ed1d35d903e963c4bc442c060d342657","target":"record","created_at":"2026-05-18T00:43:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f577109b65297c7fa0f4872f4f9d8c984a587712f3d9906e33e2401d996c9f0e","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-28T22:43:57Z","title_canon_sha256":"b2cb0e7ac8e914b2f2a27786cf1468693ca3d633810f0a2d7173463181b540e9"},"schema_version":"1.0","source":{"id":"1401.7360","kind":"arxiv","version":3}},"canonical_sha256":"d72bf4f02c82f2f04cbbec4dbaf157677a6d766da8253cdce1edf5b94e910389","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d72bf4f02c82f2f04cbbec4dbaf157677a6d766da8253cdce1edf5b94e910389","first_computed_at":"2026-05-18T00:43:48.192280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:48.192280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5y4fW1Dmtfo9IbYpbEoDFm9FNigr6kj8gbzfLRSBMlpCUHTIavdi3rzHIJPPlTc91R5K0JE/Y6crfGvHVgUaBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:48.192743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7360","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cd3ffbb435de590c70af1185aeec6b0ed1d35d903e963c4bc442c060d342657","sha256:4c113eb3afcc1a5171330b07639e62301879af4ffa3e19ecb0e962a5750ce36f"],"state_sha256":"a9c53562f1188f319d7a1381d0258d16898e2d8379f77b10f31a3048712aef1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uD83fzwNWKHGPyL9MuOXmRtpofwSwAgc/P7gaNQfj9rtds7jlydJFZrk1esO5r3bEQDEQYPmKCj7F0xVi55ZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:28:18.762197Z","bundle_sha256":"1e1317e19da1aab16c264038a2b0e8e44a46f28b1e9bed8b696ed7eec9b64ef9"}}