{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2IGNIVGTGCUAHN6CBYWU6XLJ5K","short_pith_number":"pith:2IGNIVGT","schema_version":"1.0","canonical_sha256":"d20cd454d330a803b7c20e2d4f5d69eaa76447c0fa615111605925ac55e82f57","source":{"kind":"arxiv","id":"1405.2555","version":2},"attestation_state":"computed","paper":{"title":"How to Securely Compute the Modulo-Two Sum of Binary Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Bikash Kumar Dey, Deepesh Data, Manoj Mishra, Vinod M. Prabhakaran","submitted_at":"2014-05-11T17:42:29Z","abstract_excerpt":"In secure multiparty computation, mutually distrusting users in a network want to collaborate to compute functions of data which is distributed among the users. The users should not learn any additional information about the data of others than what they may infer from their own data and the functions they are computing. Previous works have mostly considered the worst case context (i.e., without assuming any distribution for the data); Lee and Abbe (2014) is a notable exception. Here, we study the average case (i.e., we work with a distribution on the data) where correctness and privacy is onl"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1405.2555","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-11T17:42:29Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"9628fa0b0670e26179ea54a12c352ffd1a216e033432ce05e5f93dd56efafc35","abstract_canon_sha256":"d9d39ba4513288042ca1b5b47cbc3501b0fbdcb43d900bdd4408c059243fc5f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.010919Z","signature_b64":"sM36kF+G7/OI9RWfy9Fx77+yAtulI8coV78dvXnjX3UGAMb8L4qaY8qdWXGpe2fCDdMH/n5BwQdRM7tANYmcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d20cd454d330a803b7c20e2d4f5d69eaa76447c0fa615111605925ac55e82f57","last_reissued_at":"2026-05-18T00:59:03.010443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.010443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Securely Compute the Modulo-Two Sum of Binary Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Bikash Kumar Dey, Deepesh Data, Manoj Mishra, Vinod M. Prabhakaran","submitted_at":"2014-05-11T17:42:29Z","abstract_excerpt":"In secure multiparty computation, mutually distrusting users in a network want to collaborate to compute functions of data which is distributed among the users. The users should not learn any additional information about the data of others than what they may infer from their own data and the functions they are computing. Previous works have mostly considered the worst case context (i.e., without assuming any distribution for the data); Lee and Abbe (2014) is a notable exception. Here, we study the average case (i.e., we work with a distribution on the data) where correctness and privacy is onl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2555","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.2555","created_at":"2026-05-18T00:59:03.010520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2555v2","created_at":"2026-05-18T00:59:03.010520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2555","created_at":"2026-05-18T00:59:03.010520+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IGNIVGTGCUA","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IGNIVGTGCUAHN6C","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IGNIVGT","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IGNIVGTGCUAHN6CBYWU6XLJ5K","json":"https://pith.science/pith/2IGNIVGTGCUAHN6CBYWU6XLJ5K.json","graph_json":"https://pith.science/api/pith-number/2IGNIVGTGCUAHN6CBYWU6XLJ5K/graph.json","events_json":"https://pith.science/api/pith-number/2IGNIVGTGCUAHN6CBYWU6XLJ5K/events.json","paper":"https://pith.science/paper/2IGNIVGT"},"agent_actions":{"view_html":"https://pith.science/pith/2IGNIVGTGCUAHN6CBYWU6XLJ5K","download_json":"https://pith.science/pith/2IGNIVGTGCUAHN6CBYWU6XLJ5K.json","view_paper":"https://pith.science/paper/2IGNIVGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2555&json=true","fetch_graph":"https://pith.science/api/pith-number/2IGNIVGTGCUAHN6CBYWU6XLJ5K/graph.json","fetch_events":"https://pith.science/api/pith-number/2IGNIVGTGCUAHN6CBYWU6XLJ5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IGNIVGTGCUAHN6CBYWU6XLJ5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IGNIVGTGCUAHN6CBYWU6XLJ5K/action/storage_attestation","attest_author":"https://pith.science/pith/2IGNIVGTGCUAHN6CBYWU6XLJ5K/action/author_attestation","sign_citation":"https://pith.science/pith/2IGNIVGTGCUAHN6CBYWU6XLJ5K/action/citation_signature","submit_replication":"https://pith.science/pith/2IGNIVGTGCUAHN6CBYWU6XLJ5K/action/replication_record"}},"created_at":"2026-05-18T00:59:03.010520+00:00","updated_at":"2026-05-18T00:59:03.010520+00:00"}