{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QUTQIT2BXJAS2JSN7IHZIICLDQ","short_pith_number":"pith:QUTQIT2B","schema_version":"1.0","canonical_sha256":"8527044f41ba412d264dfa0f94204b1c3c07ed365852ec6b7dd8bfa614644d8d","source":{"kind":"arxiv","id":"1206.2669","version":2},"attestation_state":"computed","paper":{"title":"Information-Theoretically Secure Three-Party Computation with One Corrupted Party","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Prakash Ishwar, Shantanu Rane, Ye Wang","submitted_at":"2012-06-12T20:52:23Z","abstract_excerpt":"The problem in which one of three pairwise interacting parties is required to securely compute a function of the inputs held by the other two, when one party may arbitrarily deviate from the computation protocol (active behavioral model), is studied. An information-theoretic characterization of unconditionally secure computation protocols under the active behavioral model is provided. A protocol for Hamming distance computation is provided and shown to be unconditionally secure under both active and passive behavioral models using the information-theoretic characterization. The difference betw"},"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":"1206.2669","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-06-12T20:52:23Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"14fe790d78d88f05bc0ccc3863620a00d20032dfecfdfb8effa449763f040e86","abstract_canon_sha256":"483dc1edb37549965c7a724f276fe7b31da1b2d1b3ea2d7dbcdb1d554a8546ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:38.156569Z","signature_b64":"Tz2Bwsk5OIrIA4CwQp9ah3vgX+8wU5Pdu2KXacx4wT15O3AIzxYCClRY+ielb9uI+pfyDmx1pz0CAqOIFP6DDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8527044f41ba412d264dfa0f94204b1c3c07ed365852ec6b7dd8bfa614644d8d","last_reissued_at":"2026-05-18T03:34:38.155683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:38.155683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information-Theoretically Secure Three-Party Computation with One Corrupted Party","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Prakash Ishwar, Shantanu Rane, Ye Wang","submitted_at":"2012-06-12T20:52:23Z","abstract_excerpt":"The problem in which one of three pairwise interacting parties is required to securely compute a function of the inputs held by the other two, when one party may arbitrarily deviate from the computation protocol (active behavioral model), is studied. An information-theoretic characterization of unconditionally secure computation protocols under the active behavioral model is provided. A protocol for Hamming distance computation is provided and shown to be unconditionally secure under both active and passive behavioral models using the information-theoretic characterization. The difference betw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2669","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":"1206.2669","created_at":"2026-05-18T03:34:38.155825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.2669v2","created_at":"2026-05-18T03:34:38.155825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2669","created_at":"2026-05-18T03:34:38.155825+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUTQIT2BXJAS","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUTQIT2BXJAS2JSN","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUTQIT2B","created_at":"2026-05-18T12:27:20.899486+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/QUTQIT2BXJAS2JSN7IHZIICLDQ","json":"https://pith.science/pith/QUTQIT2BXJAS2JSN7IHZIICLDQ.json","graph_json":"https://pith.science/api/pith-number/QUTQIT2BXJAS2JSN7IHZIICLDQ/graph.json","events_json":"https://pith.science/api/pith-number/QUTQIT2BXJAS2JSN7IHZIICLDQ/events.json","paper":"https://pith.science/paper/QUTQIT2B"},"agent_actions":{"view_html":"https://pith.science/pith/QUTQIT2BXJAS2JSN7IHZIICLDQ","download_json":"https://pith.science/pith/QUTQIT2BXJAS2JSN7IHZIICLDQ.json","view_paper":"https://pith.science/paper/QUTQIT2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.2669&json=true","fetch_graph":"https://pith.science/api/pith-number/QUTQIT2BXJAS2JSN7IHZIICLDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/QUTQIT2BXJAS2JSN7IHZIICLDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUTQIT2BXJAS2JSN7IHZIICLDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUTQIT2BXJAS2JSN7IHZIICLDQ/action/storage_attestation","attest_author":"https://pith.science/pith/QUTQIT2BXJAS2JSN7IHZIICLDQ/action/author_attestation","sign_citation":"https://pith.science/pith/QUTQIT2BXJAS2JSN7IHZIICLDQ/action/citation_signature","submit_replication":"https://pith.science/pith/QUTQIT2BXJAS2JSN7IHZIICLDQ/action/replication_record"}},"created_at":"2026-05-18T03:34:38.155825+00:00","updated_at":"2026-05-18T03:34:38.155825+00:00"}