Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quantum Unpredictability (2405.04072v1)

Published 7 May 2024 in quant-ph and cs.CR

Abstract: Unpredictable functions (UPFs) play essential roles in classical cryptography, including message authentication codes (MACs) and digital signatures. In this paper, we introduce a quantum analog of UPFs, which we call unpredictable state generators (UPSGs). UPSGs are implied by pseudorandom function-like states generators (PRFSs), which are a quantum analog of pseudorandom functions (PRFs), and therefore UPSGs could exist even if one-way functions do not exist, similar to other recently introduced primitives like pseudorandom state generators (PRSGs), one-way state generators (OWSGs), and EFIs. In classical cryptography, UPFs are equivalent to PRFs, but in the quantum case, the equivalence is not clear, and UPSGs could be weaker than PRFSs. Despite this, we demonstrate that all known applications of PRFSs are also achievable with UPSGs. They include IND-CPA-secure secret-key encryption and EUF-CMA-secure MACs with unclonable tags. Our findings suggest that, for many applications, quantum unpredictability, rather than quantum pseudorandomness, is sufficient.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (33)
  1. On the hardness of detecting macroscopic superpositions. Electron. Colloquium Comput. Complex., page 146, 2020.
  2. Computational security of quantum encryption. In Information Theoretic Security: 9th International Conference, ICITS 2016, Tacoma, WA, USA, August 9-12, 2016, Revised Selected Papers 9, pages 47–71. Springer, 2016.
  3. Quantum money from hidden subspaces. In Howard J. Karloff and Toniann Pitassi, editors, 44th ACM STOC, pages 41–60. ACM Press, May 2012.
  4. Pseudorandom isometries. arXiv preprint arXiv:2311.02901, 2023.
  5. Pseudorandom (function-like) quantum state generators: New definitions and applications. In Eike Kiltz and Vinod Vaikuntanathan, editors, TCC 2022, Part I, volume 13747 of LNCS, pages 237–265. Springer, Heidelberg, November 2022.
  6. Pseudorandom strings from pseudorandom quantum states. Cryptology ePrint Archive, Paper 2023/904, 2023. https://eprint.iacr.org/2023/904.
  7. Cryptography from pseudorandom quantum states. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO 2022, Part I, volume 13507 of LNCS, pages 208–236. Springer, Heidelberg, August 2022.
  8. Pseudorandomness with proof of destruction and applications. Cryptology ePrint Archive, Paper 2023/543, 2023. https://eprint.iacr.org/2023/543.
  9. On the computational hardness needed for quantum cryptography. ITCS 2023: 14th Innovations in Theoretical Computer Science, 2023.
  10. Quantum homomorphic encryption for circuits of low t-gate complexity. In Annual Cryptology Conference, pages 609–629. Springer, 2015.
  11. Secure signatures and chosen ciphertext security in a quantum computing world. In Ran Canetti and Juan A. Garay, editors, CRYPTO 2013, Part II, volume 8043 of LNCS, pages 361–379. Springer, Heidelberg, August 2013.
  12. On the computational hardness of quantum one-wayness. arXiv preprint arXiv:2312.08363, 2023.
  13. On black-box separations of quantum digital signatures from pseudorandom states. arXiv preprint arXiv:2402.08194, 2024.
  14. How to construct random functions. Journal of the ACM, 33(4):792–807, 1986.
  15. A hard-core predicate for all one-way functions. In 21st ACM STOC, pages 25–32. ACM Press, May 1989.
  16. Oded Goldreich. A note on computational indistinguishability. Information Processing Letters 34.6 (1990), pp.277–281., 1990.
  17. From the hardness of detecting superpositions to cryptography: Quantum public key encryption and commitments. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part I, volume 14004 of LNCS, pages 639–667. Springer, Heidelberg, April 2023.
  18. Pseudorandom quantum states. In Hovav Shacham and Alexandra Boldyreva, editors, CRYPTO 2018, Part III, volume 10993 of LNCS, pages 126–152. Springer, Heidelberg, August 2018.
  19. Introduction to Modern Cryptography. Chapman and Hall/CRC Press, 2007.
  20. Quantum public-key encryption with tamper-resilient public keys from one-way functions. arXiv preprint arXiv:2304.01800, 2023.
  21. Quantum cryptography in algorithmica. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 1589–1602, 2023.
  22. W. Kretschmer. Quantum pseudorandomness and classical complexity. TQC 2021, 2021.
  23. Commitments from quantum one-wayness. Cryptology ePrint Archive, Paper 2023/1620, 2023. https://eprint.iacr.org/2023/1620.
  24. Quantum pseudorandom scramblers. arXiv preprint arXiv:2309.08941, 2023.
  25. Urmila Mahadev. Classical homomorphic encryption for quantum circuits. SIAM Journal on Computing, 52(6):FOCS18–189–FOCS18–215, 2023.
  26. Simple constructions of linear-depth t-designs and pseudorandom unitaries. arXiv preprint arXiv:2404.12647, 2024.
  27. Optimal counterfeiting attacks and generalizations for wiesner’s quantum money. In Conference on Quantum Computation, Communication, and Cryptography, pages 45–64. Springer, 2012.
  28. One-wayness in quantum cryptography. Cryptology ePrint Archive, Paper 2022/1336, 2022. https://eprint.iacr.org/2022/1336.
  29. Quantum commitments and signatures without one-way functions. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO 2022, Part I, volume 13507 of LNCS, pages 269–295. Springer, Heidelberg, August 2022.
  30. From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs (extended abstract). In Hugo Krawczyk, editor, CRYPTO’98, volume 1462 of LNCS, pages 267–282. Springer, Heidelberg, August 1998.
  31. John Watrous. The theory of quantum information. Cambridge university press, 2018.
  32. Stephen Wiesner. Conjugate coding. SIGACT News, 15(1):78–88, 1983.
  33. Jun Yan. General properties of quantum bit commitments (extended abstract). In Shweta Agrawal and Dongdai Lin, editors, ASIACRYPT 2022, Part IV, volume 13794 of LNCS, pages 628–657. Springer, Heidelberg, December 2022.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now