{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QOXFOG2BFXPFBLVD54T7JJNOSW","short_pith_number":"pith:QOXFOG2B","canonical_record":{"source":{"id":"1005.0043","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-01T03:45:56Z","cross_cats_sorted":[],"title_canon_sha256":"2d73bd5d959e79493ad9e1c9a9db9020197292801ab081d9ac47ef3332a87032","abstract_canon_sha256":"3be2a0b5bc4ee4333fab264cb99f846002623cd423f7d9a2f4fc1fff48db5a0c"},"schema_version":"1.0"},"canonical_sha256":"83ae571b412dde50aea3ef27f4a5ae95906691cc6f0d5cf08f9acfe573462acb","source":{"kind":"arxiv","id":"1005.0043","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0043","created_at":"2026-05-18T04:25:13Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0043v3","created_at":"2026-05-18T04:25:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0043","created_at":"2026-05-18T04:25:13Z"},{"alias_kind":"pith_short_12","alias_value":"QOXFOG2BFXPF","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QOXFOG2BFXPFBLVD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QOXFOG2B","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QOXFOG2BFXPFBLVD54T7JJNOSW","target":"record","payload":{"canonical_record":{"source":{"id":"1005.0043","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-01T03:45:56Z","cross_cats_sorted":[],"title_canon_sha256":"2d73bd5d959e79493ad9e1c9a9db9020197292801ab081d9ac47ef3332a87032","abstract_canon_sha256":"3be2a0b5bc4ee4333fab264cb99f846002623cd423f7d9a2f4fc1fff48db5a0c"},"schema_version":"1.0"},"canonical_sha256":"83ae571b412dde50aea3ef27f4a5ae95906691cc6f0d5cf08f9acfe573462acb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:13.282956Z","signature_b64":"Ca1BhVGedb7uLOudcTJYzJ+HJMcXkD4sZ95TvL0Z7cQCjmZfMcia8rUpYPXXxwNexsTDkdlh4u2QcoXAdro4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83ae571b412dde50aea3ef27f4a5ae95906691cc6f0d5cf08f9acfe573462acb","last_reissued_at":"2026-05-18T04:25:13.282363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:13.282363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.0043","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:25:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgNlz6C4RuSHoNgCDDSBJv3GipYumDKiH6RyiPimDNle3hDVRQIkNCSO2oZYHRoeLzFBos19Xg1iPr2BQqyoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:08:00.382288Z"},"content_sha256":"768ad4dd8306143e4405ada05f6a18dff5734900c471a3eed7b62864a13d57da","schema_version":"1.0","event_id":"sha256:768ad4dd8306143e4405ada05f6a18dff5734900c471a3eed7b62864a13d57da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QOXFOG2BFXPFBLVD54T7JJNOSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework For Fully-Simulatable $h$-Out-Of-$n$ Oblivious Transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Bing Zeng, Chingfang Hsu, Xueming Tang","submitted_at":"2010-05-01T03:45:56Z","abstract_excerpt":"We present a framework for fully-simulatable $h$-out-of-$n$ oblivious transfer ($OT^{n}_{h}$) with security against non-adaptive malicious adversaries. The framework costs six communication rounds and costs at most $40n$ public-key operations in computational overhead. Compared with the known protocols for fully-simulatable oblivious transfer that works in the plain mode (where there is no trusted common reference string available) and proven to be secure under standard model (where there is no random oracle available), the instantiation based on the decisional Diffie-Hellman assumption of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0043","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:25:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BqnzB/KyC5uCi985+vHUg/9pGH4IUdbJdC3Ht7TO64G27rtXN+axo+pD/47qT9uVmKMPcoM/94duW/Xa4vukAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:08:00.382645Z"},"content_sha256":"6ca05c3dd98be870edbbcc50beb43bed1a5572a568eee99568ac1430455d8abc","schema_version":"1.0","event_id":"sha256:6ca05c3dd98be870edbbcc50beb43bed1a5572a568eee99568ac1430455d8abc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOXFOG2BFXPFBLVD54T7JJNOSW/bundle.json","state_url":"https://pith.science/pith/QOXFOG2BFXPFBLVD54T7JJNOSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOXFOG2BFXPFBLVD54T7JJNOSW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T12:08:00Z","links":{"resolver":"https://pith.science/pith/QOXFOG2BFXPFBLVD54T7JJNOSW","bundle":"https://pith.science/pith/QOXFOG2BFXPFBLVD54T7JJNOSW/bundle.json","state":"https://pith.science/pith/QOXFOG2BFXPFBLVD54T7JJNOSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOXFOG2BFXPFBLVD54T7JJNOSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QOXFOG2BFXPFBLVD54T7JJNOSW","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":"3be2a0b5bc4ee4333fab264cb99f846002623cd423f7d9a2f4fc1fff48db5a0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-01T03:45:56Z","title_canon_sha256":"2d73bd5d959e79493ad9e1c9a9db9020197292801ab081d9ac47ef3332a87032"},"schema_version":"1.0","source":{"id":"1005.0043","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0043","created_at":"2026-05-18T04:25:13Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0043v3","created_at":"2026-05-18T04:25:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0043","created_at":"2026-05-18T04:25:13Z"},{"alias_kind":"pith_short_12","alias_value":"QOXFOG2BFXPF","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QOXFOG2BFXPFBLVD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QOXFOG2B","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:6ca05c3dd98be870edbbcc50beb43bed1a5572a568eee99568ac1430455d8abc","target":"graph","created_at":"2026-05-18T04:25:13Z","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":"We present a framework for fully-simulatable $h$-out-of-$n$ oblivious transfer ($OT^{n}_{h}$) with security against non-adaptive malicious adversaries. The framework costs six communication rounds and costs at most $40n$ public-key operations in computational overhead. Compared with the known protocols for fully-simulatable oblivious transfer that works in the plain mode (where there is no trusted common reference string available) and proven to be secure under standard model (where there is no random oracle available), the instantiation based on the decisional Diffie-Hellman assumption of the","authors_text":"Bing Zeng, Chingfang Hsu, Xueming Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-01T03:45:56Z","title":"A Framework For Fully-Simulatable $h$-Out-Of-$n$ Oblivious Transfer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0043","kind":"arxiv","version":3},"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:768ad4dd8306143e4405ada05f6a18dff5734900c471a3eed7b62864a13d57da","target":"record","created_at":"2026-05-18T04:25:13Z","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":"3be2a0b5bc4ee4333fab264cb99f846002623cd423f7d9a2f4fc1fff48db5a0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-01T03:45:56Z","title_canon_sha256":"2d73bd5d959e79493ad9e1c9a9db9020197292801ab081d9ac47ef3332a87032"},"schema_version":"1.0","source":{"id":"1005.0043","kind":"arxiv","version":3}},"canonical_sha256":"83ae571b412dde50aea3ef27f4a5ae95906691cc6f0d5cf08f9acfe573462acb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83ae571b412dde50aea3ef27f4a5ae95906691cc6f0d5cf08f9acfe573462acb","first_computed_at":"2026-05-18T04:25:13.282363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:13.282363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ca1BhVGedb7uLOudcTJYzJ+HJMcXkD4sZ95TvL0Z7cQCjmZfMcia8rUpYPXXxwNexsTDkdlh4u2QcoXAdro4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:13.282956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.0043","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:768ad4dd8306143e4405ada05f6a18dff5734900c471a3eed7b62864a13d57da","sha256:6ca05c3dd98be870edbbcc50beb43bed1a5572a568eee99568ac1430455d8abc"],"state_sha256":"c2a6e8723cbab435b9ba49e3db1c4d39fe6337a302376e579ee04053c7659109"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EcRefzdkvwMN0s3kpfKwJvF2DmEdnCRyednYXfspNAxH9LGhFLRQuwoGPRCNvqAlYRuGyrZ0Fef+bb2+UAaXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:08:00.384606Z","bundle_sha256":"067f32f04209cc6d809900a6d783882cc11215db34d73219eb7d6f9fcda297af"}}