{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DDO5QDYW2XIGAIAA23KOTQ5TMK","short_pith_number":"pith:DDO5QDYW","schema_version":"1.0","canonical_sha256":"18ddd80f16d5d0602000d6d4e9c3b362803f81ee8422f1d2a461a9a8a11ccebf","source":{"kind":"arxiv","id":"2603.11437","version":2},"attestation_state":"computed","paper":{"title":"Unclonable Encryption in the Haar Random Oracle Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Eli Goldin, James Bartusek","submitted_at":"2026-03-12T02:03:51Z","abstract_excerpt":"We construct unclonable encryption (UE) in the Haar random oracle model, where all parties have query access to $U,U^\\dagger,U^*,U^T$ for a Haar random unitary $U$. Our scheme satisfies the standard notion of unclonable indistinguishability security, supports reuse of the secret key, and can encrypt arbitrary-length messages. That is, we give the first evidence that (reusable) UE, which requires computational assumptions, exists in \"microcrypt\", a world where one-way functions may not exist.\n  As one of our central technical contributions, we build on the recently introduced path recording fra"},"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":"2603.11437","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-03-12T02:03:51Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"e43dd2d3b07845871271f1d729c33c1f50fceef9a9961b9be6627cf5db87a6fa","abstract_canon_sha256":"432255fab108437a48df7ce2cbe0f623dee76418f6260a96d3ae37f167af9e2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:56.014070Z","signature_b64":"Omure1FTwv7yKsrG+ltoYxXnm/mMs028xqANPKgT5ah9Jr4hAspyn3DRdHWQZh1GVHRS0hhQPVkuQUaLTjvyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18ddd80f16d5d0602000d6d4e9c3b362803f81ee8422f1d2a461a9a8a11ccebf","last_reissued_at":"2026-06-19T16:09:56.013653Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:56.013653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unclonable Encryption in the Haar Random Oracle Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Eli Goldin, James Bartusek","submitted_at":"2026-03-12T02:03:51Z","abstract_excerpt":"We construct unclonable encryption (UE) in the Haar random oracle model, where all parties have query access to $U,U^\\dagger,U^*,U^T$ for a Haar random unitary $U$. Our scheme satisfies the standard notion of unclonable indistinguishability security, supports reuse of the secret key, and can encrypt arbitrary-length messages. That is, we give the first evidence that (reusable) UE, which requires computational assumptions, exists in \"microcrypt\", a world where one-way functions may not exist.\n  As one of our central technical contributions, we build on the recently introduced path recording fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.11437","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/2603.11437/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.11437","created_at":"2026-06-19T16:09:56.013708+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.11437v2","created_at":"2026-06-19T16:09:56.013708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.11437","created_at":"2026-06-19T16:09:56.013708+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDO5QDYW2XIG","created_at":"2026-06-19T16:09:56.013708+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDO5QDYW2XIGAIAA","created_at":"2026-06-19T16:09:56.013708+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDO5QDYW","created_at":"2026-06-19T16:09:56.013708+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/DDO5QDYW2XIGAIAA23KOTQ5TMK","json":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK.json","graph_json":"https://pith.science/api/pith-number/DDO5QDYW2XIGAIAA23KOTQ5TMK/graph.json","events_json":"https://pith.science/api/pith-number/DDO5QDYW2XIGAIAA23KOTQ5TMK/events.json","paper":"https://pith.science/paper/DDO5QDYW"},"agent_actions":{"view_html":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK","download_json":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK.json","view_paper":"https://pith.science/paper/DDO5QDYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.11437&json=true","fetch_graph":"https://pith.science/api/pith-number/DDO5QDYW2XIGAIAA23KOTQ5TMK/graph.json","fetch_events":"https://pith.science/api/pith-number/DDO5QDYW2XIGAIAA23KOTQ5TMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK/action/storage_attestation","attest_author":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK/action/author_attestation","sign_citation":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK/action/citation_signature","submit_replication":"https://pith.science/pith/DDO5QDYW2XIGAIAA23KOTQ5TMK/action/replication_record"}},"created_at":"2026-06-19T16:09:56.013708+00:00","updated_at":"2026-06-19T16:09:56.013708+00:00"}