{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7O7XUNXRHSDBBX5RALDZYJHFEB","short_pith_number":"pith:7O7XUNXR","schema_version":"1.0","canonical_sha256":"fbbf7a36f13c8610dfb102c79c24e5207bdb09b267938d8d762d71d7b12ce18c","source":{"kind":"arxiv","id":"1710.08256","version":1},"attestation_state":"computed","paper":{"title":"A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Anderson C. A. Nascimento, Bernardo David, Kirill Morozov, Paulo S. L. M. Barreto, Rafael Dowsley","submitted_at":"2017-10-23T13:18:11Z","abstract_excerpt":"Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications, in particular, as an essential building block for two-party and multi-party computation. We construct a round-optimal (2 rounds) universally composable (UC) protocol for oblivious transfer secure against active adaptive adversaries from any OW-CPA secure public-key encryption scheme with certain properties in the random oracle model (ROM). In terms of computation, our protocol only requires the generation of a public/secret-key pair, two encryption operations and one decryption operation, apart"},"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":"1710.08256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-10-23T13:18:11Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d6c68360ca6b17be73effb328c4ed027d1e01d625ee9e6faf0b1cd8507551981","abstract_canon_sha256":"53239318ea301f51da3ffcf8b9126ae9aa10568a521118be7263d7e64b850ec9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:16.880416Z","signature_b64":"KqJ0WK1EiA0sf9X9lDd0rHody6fa1tgOatyXu+RptMcnCcvbhPSFV5zqDlIIDHGb/TQhLIknNifqVQ43bldLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbbf7a36f13c8610dfb102c79c24e5207bdb09b267938d8d762d71d7b12ce18c","last_reissued_at":"2026-05-18T00:32:16.879887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:16.879887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Anderson C. A. Nascimento, Bernardo David, Kirill Morozov, Paulo S. L. M. Barreto, Rafael Dowsley","submitted_at":"2017-10-23T13:18:11Z","abstract_excerpt":"Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications, in particular, as an essential building block for two-party and multi-party computation. We construct a round-optimal (2 rounds) universally composable (UC) protocol for oblivious transfer secure against active adaptive adversaries from any OW-CPA secure public-key encryption scheme with certain properties in the random oracle model (ROM). In terms of computation, our protocol only requires the generation of a public/secret-key pair, two encryption operations and one decryption operation, apart"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08256","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":"1710.08256","created_at":"2026-05-18T00:32:16.879976+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.08256v1","created_at":"2026-05-18T00:32:16.879976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08256","created_at":"2026-05-18T00:32:16.879976+00:00"},{"alias_kind":"pith_short_12","alias_value":"7O7XUNXRHSDB","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7O7XUNXRHSDBBX5R","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7O7XUNXR","created_at":"2026-05-18T12:31:05.417338+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/7O7XUNXRHSDBBX5RALDZYJHFEB","json":"https://pith.science/pith/7O7XUNXRHSDBBX5RALDZYJHFEB.json","graph_json":"https://pith.science/api/pith-number/7O7XUNXRHSDBBX5RALDZYJHFEB/graph.json","events_json":"https://pith.science/api/pith-number/7O7XUNXRHSDBBX5RALDZYJHFEB/events.json","paper":"https://pith.science/paper/7O7XUNXR"},"agent_actions":{"view_html":"https://pith.science/pith/7O7XUNXRHSDBBX5RALDZYJHFEB","download_json":"https://pith.science/pith/7O7XUNXRHSDBBX5RALDZYJHFEB.json","view_paper":"https://pith.science/paper/7O7XUNXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.08256&json=true","fetch_graph":"https://pith.science/api/pith-number/7O7XUNXRHSDBBX5RALDZYJHFEB/graph.json","fetch_events":"https://pith.science/api/pith-number/7O7XUNXRHSDBBX5RALDZYJHFEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7O7XUNXRHSDBBX5RALDZYJHFEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7O7XUNXRHSDBBX5RALDZYJHFEB/action/storage_attestation","attest_author":"https://pith.science/pith/7O7XUNXRHSDBBX5RALDZYJHFEB/action/author_attestation","sign_citation":"https://pith.science/pith/7O7XUNXRHSDBBX5RALDZYJHFEB/action/citation_signature","submit_replication":"https://pith.science/pith/7O7XUNXRHSDBBX5RALDZYJHFEB/action/replication_record"}},"created_at":"2026-05-18T00:32:16.879976+00:00","updated_at":"2026-05-18T00:32:16.879976+00:00"}