{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IWKIQOSGWIZGYP4L3HUWMQVZWX","short_pith_number":"pith:IWKIQOSG","schema_version":"1.0","canonical_sha256":"4594883a46b2326c3f8bd9e96642b9b5ef553902893cc21aedf2ce63c01846d9","source":{"kind":"arxiv","id":"2410.24189","version":2},"attestation_state":"computed","paper":{"title":"Untelegraphable Encryption and its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Fuyuki Kitagawa, Jeffrey Champion, Ryo Nishimaki, Takashi Yamakawa","submitted_at":"2024-10-31T17:50:53Z","abstract_excerpt":"We initiate the study of untelegraphable encryption (UTE), founded on the no-telegraphing principle, which allows an encryptor to encrypt a message such that a binary string representation of the ciphertext cannot be decrypted by a user with the secret key, a task that is classically impossible. This is a natural relaxation of unclonable encryption (UE), inspired by the recent work of Nehoran and Zhandry (ITCS 2024), who showed a computational separation between the no-cloning and no-telegraphing principles. In this work, we define and construct UTE information-theoretically in the plain model"},"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.24189","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-31T17:50:53Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"8d60a6f1c67dc537b64901ac30dd84df047f3f1de602dc6e8c97ff18fe7ffe42","abstract_canon_sha256":"b35b806430b3167995b0525d9aa25bc00601e177ec72209f6e9290c6cf93a03e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:14.190605Z","signature_b64":"3cUOTfu5Bx0FXYWmgrwRZg8jcHVFiyrPZLeAZfYpMvOLYtfHFK6aQXXPdRTcyAljF39yF8oji44qFtm0h4tSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4594883a46b2326c3f8bd9e96642b9b5ef553902893cc21aedf2ce63c01846d9","last_reissued_at":"2026-07-05T10:05:14.190070Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:14.190070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Untelegraphable Encryption and its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Fuyuki Kitagawa, Jeffrey Champion, Ryo Nishimaki, Takashi Yamakawa","submitted_at":"2024-10-31T17:50:53Z","abstract_excerpt":"We initiate the study of untelegraphable encryption (UTE), founded on the no-telegraphing principle, which allows an encryptor to encrypt a message such that a binary string representation of the ciphertext cannot be decrypted by a user with the secret key, a task that is classically impossible. This is a natural relaxation of unclonable encryption (UE), inspired by the recent work of Nehoran and Zhandry (ITCS 2024), who showed a computational separation between the no-cloning and no-telegraphing principles. In this work, we define and construct UTE information-theoretically in the plain model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.24189","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.24189/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.24189","created_at":"2026-07-05T10:05:14.190130+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.24189v2","created_at":"2026-07-05T10:05:14.190130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.24189","created_at":"2026-07-05T10:05:14.190130+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWKIQOSGWIZG","created_at":"2026-07-05T10:05:14.190130+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWKIQOSGWIZGYP4L","created_at":"2026-07-05T10:05:14.190130+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWKIQOSG","created_at":"2026-07-05T10:05:14.190130+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":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IWKIQOSGWIZGYP4L3HUWMQVZWX","json":"https://pith.science/pith/IWKIQOSGWIZGYP4L3HUWMQVZWX.json","graph_json":"https://pith.science/api/pith-number/IWKIQOSGWIZGYP4L3HUWMQVZWX/graph.json","events_json":"https://pith.science/api/pith-number/IWKIQOSGWIZGYP4L3HUWMQVZWX/events.json","paper":"https://pith.science/paper/IWKIQOSG"},"agent_actions":{"view_html":"https://pith.science/pith/IWKIQOSGWIZGYP4L3HUWMQVZWX","download_json":"https://pith.science/pith/IWKIQOSGWIZGYP4L3HUWMQVZWX.json","view_paper":"https://pith.science/paper/IWKIQOSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.24189&json=true","fetch_graph":"https://pith.science/api/pith-number/IWKIQOSGWIZGYP4L3HUWMQVZWX/graph.json","fetch_events":"https://pith.science/api/pith-number/IWKIQOSGWIZGYP4L3HUWMQVZWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWKIQOSGWIZGYP4L3HUWMQVZWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWKIQOSGWIZGYP4L3HUWMQVZWX/action/storage_attestation","attest_author":"https://pith.science/pith/IWKIQOSGWIZGYP4L3HUWMQVZWX/action/author_attestation","sign_citation":"https://pith.science/pith/IWKIQOSGWIZGYP4L3HUWMQVZWX/action/citation_signature","submit_replication":"https://pith.science/pith/IWKIQOSGWIZGYP4L3HUWMQVZWX/action/replication_record"}},"created_at":"2026-07-05T10:05:14.190130+00:00","updated_at":"2026-07-05T10:05:14.190130+00:00"}