{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:E5YQQ6QRPAIFCIQY2NHFLDGKXE","short_pith_number":"pith:E5YQQ6QR","canonical_record":{"source":{"id":"2103.15009","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-03-27T22:37:59Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"2ac748380a1c85fa709dac6c2ef851377d6b21aa0c1b24cfe3af765a60efb344","abstract_canon_sha256":"5a067a43431930f50e25e882568406092e1e9452be68cb2ccdad1794504dd371"},"schema_version":"1.0"},"canonical_sha256":"2771087a117810512218d34e558ccab939f803050f32cf3453e30d388001af8d","source":{"kind":"arxiv","id":"2103.15009","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.15009","created_at":"2026-07-05T03:14:33Z"},{"alias_kind":"arxiv_version","alias_value":"2103.15009v2","created_at":"2026-07-05T03:14:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15009","created_at":"2026-07-05T03:14:33Z"},{"alias_kind":"pith_short_12","alias_value":"E5YQQ6QRPAIF","created_at":"2026-07-05T03:14:33Z"},{"alias_kind":"pith_short_16","alias_value":"E5YQQ6QRPAIFCIQY","created_at":"2026-07-05T03:14:33Z"},{"alias_kind":"pith_short_8","alias_value":"E5YQQ6QR","created_at":"2026-07-05T03:14:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:E5YQQ6QRPAIFCIQY2NHFLDGKXE","target":"record","payload":{"canonical_record":{"source":{"id":"2103.15009","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-03-27T22:37:59Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"2ac748380a1c85fa709dac6c2ef851377d6b21aa0c1b24cfe3af765a60efb344","abstract_canon_sha256":"5a067a43431930f50e25e882568406092e1e9452be68cb2ccdad1794504dd371"},"schema_version":"1.0"},"canonical_sha256":"2771087a117810512218d34e558ccab939f803050f32cf3453e30d388001af8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:14:33.999375Z","signature_b64":"WiNOZtnyXJ82DW4QR5zBm0WxQCcFCGDI6DClD8m9+QlllIC7Woga5b/nhcRquhSKJ2NU1DE35JzmFOOiCnfaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2771087a117810512218d34e558ccab939f803050f32cf3453e30d388001af8d","last_reissued_at":"2026-07-05T03:14:33.998886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:14:33.998886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.15009","source_version":2,"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-07-05T03:14:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zT24h7btCXCZkhjyQhsc0qaOr4Fai0rpIx2Iik5X6RgLvPQn+HtNAC6QZtnaXqkiwwXciA1usNoNcCJaNi4ZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:43:06.414933Z"},"content_sha256":"25b975b8fb54e67dfbed781ff675fe0d5840635db26fa82f664f0453bd3e888d","schema_version":"1.0","event_id":"sha256:25b975b8fb54e67dfbed781ff675fe0d5840635db26fa82f664f0453bd3e888d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:E5YQQ6QRPAIFCIQY2NHFLDGKXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unclonable Encryption, Revisited","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Fatih Kaleoglu, Prabhanjan Ananth","submitted_at":"2021-03-27T22:37:59Z","abstract_excerpt":"Unclonable encryption, introduced by Broadbent and Lord (TQC'20), is an encryption scheme with the following attractive feature: given a ciphertext, an adversary cannot create two ciphertexts both of which decrypt to the same message as the original ciphertext. We revisit this notion and show the following:\n  - Reusability: The constructions proposed by Broadbent and Lord have the disadvantage that they either guarantee one-time security (that is, the encryption key can only be used once to encrypt the message) in the plain model or they guaranteed security in the random oracle model. We const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15009","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.15009/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:14:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOLJamtK4POdsPRV9NLZ9Rfk7oCcPSmxAkDn6nnc+xKXZCd1yiUO6WSCXh8QHcUKqut+Q87SHhVVIr6JcVBdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:43:06.415844Z"},"content_sha256":"21235f89d2ad4a7d3e494346e7e4066e7c812f4915215d65a88d6f62419320ec","schema_version":"1.0","event_id":"sha256:21235f89d2ad4a7d3e494346e7e4066e7c812f4915215d65a88d6f62419320ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5YQQ6QRPAIFCIQY2NHFLDGKXE/bundle.json","state_url":"https://pith.science/pith/E5YQQ6QRPAIFCIQY2NHFLDGKXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5YQQ6QRPAIFCIQY2NHFLDGKXE/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-08-05T15:43:06Z","links":{"resolver":"https://pith.science/pith/E5YQQ6QRPAIFCIQY2NHFLDGKXE","bundle":"https://pith.science/pith/E5YQQ6QRPAIFCIQY2NHFLDGKXE/bundle.json","state":"https://pith.science/pith/E5YQQ6QRPAIFCIQY2NHFLDGKXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5YQQ6QRPAIFCIQY2NHFLDGKXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:E5YQQ6QRPAIFCIQY2NHFLDGKXE","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":"5a067a43431930f50e25e882568406092e1e9452be68cb2ccdad1794504dd371","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-03-27T22:37:59Z","title_canon_sha256":"2ac748380a1c85fa709dac6c2ef851377d6b21aa0c1b24cfe3af765a60efb344"},"schema_version":"1.0","source":{"id":"2103.15009","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.15009","created_at":"2026-07-05T03:14:33Z"},{"alias_kind":"arxiv_version","alias_value":"2103.15009v2","created_at":"2026-07-05T03:14:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15009","created_at":"2026-07-05T03:14:33Z"},{"alias_kind":"pith_short_12","alias_value":"E5YQQ6QRPAIF","created_at":"2026-07-05T03:14:33Z"},{"alias_kind":"pith_short_16","alias_value":"E5YQQ6QRPAIFCIQY","created_at":"2026-07-05T03:14:33Z"},{"alias_kind":"pith_short_8","alias_value":"E5YQQ6QR","created_at":"2026-07-05T03:14:33Z"}],"graph_snapshots":[{"event_id":"sha256:21235f89d2ad4a7d3e494346e7e4066e7c812f4915215d65a88d6f62419320ec","target":"graph","created_at":"2026-07-05T03:14:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2103.15009/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Unclonable encryption, introduced by Broadbent and Lord (TQC'20), is an encryption scheme with the following attractive feature: given a ciphertext, an adversary cannot create two ciphertexts both of which decrypt to the same message as the original ciphertext. We revisit this notion and show the following:\n  - Reusability: The constructions proposed by Broadbent and Lord have the disadvantage that they either guarantee one-time security (that is, the encryption key can only be used once to encrypt the message) in the plain model or they guaranteed security in the random oracle model. We const","authors_text":"Fatih Kaleoglu, Prabhanjan Ananth","cross_cats":["quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-03-27T22:37:59Z","title":"Unclonable Encryption, Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15009","kind":"arxiv","version":2},"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:25b975b8fb54e67dfbed781ff675fe0d5840635db26fa82f664f0453bd3e888d","target":"record","created_at":"2026-07-05T03:14:33Z","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":"5a067a43431930f50e25e882568406092e1e9452be68cb2ccdad1794504dd371","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-03-27T22:37:59Z","title_canon_sha256":"2ac748380a1c85fa709dac6c2ef851377d6b21aa0c1b24cfe3af765a60efb344"},"schema_version":"1.0","source":{"id":"2103.15009","kind":"arxiv","version":2}},"canonical_sha256":"2771087a117810512218d34e558ccab939f803050f32cf3453e30d388001af8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2771087a117810512218d34e558ccab939f803050f32cf3453e30d388001af8d","first_computed_at":"2026-07-05T03:14:33.998886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:14:33.998886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WiNOZtnyXJ82DW4QR5zBm0WxQCcFCGDI6DClD8m9+QlllIC7Woga5b/nhcRquhSKJ2NU1DE35JzmFOOiCnfaCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:14:33.999375Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.15009","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25b975b8fb54e67dfbed781ff675fe0d5840635db26fa82f664f0453bd3e888d","sha256:21235f89d2ad4a7d3e494346e7e4066e7c812f4915215d65a88d6f62419320ec"],"state_sha256":"823de9d927f850525e5c8674445f70a455ec24c25636b18257c9b36fec0f4f4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TneevCo+cKbdw+i4xXbKuV4GWcs7Xlx9Gl7VRYTqnkxorJKGWx/Y8pOwWXrEUt+lJPdxgdDXiaRQWBmJushZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T15:43:06.423314Z","bundle_sha256":"cb6815fd08836c8f72b63a53c9192520900a01c08f41fbc7b993ba5994bbb15e"}}