Ran Canetti

On the Computational Hardness Needed for Quantum Cryptography

2022 · arXiv (Cornell University)

In the classical model of computation, it is well established that one-way functions (OWF) are minimal for computational cryptography: They are essential for almost any cryptographic application that cannot be realized with respect to computationally …