On the Computational Hardness Needed for Quantum Cryptography
In the classical model of computation, one-way functions (OWF) are arguably minimal for computational cryptography, namely they are essential for almost any cryptographic application that can only be realized with respect to computationally bounded adversaries. In the quantum setting, however, OWFs appear not to be essential (Kretschmer 2021; Ananth et al., Morimae and Yamakawa 2022); in particular, no minimal primitive is known.
Abstract In the classical model of computation, one-way functions (OWF) are arguably minimal for computational cryptography, namely they are essential for almost any cryptographic application that can only be realized with respect to computationally bounded adversaries. In the quantum setting, however, OWFs appear not to be essential (Kretschmer 2021; Ananth et al., Morimae and Yamakawa 2022); in particular, no minimal primitive is known. We consider EFI pairs — efficiently samplable, statistically far and computationally indistinguishable pairs of quantum states. Building on the work of…
saved by
related reading
- ch26.pdfmath.auckland.ac.nz
- Indistinguishability Obfuscation from Well-Founded Assumptionseprint.iacr.org
- Unclonable Polymers and Their Cryptographic Applicationseprint.iacr.org
- Computer Scientists Achieve ‘Crown Jewel’ of Cryptography | Quanta Magazinequantamagazine.org
- Shtetl-Optimized >> Blog Archive >> Quantum computing bombshells that are not April Foolsscottaaronson.blog
- Discovering cryptographic weaknesses with Claude \ Anthropicanthropic.com
- Signal >> Blog >> Quantum Resistance and the Signal Protocolsignal.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- ZX-based quantum obfuscation for dummies – 20[ ] – The blogblog.20squares.xyz
- lecnotes.pdfcs.cornell.edu
- Cryptographic Right Answers: Post Quantum Edition | Latacoralatacora.com
- The Cryptographer Who Ensures We Can Trust Our Computers | Quanta Magazinequantamagazine.org