On Central Primitives for Quantum Cryptography with Classical Communication
Abstract: Recent work has introduced the "Quantum-Computation Classical-Communication" (QCCC) (Chung et. al.) setting for cryptography. There has been some evidence that One Way Puzzles (OWPuzz) are the natural central cryptographic primitive for this setting (Khurana and Tomer). For a primitive to be considered central it should have several characteristics. It should be well behaved (which for this paper we will think of as having amplification, combiners, and universal constructions); it should be implied by a wide variety of other primitives; and it should be equivalent to some class of useful primitives. We present combiners, correctness and security amplification, and a universal construction for OWPuzz. Our proof of security amplification uses a new and cleaner version construction of EFI from OWPuzz (in comparison to the result of Khurana and Tomer) that generalizes to weak OWPuzz and is the most technically involved section of the paper. It was previously known that OWPuzz are implied by other primitives of interest including commitments, symmetric key encryption, one way state generators (OWSG), and therefore pseudorandom states (PRS). However we are able to rule out OWPuzz's equivalence to many of these primitives by showing a black box separation between general OWPuzz and a restricted class of OWPuzz (those with efficient verification, which we call EV-OWPuzz). We then show that EV-OWPuzz are also implied by most of these primitives, which separates them from OWPuzz as well. This separation also separates extending PRS from highly compressing PRS answering an open question of Ananth et. al.
- A quantum goldreich-levin theorem with cryptographic applications, 2001.
- On the impossibility of key agreements from quantum random oracles. In Yevgeniy Dodis and Thomas Shrimpton, editors, Advances in Cryptology – CRYPTO 2022, pages 165–194, Cham, 2022. Springer Nature Switzerland.
- Pseudorandom strings from pseudorandom quantum states. arXiv preprint arXiv:2306.05613, 2023.
- Pseudorandom strings from pseudorandom quantum states. Cryptology ePrint Archive, Paper 2023/904, 2023. https://eprint.iacr.org/2023/904.
- Cryptography from pseudorandom quantum states. In Yevgeniy Dodis and Thomas Shrimpton, editors, Advances in Cryptology – CRYPTO 2022, pages 208–236, Cham, 2022. Springer Nature Switzerland.
- On the computational hardness needed for quantum cryptography. Cryptology ePrint Archive, Paper 2022/1181, 2022. https://eprint.iacr.org/2022/1181.
- An efficient quantum parallel repetition theorem and applications, 2023.
- Computational notions of quantum min-entropy, 2017.
- On the computational hardness of quantum one-wayness. arXiv preprint arXiv:2312.08363, 2023.
- Black-box separations for non-interactive classical commitments in a quantum world. In Carmit Hazay and Martijn Stam, editors, Advances in Cryptology – EUROCRYPT 2023, pages 144–172, Cham, 2023. Springer Nature Switzerland.
- How to construct random functions. J. ACM, 33(4):792–807, aug 1986.
- O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC ’89, page 25–32, New York, NY, USA, 1989. Association for Computing Machinery.
- A digital signature scheme secure against adaptive chosen message attack**this research was supported by nsf grant mcs-80-06938, an ibm/mit faculty development award, and darpa contract n00014-85-k-0125.: Extended abstract. In David S. Johnson, Takao Nishizeki, Akihiro Nozaki, and Herbert S. Wilf, editors, Discrete Algorithms and Complexity, pages 287–310. Academic Press, 1987.
- Oded Goldreich. A note on computational indistinguishability. Information Processing Letters, 34(6):277–281, 1990.
- A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364–1396, 1999.
- On robust combiners for oblivious transfer and other primitives. In Ronald Cramer, editor, Advances in Cryptology – EUROCRYPT 2005, pages 96–113, Berlin, Heidelberg, 2005. Springer Berlin Heidelberg.
- Robust combiners and universal constructions for quantum cryptography. Cryptology ePrint Archive, Paper 2023/1772, 2023. https://eprint.iacr.org/2023/1772.
- From the hardness of detecting superpositions to cryptography: Quantum public key encryption and commitments, 2023.
- Efficiency improvements in constructing pseudorandom generators from one-way functions. In Proceedings of the Forty-Second ACM Symposium on Theory of Computing, STOC ’10, page 437–446, New York, NY, USA, 2010. Association for Computing Machinery.
- R. Impagliazzo and M. Luby. One-way functions are essential for complexity based cryptography. In 30th Annual Symposium on Foundations of Computer Science, pages 230–235, 1989.
- R. Impagliazzo. A personal view of average-case complexity. In Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference, pages 134–147, 1995.
- Publicly verifiable deletion from minimal assumptions. Cryptology ePrint Archive, Paper 2023/538, 2023. https://eprint.iacr.org/2023/538.
- William Kretschmer. Quantum pseudorandomness and classical complexity. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
- Commitments from quantum one-wayness, 2024.
- Leslie Lamport. Constructing digital signatures from a one way function. Technical Report CSL-98, October 1979. This paper was published by IEEE in the Proceedings of HICSS-43 in January, 2010.
- Leonid A. Levin. One way functions and pseudorandom generators. Combinatorica, 7(4):357–363, Dec 1987.
- Counting unpredictable bits: A simple prg from one-way functions. Cryptology ePrint Archive, Paper 2023/1451, 2023. https://eprint.iacr.org/2023/1451.
- Quantum commitments and signatures without one-way functions. In Annual International Cryptology Conference, pages 269–295. Springer, 2022.
- Moni Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151–158, Jan 1991.
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC ‘12), pages 817–836. ACM, ACM, 2012.
- Andrew C. Yao. Theory and application of trapdoor functions. In 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pages 80–91, 1982.
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.