Untelegraphable Encryption and its Applications
Abstract: 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. Building off this, we give several applications of UTE and study the interplay of UTE with UE and well-studied tasks in quantum state learning, yielding the following contributions: - A construction of collusion-resistant UTE from plain secret-key encryption, which we then show denies the existence of hyper-efficient shadow tomography (HEST). By building a relaxation of collusion-resistant UTE, we show the impossibility of HEST assuming only pseudorandom state generators (which may not imply one-way functions). This almost unconditionally answers an open inquiry of Aaronson (STOC 2018). - A construction of UTE from a one-shot message authentication code in the classical oracle model, such that there is an explicit attack that breaks UE security for an unbounded polynomial number of decryptors. - A construction of everlasting secure collusion-resistant UTE, where the decryptor adversary can run in unbounded time, in the quantum random oracle model (QROM), and formal evidence that a construction in the plain model is a challenging task. We leverage this construction to show that HEST with unbounded post-processing time is impossible in the QROM. - Constructions of secret sharing resilient to joint and unbounded classical leakage and untelegraphable functional encryption.
- Scott Aaronson. Shadow tomography of quantum states. SIAM J. Comput., 49(5):STOC18–368, 2019.
- A modular approach to unclonable cryptography. In CRYPTO, 2024.
- From selective to adaptive security in functional encryption. In Rosario Gennaro and Matthew J. B. Robshaw, editors, CRYPTO 2015, Part II, volume 9216 of LNCS, pages 657–677. Springer, Berlin, Heidelberg, August 2015.
- One-shot signatures and applications to hybrid quantum/classical authentication. In STOC, page 255–268, 2020.
- Unclonable secret sharing. In ASIACRYPT, 2024.
- Quantum security proofs using semi-classical oracles. In Alexandra Boldyreva and Daniele Micciancio, editors, CRYPTO 2019, Part II, volume 11693 of LNCS, pages 269–295. Springer, Cham, August 2019.
- Quantum versus classical proofs and advice. In CCC, 2007.
- Unclonable encryption, revisited. Cryptology ePrint Archive, Report 2021/412, 2021.
- On the feasibility of unclonable encryption, and more. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO 2022, Part II, volume 13508 of LNCS, pages 212–241. Springer, Cham, August 2022.
- Simultaneous haar indistinguishability with applications to unclonable cryptography. arXiv:2405.10274, 2024.
- Quantum np - a survey, 2002.
- Cryptography from pseudorandom quantum states. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO 2022, Part I, volume 13507 of LNCS, pages 208–236. Springer, Cham, August 2022.
- Leftover hash lemma, revisited. In CRYPTO, 2011.
- Uncloneable quantum encryption via oracles. In Steven T. Flammia, editor, 15th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2020, June 9-12, 2020, Riga, Latvia, volume 158 of LIPIcs, pages 4:1–4:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
- Unclonable cryptography with unbounded collusions and impossibility of hyperefficient shadow tomography. In TCC, 2024.
- How to use quantum indistinguishability obfuscation. In Bojan Mohar, Igor Shinkar, and Ryan O’Donnell, editors, 56th ACM STOC, pages 1003–1008. ACM Press, June 2024.
- Unbounded leakage-resilience and leakage-detection in a quantum world. In TCC, 2023.
- Adaptively-secure, non-interactive public-key encryption. In Joe Kilian, editor, TCC 2005, volume 3378 of LNCS, pages 150–168. Springer, Berlin, Heidelberg, February 2005.
- D. Dieks. Communication by epr devices. Phys. Lett. A, 1982.
- Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In EUROCRYPT, 2004.
- Quantum vs. classical proofs and subset verification. In Mathematical Foundations of Computer Science, 2018.
- Separating succinct non-interactive arguments from all falsifiable assumptions. In STOC, 2011.
- Predicting many properties of a quantum system from very few measurements. Nature Physics, 2020.
- Quantum encryption with certified deletion, revisited: Public key, attribute-based, and classical communication. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT 2021, Part I, volume 13090 of LNCS, pages 606–636. Springer, Cham, December 2021.
- Certified everlasting zero-knowledge proof for QMA. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO 2022, Part I, volume 13507 of LNCS, pages 239–268. Springer, Cham, August 2022.
- Bounded-collusion attribute-based encryption from minimal assumptions. In PKC, 2017.
- Be adaptive, avoid overcommitting. In Jonathan Katz and Hovav Shacham, editors, CRYPTO 2017, Part I, volume 10401 of LNCS, pages 133–163. Springer, Cham, August 2017.
- Adaptively secure threshold cryptography: Introducing concurrency, removing erasures. In Bart Preneel, editor, EUROCRYPT 2000, volume 1807 of LNCS, pages 221–242. Springer, Berlin, Heidelberg, May 2000.
- Pseudorandom quantum states. In Hovav Shacham and Alexandra Boldyreva, editors, CRYPTO 2018, Part III, volume 10993 of LNCS, pages 126–152. Springer, Cham, August 2018.
- Functional encryption with secure key leasing. In Shweta Agrawal and Dongdai Lin, editors, ASIACRYPT 2022, Part IV, volume 13794 of LNCS, pages 569–598. Springer, Cham, December 2022.
- One-out-of-many unclonable cryptography: Definitions, constructions, and more. In TCC, 2023.
- Adaptively secure and succinct functional encryption: Improving security and efficiency, simultaneously. In Alexandra Boldyreva and Daniele Micciancio, editors, CRYPTO 2019, Part III, volume 11694 of LNCS, pages 521–551. Springer, Cham, August 2019.
- W. Kretschmer. Quantum pseudorandomness and classical complexity. TQC 2021, 2021.
- Classical vs quantum advice under classically-accessible oracle. In ITCS, 2024.
- Revocable quantum digital signatures. In TQC, pages 5:1–5:24, 2024.
- Long-term security and universal composability. In TCC, 2007.
- Limitations on uncloneable encryption and simultaneous one-way-to-hiding. arXiv:2103.14510, 2021.
- A distribution testing oracle separating qma and qcma. In CCC, 2023.
- A computational separation between quantum no-cloning and no-telegraphing. In ITCS, 2024.
- James L. Park. The concept of transition in quantum mechanics. Foundations of Physics, 1970.
- Oded Regev. On lattices, learning with errors, random linear codes, and cryptography. In STOC, pages 84–93. ACM Press, 2005.
- On the power of computational secret sharing. In INDOCRYPT, 2003.
- K. Vogel and H. Risken. Determination of quasiprobability distributions in terms of probability distributions for the rotated quadrature phase. Physical Review A, 1989.
- R. F. Werner. Optimal cloning of pure states. Physical Review A, 1998.
- Stephen Wiesner. Conjugate coding. SIGACT News, 15(1):78–88, 1983.
- A single quantum cannot be cloned. Nature, 1982.
- Mark Zhandry. Secure identity-based encryption in the quantum random oracle model. In Reihaneh Safavi-Naini and Ran Canetti, editors, CRYPTO 2012, volume 7417 of LNCS, pages 758–775. Springer, Berlin, Heidelberg, August 2012.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.