{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ARHXR6I6LQHMLLC22Q3L6YYNFV","short_pith_number":"pith:ARHXR6I6","schema_version":"1.0","canonical_sha256":"044f78f91e5c0ec5ac5ad436bf630d2d5e397741e587b52347880e7ec2844fd9","source":{"kind":"arxiv","id":"2605.27647","version":1},"attestation_state":"computed","paper":{"title":"A Note on Boosting Uncloneable Encryption in Microcrypt","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-05-26T20:09:21Z","abstract_excerpt":"In this note, we consider the setting of uncloneable encryption satisfying uncloneable indistinguishability, a form of symmetric key encryption that prevents the cloning of ciphertexts in a very strong sense. Our goal is to minimize the assumptions under which (many-time secure) uncloneable encryption is known to exist, assuming the existence of an information-theoretic \"uncloneable bit\", i.e. a one-time secure uncloneable encryption scheme for one-bit messages. We observe that if a t -> t' uncloneable bit exists, then the following implications hold.\n  1. If many-time secure symmetric key enc"},"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":"2605.27647","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-26T20:09:21Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"63f1cf5e76c580e0beaefb9dbfcf0d773457be085b016d69c86e859153d0d81d","abstract_canon_sha256":"601f2f05c69c359ac1452800d1fa56f1a767023776b1ae13d31c451ddb038f81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:45.266269Z","signature_b64":"i2iIFnaJjS9qsBnQ5RZB0PQ8O57x67wMLn+x3EETOqMQAO9FTAfm0nj12d6X8SXC6DpludAsDlLC34qAB3IEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"044f78f91e5c0ec5ac5ad436bf630d2d5e397741e587b52347880e7ec2844fd9","last_reissued_at":"2026-05-28T01:04:45.265784Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:45.265784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Boosting Uncloneable Encryption in Microcrypt","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-05-26T20:09:21Z","abstract_excerpt":"In this note, we consider the setting of uncloneable encryption satisfying uncloneable indistinguishability, a form of symmetric key encryption that prevents the cloning of ciphertexts in a very strong sense. Our goal is to minimize the assumptions under which (many-time secure) uncloneable encryption is known to exist, assuming the existence of an information-theoretic \"uncloneable bit\", i.e. a one-time secure uncloneable encryption scheme for one-bit messages. We observe that if a t -> t' uncloneable bit exists, then the following implications hold.\n  1. If many-time secure symmetric key enc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27647","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/2605.27647/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":"2605.27647","created_at":"2026-05-28T01:04:45.265856+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27647v1","created_at":"2026-05-28T01:04:45.265856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27647","created_at":"2026-05-28T01:04:45.265856+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARHXR6I6LQHM","created_at":"2026-05-28T01:04:45.265856+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARHXR6I6LQHMLLC2","created_at":"2026-05-28T01:04:45.265856+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARHXR6I6","created_at":"2026-05-28T01:04:45.265856+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/ARHXR6I6LQHMLLC22Q3L6YYNFV","json":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV.json","graph_json":"https://pith.science/api/pith-number/ARHXR6I6LQHMLLC22Q3L6YYNFV/graph.json","events_json":"https://pith.science/api/pith-number/ARHXR6I6LQHMLLC22Q3L6YYNFV/events.json","paper":"https://pith.science/paper/ARHXR6I6"},"agent_actions":{"view_html":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV","download_json":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV.json","view_paper":"https://pith.science/paper/ARHXR6I6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27647&json=true","fetch_graph":"https://pith.science/api/pith-number/ARHXR6I6LQHMLLC22Q3L6YYNFV/graph.json","fetch_events":"https://pith.science/api/pith-number/ARHXR6I6LQHMLLC22Q3L6YYNFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV/action/storage_attestation","attest_author":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV/action/author_attestation","sign_citation":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV/action/citation_signature","submit_replication":"https://pith.science/pith/ARHXR6I6LQHMLLC22Q3L6YYNFV/action/replication_record"}},"created_at":"2026-05-28T01:04:45.265856+00:00","updated_at":"2026-05-28T01:04:45.265856+00:00"}