Document Open Access Logo

Powerful Primitives in the Bounded Quantum Storage Model

Authors Mohammed Barhoush, Louis Salvail

PDF

File

Thumbnail PDF
PDF
LIPIcs.ITC.2025.2.pdf
  • Filesize: 0.88 MB
  • 20 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Security and privacy → Information-theoretic techniques
Keywords
  • Quantum Cryptography
  • Bounded Quantum Storage Model
  • Information-Theoretic Security

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The bounded quantum storage model aims to achieve security against computationally unbounded adversaries that are restricted only with respect to their quantum memories. In this work, we provide the following contributions in this model:  
1) We build one-time programs and utilize them to construct CCA1-secure symmetric key encryption and message authentication codes. These schemes require no quantum memory from honest users, yet they provide information-theoretic security against adversaries with arbitrarily large quantum memories, as long as the transmission length is suitably large.
2) We introduce the notion of k-time program broadcast which is a form of program encryption that allows multiple users to each learn a single evaluation of the encrypted program, while preventing any one user from learning more than k evaluations of the program. We build this primitive unconditionally and employ it to construct CCA1-secure asymmetric key encryption, encryption tokens, signatures, and signature tokens. All these schemes are information-theoretically secure against adversaries with roughly e^√m quantum memory where m is the quantum memory required for the honest user.  All of the constructions additionally satisfy disappearing security, essentially preventing an adversary from storing and using a transmission later on.

Cite As Get BibTex

Mohammed Barhoush and Louis Salvail. Powerful Primitives in the Bounded Quantum Storage Model. In 6th Conference on Information-Theoretic Cryptography (ITC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 343, pp. 2:1-2:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ITC.2025.2

Author Details

Mohammed Barhoush
  • Université de Montréal (DIRO), Canada
Louis Salvail
  • Université de Montréal (DIRO), Canada

References

  1. Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im) possibility of obfuscating programs. In Annual international cryptology conference, pages 1-18. Springer, 2001. URL: https://doi.org/10.1007/3-540-44647-8_1.
  2. Mohammed Barhoush and Louis Salvail. How to sign quantum messages. arXiv preprint arXiv:2304.06325, 2023. URL: https://doi.org/10.48550/arXiv.2304.06325.
  3. Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, and Alain Tapp. Authentication of quantum messages. In Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on, pages 449-458, 2002. URL: https://doi.org/10.1109/SFCS.2002.1181969.
  4. Khashayar Barooti, Giulio Malavolta, and Michael Walter. A simple construction of quantum public-key encryption from quantum-secure one-way functions. arXiv preprint, 2023. URL: https://arxiv.org/abs/2303.01143.
  5. Shalev Ben-David and Or Sattath. Quantum tokens for digital signatures. Quantum, 7:901, 2023. URL: https://doi.org/10.22331/Q-2023-01-19-901.
  6. Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, and Alon Rosen. The impossibility of obfuscation with auxiliary input or a universal simulator. In Annual Cryptology Conference, pages 71-89. Springer, 2014. URL: https://doi.org/10.1007/978-3-662-44381-1_5.
  7. Anne Broadbent, Gus Gutoski, and Douglas Stebila. Quantum one-time programs. In Annual Cryptology Conference, pages 344-360. Springer, 2013. Google Scholar
  8. Ronald Cramer and Victor Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Annual international cryptology conference, pages 13-25. Springer, 1998. URL: https://doi.org/10.1007/BFB0055717.
  9. Ivan Damgård, Serge Fehr, Louis Salvail, and Christian Schaffner. Cryptography in the bounded-quantum-storage model. SIAM Journal on Computing, 37(6):1865-1890, 2008. URL: https://doi.org/10.1137/060651343.
  10. Ivan B Damgård, Serge Fehr, Renato Renner, Louis Salvail, and Christian Schaffner. A tight high-order entropic quantum uncertainty relation with applications. In Advances in Cryptology-CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings 27, pages 360-378. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-74143-5_20.
  11. Yevgeniy Dodis, Willy Quach, and Daniel Wichs. Speak much, remember little: Cryptography in the bounded storage model, revisited. Cryptology ePrint Archive, 2021. URL: https://eprint.iacr.org/2021/1270.
  12. Yevgeniy Dodis, Willy Quach, and Daniel Wichs. Authentication in the bounded storage model. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 737-766. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-07082-2_26.
  13. Javad Doliskani. Efficient quantum public-key encryption from learning with errors. arXiv preprint, 2021. URL: https://arxiv.org/abs/2105.12790.
  14. Shafi Goldwasser and Yael Tauman Kalai. On the impossibility of obfuscation with auxiliary input. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pages 553-562. IEEE, 2005. URL: https://doi.org/10.1109/SFCS.2005.60.
  15. Shafi Goldwasser, Yael Tauman Kalai, and Guy N Rothblum. One-time programs. In Annual International Cryptology Conference, pages 39-56. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-85174-5_3.
  16. Daniel Gottesman. Uncloneable encryption. arXiv preprint, 2002. URL: https://arxiv.org/abs/quant-ph/0210062.
  17. Daniel Gottesman and Isaac Chuang. Quantum digital signatures. arXiv preprint, 2001. URL: https://arxiv.org/abs/quant-ph/0105032.
  18. Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, and Akshay Wadia. Founding cryptography on tamper-proof hardware tokens. In Theory of Cryptography: 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings 7, pages 308-326. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-11799-2_19.
  19. Jiaxin Guan, Daniel Wichs, and Mark Zhandry. Incompressible cryptography. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 700-730. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-06944-4_24.
  20. Jiaxin Guan and Mark Zhandary. Simple schemes in the bounded storage model. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 500-524. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-17659-4_17.
  21. Jiaxin Guan and Mark Zhandry. Disappearing cryptography in the bounded storage model. In Theory of Cryptography Conference, pages 365-396. Springer, 2021. URL: https://doi.org/10.1007/978-3-030-90453-1_13.
  22. Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, and Tomoyuki Yamakami. Computational indistinguishability between quantum states and its cryptographic application. In Eurocrypt, volume 3494, pages 268-284. Springer, 2005. URL: https://doi.org/10.1007/11426639_16.
  23. Joe Kilian. Founding cryptography on oblivious transfer. In Proc. ACM Symposium on Theory of Computing, STOC '88, pages 20-31, New York, NY, USA, 1988. ACM. URL: https://doi.org/10.1145/62212.62215.
  24. Robert König and Renato Renner. Sampling of min-entropy relative to quantum knowledge. IEEE Transactions on Information Theory, 57(7):4760-4787, 2011. URL: https://doi.org/10.1109/TIT.2011.2146730.
  25. Robert König, Renato Renner, and Christian Schaffner. The operational meaning of min-and max-entropy. IEEE Transactions on Information theory, 55(9):4337-4347, 2009. URL: https://doi.org/10.1109/TIT.2009.2025545.
  26. Ueli M Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(1):53-66, 1992. URL: https://doi.org/10.1007/BF00191321.
  27. Michele Mosca, Alain Tapp, and Ronald de Wolf. Private quantum channels and the cost of randomizing quantum information. arXiv preprint, 2000. URL: https://arxiv.org/abs/quant-ph/0003101.
  28. Ran Raz. Fast learning requires good memory: A time-space lower bound for parity learning. Journal of the ACM (JACM), 66(1):1-18, 2018. URL: https://doi.org/10.1145/3186563.
  29. Renato Renner and Robert König. Universally composable privacy amplification against quantum adversaries. In Theory of Cryptography Conference, pages 407-425. Springer, 2005. URL: https://doi.org/10.1007/978-3-540-30576-7_22.
  30. Christian Schaffner. Cryptography in the Bounded-Quantum-Storage Model. PhD thesis, Aarhus Universitet, 2007. URL: https://arxiv.org/abs/0709.0289.
  31. Stephanie Wehner, Christian Schaffner, and Barbara M. Terhal. Cryptography from noisy storage. Phys. Rev. Lett., 100:220502, June 2008. URL: https://doi.org/10.1103/PhysRevLett.100.220502.
  32. Andreas Winter. Coding theorem and strong converse for quantum channels. IEEE Transactions on Information Theory, 45(7):2481-2485, 1999. URL: https://doi.org/10.1109/18.796385.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact