Showing quant-phShow all
3 papers · 1 filter
quant-ph2025
On the Cryptographic Foundations of Interactive Quantum Advantage
Kabir Tomer, Mark Zhandry
In this work, we study the hardness required to achieve proofs of quantumness (PoQ), which in turn capture (potentially interactive) quantum advantage. A ``trivial'' PoQ is to simp…
quant-ph2025
On the Cryptographic Futility of Non-Collapsing Measurements
Alper Cakan, Dakshita Khurana, Tomoyuki Morimae +3
We investigate quantum analogues of collision resistance and obtain separations between quantum ``one-way'' and ``collision-resistant'' primitives. 1. Our first result studies one-…
quant-ph2024
Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from -Hardness
Dakshita Khurana, Kabir Tomer
Recent oracle separations [Kretschmer, TQC'21, Kretschmer et. al., STOC'23] have raised the tantalizing possibility of building quantum cryptography from sources of hardness that p…