{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7O7XUNXRHSDBBX5RALDZYJHFEB","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":"53239318ea301f51da3ffcf8b9126ae9aa10568a521118be7263d7e64b850ec9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-10-23T13:18:11Z","title_canon_sha256":"d6c68360ca6b17be73effb328c4ed027d1e01d625ee9e6faf0b1cd8507551981"},"schema_version":"1.0","source":{"id":"1710.08256","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08256","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08256v1","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08256","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"7O7XUNXRHSDB","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7O7XUNXRHSDBBX5R","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7O7XUNXR","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:0f516a2fef5566f995226f225a8f6aff9316fe1af4bfccf8d2d3bd9ec16c0cc5","target":"graph","created_at":"2026-05-18T00:32:16Z","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":"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","authors_text":"Anderson C. A. Nascimento, Bernardo David, Kirill Morozov, Paulo S. L. M. Barreto, Rafael Dowsley","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-10-23T13:18:11Z","title":"A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08256","kind":"arxiv","version":1},"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:4b6296d0853d07644e1334b10e38cfb21bb9ec72db91a548a34d13dc4fe5e8dc","target":"record","created_at":"2026-05-18T00:32:16Z","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":"53239318ea301f51da3ffcf8b9126ae9aa10568a521118be7263d7e64b850ec9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-10-23T13:18:11Z","title_canon_sha256":"d6c68360ca6b17be73effb328c4ed027d1e01d625ee9e6faf0b1cd8507551981"},"schema_version":"1.0","source":{"id":"1710.08256","kind":"arxiv","version":1}},"canonical_sha256":"fbbf7a36f13c8610dfb102c79c24e5207bdb09b267938d8d762d71d7b12ce18c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbbf7a36f13c8610dfb102c79c24e5207bdb09b267938d8d762d71d7b12ce18c","first_computed_at":"2026-05-18T00:32:16.879887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:16.879887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KqJ0WK1EiA0sf9X9lDd0rHody6fa1tgOatyXu+RptMcnCcvbhPSFV5zqDlIIDHGb/TQhLIknNifqVQ43bldLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:16.880416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08256","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b6296d0853d07644e1334b10e38cfb21bb9ec72db91a548a34d13dc4fe5e8dc","sha256:0f516a2fef5566f995226f225a8f6aff9316fe1af4bfccf8d2d3bd9ec16c0cc5"],"state_sha256":"cb4689a2c62c34250409e3c962b06dbbd33ae44680543df32c0d24d8f317f82e"}