{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OQYDGZJTVTCQO6U5VUPRNFKLVD","short_pith_number":"pith:OQYDGZJT","schema_version":"1.0","canonical_sha256":"7430336533acc5077a9dad1f16954ba8d6aa9816d6adc454cd75aea07558d2a0","source":{"kind":"arxiv","id":"2207.06589","version":1},"attestation_state":"computed","paper":{"title":"On the Feasibility of Unclonable Encryption, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Fatih Kaleoglu, Mark Zhandry, Prabhanjan Ananth, Qipeng Liu, Xingjian Li","submitted_at":"2022-07-14T01:03:56Z","abstract_excerpt":"Unclonable encryption, first introduced by Broadbent and Lord (TQC'20), is a one-time encryption scheme with the following security guarantee: any non-local adversary (A, B, C) cannot simultaneously distinguish encryptions of two equal length messages. This notion is termed as unclonable indistinguishability. Prior works focused on achieving a weaker notion of unclonable encryption, where we required that any non-local adversary (A, B, C) cannot simultaneously recover the entire message m. Seemingly innocuous, understanding the feasibility of encryption schemes satisfying unclonable indistingu"},"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":"2207.06589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2022-07-14T01:03:56Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"1628883880a08ed9f54a5a431d394c4b45c72aacd0d901bfa351a524c9ac5584","abstract_canon_sha256":"dbb68b255ce32593b6ce8a35a484e6c60b1bbe73787268c4e07f2e237e3dc6df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:14.487157Z","signature_b64":"oSGzwo6NJ3RLdBKiNoVLRR76P3hoTr5p81aYJuE6GZtb+CMbJgVz1w9jpnAOGjg5u/w88od7tDWrqB0pjjOXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7430336533acc5077a9dad1f16954ba8d6aa9816d6adc454cd75aea07558d2a0","last_reissued_at":"2026-07-05T04:40:14.486747Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:14.486747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Feasibility of Unclonable Encryption, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Fatih Kaleoglu, Mark Zhandry, Prabhanjan Ananth, Qipeng Liu, Xingjian Li","submitted_at":"2022-07-14T01:03:56Z","abstract_excerpt":"Unclonable encryption, first introduced by Broadbent and Lord (TQC'20), is a one-time encryption scheme with the following security guarantee: any non-local adversary (A, B, C) cannot simultaneously distinguish encryptions of two equal length messages. This notion is termed as unclonable indistinguishability. Prior works focused on achieving a weaker notion of unclonable encryption, where we required that any non-local adversary (A, B, C) cannot simultaneously recover the entire message m. Seemingly innocuous, understanding the feasibility of encryption schemes satisfying unclonable indistingu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.06589","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.06589/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":"2207.06589","created_at":"2026-07-05T04:40:14.486805+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.06589v1","created_at":"2026-07-05T04:40:14.486805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.06589","created_at":"2026-07-05T04:40:14.486805+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQYDGZJTVTCQ","created_at":"2026-07-05T04:40:14.486805+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQYDGZJTVTCQO6U5","created_at":"2026-07-05T04:40:14.486805+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQYDGZJT","created_at":"2026-07-05T04:40:14.486805+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/OQYDGZJTVTCQO6U5VUPRNFKLVD","json":"https://pith.science/pith/OQYDGZJTVTCQO6U5VUPRNFKLVD.json","graph_json":"https://pith.science/api/pith-number/OQYDGZJTVTCQO6U5VUPRNFKLVD/graph.json","events_json":"https://pith.science/api/pith-number/OQYDGZJTVTCQO6U5VUPRNFKLVD/events.json","paper":"https://pith.science/paper/OQYDGZJT"},"agent_actions":{"view_html":"https://pith.science/pith/OQYDGZJTVTCQO6U5VUPRNFKLVD","download_json":"https://pith.science/pith/OQYDGZJTVTCQO6U5VUPRNFKLVD.json","view_paper":"https://pith.science/paper/OQYDGZJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.06589&json=true","fetch_graph":"https://pith.science/api/pith-number/OQYDGZJTVTCQO6U5VUPRNFKLVD/graph.json","fetch_events":"https://pith.science/api/pith-number/OQYDGZJTVTCQO6U5VUPRNFKLVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQYDGZJTVTCQO6U5VUPRNFKLVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQYDGZJTVTCQO6U5VUPRNFKLVD/action/storage_attestation","attest_author":"https://pith.science/pith/OQYDGZJTVTCQO6U5VUPRNFKLVD/action/author_attestation","sign_citation":"https://pith.science/pith/OQYDGZJTVTCQO6U5VUPRNFKLVD/action/citation_signature","submit_replication":"https://pith.science/pith/OQYDGZJTVTCQO6U5VUPRNFKLVD/action/replication_record"}},"created_at":"2026-07-05T04:40:14.486805+00:00","updated_at":"2026-07-05T04:40:14.486805+00:00"}