Luowen Qian

Beating Classical Impossibility of Position Verification

2021 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

Chandran et al. (SIAM J. Comput.'14) formally introduced the cryptographic task of position verification, where they also showed that it cannot be achieved by classical protocols. In this work, we initiate the study of position …

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 …