{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6RAU6IMNOYFYXIRWLJ5Y5QPBJD","short_pith_number":"pith:6RAU6IMN","schema_version":"1.0","canonical_sha256":"f4414f218d760b8ba2365a7b8ec1e148e79296bd309f65264877c5586fce70a1","source":{"kind":"arxiv","id":"1306.6265","version":1},"attestation_state":"computed","paper":{"title":"Towards Secure Two-Party Computation from the Wire-Tap Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Alain Patey, G\\'erard Cohen, Herv\\'e Chabanne","submitted_at":"2013-06-26T15:00:34Z","abstract_excerpt":"We introduce a new protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. We first establish a parallel between the second version of the wire-tap channel model and secure two-party computation. This leads us to our protocol, that combines linear coset coding and oblivious transfer techniques. Our construction requires the use of binary intersecting codes or $q$-ary minimal codes, which are also studied in this paper."},"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":"1306.6265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-06-26T15:00:34Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4649580cd5600102410ba94008cb0fc9fa44190bad29361dbbc94415d478ed91","abstract_canon_sha256":"153dc895b4e571ace911fde47d5c37ae7288d112222552618e6d92b752e06352"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:55.478429Z","signature_b64":"35U65aCiIp1ClmgCTNqE5OERK5b/B3GXCCBzVYFIwpCgwyz6hFScXfHaMDObc6QC9/TTK8VDQ/AEi1+Gtp2QDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4414f218d760b8ba2365a7b8ec1e148e79296bd309f65264877c5586fce70a1","last_reissued_at":"2026-05-18T03:19:55.477676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:55.477676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Secure Two-Party Computation from the Wire-Tap Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Alain Patey, G\\'erard Cohen, Herv\\'e Chabanne","submitted_at":"2013-06-26T15:00:34Z","abstract_excerpt":"We introduce a new protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. We first establish a parallel between the second version of the wire-tap channel model and secure two-party computation. This leads us to our protocol, that combines linear coset coding and oblivious transfer techniques. Our construction requires the use of binary intersecting codes or $q$-ary minimal codes, which are also studied in this paper."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6265","kind":"arxiv","version":1},"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":"1306.6265","created_at":"2026-05-18T03:19:55.477781+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6265v1","created_at":"2026-05-18T03:19:55.477781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6265","created_at":"2026-05-18T03:19:55.477781+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RAU6IMNOYFY","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RAU6IMNOYFYXIRW","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RAU6IMN","created_at":"2026-05-18T12:27:36.564083+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/6RAU6IMNOYFYXIRWLJ5Y5QPBJD","json":"https://pith.science/pith/6RAU6IMNOYFYXIRWLJ5Y5QPBJD.json","graph_json":"https://pith.science/api/pith-number/6RAU6IMNOYFYXIRWLJ5Y5QPBJD/graph.json","events_json":"https://pith.science/api/pith-number/6RAU6IMNOYFYXIRWLJ5Y5QPBJD/events.json","paper":"https://pith.science/paper/6RAU6IMN"},"agent_actions":{"view_html":"https://pith.science/pith/6RAU6IMNOYFYXIRWLJ5Y5QPBJD","download_json":"https://pith.science/pith/6RAU6IMNOYFYXIRWLJ5Y5QPBJD.json","view_paper":"https://pith.science/paper/6RAU6IMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6265&json=true","fetch_graph":"https://pith.science/api/pith-number/6RAU6IMNOYFYXIRWLJ5Y5QPBJD/graph.json","fetch_events":"https://pith.science/api/pith-number/6RAU6IMNOYFYXIRWLJ5Y5QPBJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RAU6IMNOYFYXIRWLJ5Y5QPBJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RAU6IMNOYFYXIRWLJ5Y5QPBJD/action/storage_attestation","attest_author":"https://pith.science/pith/6RAU6IMNOYFYXIRWLJ5Y5QPBJD/action/author_attestation","sign_citation":"https://pith.science/pith/6RAU6IMNOYFYXIRWLJ5Y5QPBJD/action/citation_signature","submit_replication":"https://pith.science/pith/6RAU6IMNOYFYXIRWLJ5Y5QPBJD/action/replication_record"}},"created_at":"2026-05-18T03:19:55.477781+00:00","updated_at":"2026-05-18T03:19:55.477781+00:00"}