{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ON6T4BGLJS3QJWZY27ZNK4CFCK","short_pith_number":"pith:ON6T4BGL","canonical_record":{"source":{"id":"1808.10145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-08-30T07:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"70b225812e789f621d74d77c8e822fdf00aa46f5714bd8820e0764142e5a96c4","abstract_canon_sha256":"274bd50d0ef3fe73a5e25538af69270a6abe9f4b57e4feba86b6fcedf9fdd6dd"},"schema_version":"1.0"},"canonical_sha256":"737d3e04cb4cb704db38d7f2d5704512b465518322a88b56ebe07a4b5b122c4d","source":{"kind":"arxiv","id":"1808.10145","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10145","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10145v1","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10145","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"ON6T4BGLJS3Q","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ON6T4BGLJS3QJWZY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ON6T4BGL","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ON6T4BGLJS3QJWZY27ZNK4CFCK","target":"record","payload":{"canonical_record":{"source":{"id":"1808.10145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-08-30T07:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"70b225812e789f621d74d77c8e822fdf00aa46f5714bd8820e0764142e5a96c4","abstract_canon_sha256":"274bd50d0ef3fe73a5e25538af69270a6abe9f4b57e4feba86b6fcedf9fdd6dd"},"schema_version":"1.0"},"canonical_sha256":"737d3e04cb4cb704db38d7f2d5704512b465518322a88b56ebe07a4b5b122c4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:49.690288Z","signature_b64":"eNjChOzmJnWr1owfwG5Mn3H2CAXvJH2sVAx1xyGQLfZw6StKP2WezYra4UKIoXg5DUk3CVFfpGpSbRQQVc+xDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"737d3e04cb4cb704db38d7f2d5704512b465518322a88b56ebe07a4b5b122c4d","last_reissued_at":"2026-05-18T00:06:49.689551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:49.689551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.10145","source_version":1,"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-18T00:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cS8fyKXfibpR5o1yfh1IbXEJPOhNcZq7LRjRyqbHOA0ujgeEMP1hXBavytwnB7TJ7zbqLu1SvpEIy51muiJWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:45:56.547654Z"},"content_sha256":"1ca2ee14171f716d36910ed309d64789f2cb8d6d8a61ffffa43d5f179137bae4","schema_version":"1.0","event_id":"sha256:1ca2ee14171f716d36910ed309d64789f2cb8d6d8a61ffffa43d5f179137bae4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ON6T4BGLJS3QJWZY27ZNK4CFCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Composability of Statistically Secure Random Oblivious Transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anderson C. A. Nascimento, J\\\"orn M\\\"uller-Quade, Rafael Dowsley","submitted_at":"2018-08-30T07:10:35Z","abstract_excerpt":"We show that stand-alone statistically secure random oblivious transfer protocols based on two-party stateless primitives are statistically universally composable. I.e. they are simulatable secure with an unlimited adversary, an unlimited simulator and an unlimited environment machine. Our result implies that several previous oblivious transfer protocols in the literature which were proven secure under weaker, non-composable definitions of security can actually be used in arbitrary statistically secure applications without lowering the security."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10145","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"},"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-18T00:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxiDwqoRsyDS4D8cMivgJkDMPufXqcmAeZfiIUumB69AxwjYXE/i6R1IBfwxjzCDBJ2CZsgMGnGK8tlChFU4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:45:56.548365Z"},"content_sha256":"3d007cd34c090c97a1a50e37b5e2042177c4a46484e9ffa42d1970dee9461fe3","schema_version":"1.0","event_id":"sha256:3d007cd34c090c97a1a50e37b5e2042177c4a46484e9ffa42d1970dee9461fe3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ON6T4BGLJS3QJWZY27ZNK4CFCK/bundle.json","state_url":"https://pith.science/pith/ON6T4BGLJS3QJWZY27ZNK4CFCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ON6T4BGLJS3QJWZY27ZNK4CFCK/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-08T06:45:56Z","links":{"resolver":"https://pith.science/pith/ON6T4BGLJS3QJWZY27ZNK4CFCK","bundle":"https://pith.science/pith/ON6T4BGLJS3QJWZY27ZNK4CFCK/bundle.json","state":"https://pith.science/pith/ON6T4BGLJS3QJWZY27ZNK4CFCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ON6T4BGLJS3QJWZY27ZNK4CFCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ON6T4BGLJS3QJWZY27ZNK4CFCK","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":"274bd50d0ef3fe73a5e25538af69270a6abe9f4b57e4feba86b6fcedf9fdd6dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-08-30T07:10:35Z","title_canon_sha256":"70b225812e789f621d74d77c8e822fdf00aa46f5714bd8820e0764142e5a96c4"},"schema_version":"1.0","source":{"id":"1808.10145","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10145","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10145v1","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10145","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"ON6T4BGLJS3Q","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ON6T4BGLJS3QJWZY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ON6T4BGL","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:3d007cd34c090c97a1a50e37b5e2042177c4a46484e9ffa42d1970dee9461fe3","target":"graph","created_at":"2026-05-18T00:06:49Z","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 show that stand-alone statistically secure random oblivious transfer protocols based on two-party stateless primitives are statistically universally composable. I.e. they are simulatable secure with an unlimited adversary, an unlimited simulator and an unlimited environment machine. Our result implies that several previous oblivious transfer protocols in the literature which were proven secure under weaker, non-composable definitions of security can actually be used in arbitrary statistically secure applications without lowering the security.","authors_text":"Anderson C. A. Nascimento, J\\\"orn M\\\"uller-Quade, Rafael Dowsley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-08-30T07:10:35Z","title":"On the Composability of Statistically Secure Random Oblivious Transfer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10145","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:1ca2ee14171f716d36910ed309d64789f2cb8d6d8a61ffffa43d5f179137bae4","target":"record","created_at":"2026-05-18T00:06:49Z","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":"274bd50d0ef3fe73a5e25538af69270a6abe9f4b57e4feba86b6fcedf9fdd6dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-08-30T07:10:35Z","title_canon_sha256":"70b225812e789f621d74d77c8e822fdf00aa46f5714bd8820e0764142e5a96c4"},"schema_version":"1.0","source":{"id":"1808.10145","kind":"arxiv","version":1}},"canonical_sha256":"737d3e04cb4cb704db38d7f2d5704512b465518322a88b56ebe07a4b5b122c4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"737d3e04cb4cb704db38d7f2d5704512b465518322a88b56ebe07a4b5b122c4d","first_computed_at":"2026-05-18T00:06:49.689551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:49.689551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eNjChOzmJnWr1owfwG5Mn3H2CAXvJH2sVAx1xyGQLfZw6StKP2WezYra4UKIoXg5DUk3CVFfpGpSbRQQVc+xDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:49.690288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10145","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ca2ee14171f716d36910ed309d64789f2cb8d6d8a61ffffa43d5f179137bae4","sha256:3d007cd34c090c97a1a50e37b5e2042177c4a46484e9ffa42d1970dee9461fe3"],"state_sha256":"a7eb22e88a48d2a0ad5a5007e974706f50d3731516093d1389eb6e328c9d6df5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tCkwfUN+HJOvHO2z3L1HFpmfYh2LLbCkw482qIhvFx78caAksEcjz0IUEJV4PWw9Ni2A7o/42kusENbz33M9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:45:56.551288Z","bundle_sha256":"d00e0e74cdfd8b0f2e3ed07e48c6fa5b20729849b738235e5d567803f99863a2"}}