{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XVWXGZVOO6TCRL7N63KDURU4LU","short_pith_number":"pith:XVWXGZVO","schema_version":"1.0","canonical_sha256":"bd6d7366ae77a628afedf6d43a469c5d1f9f94e6783bd60d40f1b2ef5985fcb0","source":{"kind":"arxiv","id":"2410.23064","version":2},"attestation_state":"computed","paper":{"title":"Towards Unconditional Uncloneable Encryption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anne Broadbent, Cl\\'ement Pellegrini, Denis Rochette, Eric Culf, Ion Nechita, Pierre Botteron","submitted_at":"2024-10-30T14:40:06Z","abstract_excerpt":"Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and quantum side-information produced from the ciphertext. Since its initial proposal and scheme in the random oracle model by Broadbent and Lord [TQC 2020], uncloneable encryption has developed into an important primitive at the foundation of quantum uncloneability for cryptographic primitives. Despite sustained efforts, however, the question of unconditional uncl"},"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":"2410.23064","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-30T14:40:06Z","cross_cats_sorted":[],"title_canon_sha256":"1f36395dba908647b73004ecafb069f47a7dd7a9cddb8dedd96fe730e34c492e","abstract_canon_sha256":"90de7bfd3434dbd3e29026af4f8d6eff2718942920f99a2656fcd46087b5184f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:12.927866Z","signature_b64":"Rda3NjWfWbFCAfAOO6z19CNgFiQNJFthDcRNXubFQMoD+YKqj3vvucghAgI2f376AwofTRMnDhICH4TKSpkfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd6d7366ae77a628afedf6d43a469c5d1f9f94e6783bd60d40f1b2ef5985fcb0","last_reissued_at":"2026-06-26T01:15:12.927399Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:12.927399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Unconditional Uncloneable Encryption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anne Broadbent, Cl\\'ement Pellegrini, Denis Rochette, Eric Culf, Ion Nechita, Pierre Botteron","submitted_at":"2024-10-30T14:40:06Z","abstract_excerpt":"Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and quantum side-information produced from the ciphertext. Since its initial proposal and scheme in the random oracle model by Broadbent and Lord [TQC 2020], uncloneable encryption has developed into an important primitive at the foundation of quantum uncloneability for cryptographic primitives. Despite sustained efforts, however, the question of unconditional uncl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23064","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/2410.23064/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":"2410.23064","created_at":"2026-06-26T01:15:12.927458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.23064v2","created_at":"2026-06-26T01:15:12.927458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23064","created_at":"2026-06-26T01:15:12.927458+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVWXGZVOO6TC","created_at":"2026-06-26T01:15:12.927458+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVWXGZVOO6TCRL7N","created_at":"2026-06-26T01:15:12.927458+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVWXGZVO","created_at":"2026-06-26T01:15:12.927458+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01831","citing_title":"The curious case of \"XOR repetition\" of monogamy-of-entanglement games","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XVWXGZVOO6TCRL7N63KDURU4LU","json":"https://pith.science/pith/XVWXGZVOO6TCRL7N63KDURU4LU.json","graph_json":"https://pith.science/api/pith-number/XVWXGZVOO6TCRL7N63KDURU4LU/graph.json","events_json":"https://pith.science/api/pith-number/XVWXGZVOO6TCRL7N63KDURU4LU/events.json","paper":"https://pith.science/paper/XVWXGZVO"},"agent_actions":{"view_html":"https://pith.science/pith/XVWXGZVOO6TCRL7N63KDURU4LU","download_json":"https://pith.science/pith/XVWXGZVOO6TCRL7N63KDURU4LU.json","view_paper":"https://pith.science/paper/XVWXGZVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.23064&json=true","fetch_graph":"https://pith.science/api/pith-number/XVWXGZVOO6TCRL7N63KDURU4LU/graph.json","fetch_events":"https://pith.science/api/pith-number/XVWXGZVOO6TCRL7N63KDURU4LU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVWXGZVOO6TCRL7N63KDURU4LU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVWXGZVOO6TCRL7N63KDURU4LU/action/storage_attestation","attest_author":"https://pith.science/pith/XVWXGZVOO6TCRL7N63KDURU4LU/action/author_attestation","sign_citation":"https://pith.science/pith/XVWXGZVOO6TCRL7N63KDURU4LU/action/citation_signature","submit_replication":"https://pith.science/pith/XVWXGZVOO6TCRL7N63KDURU4LU/action/replication_record"}},"created_at":"2026-06-26T01:15:12.927458+00:00","updated_at":"2026-06-26T01:15:12.927458+00:00"}