Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding
FOCS, pp. 474-483, 2014.
quantum query complexityquantum rewindingquantum attacksrandom oraclesrewindingMore(9+)
Quantum zero-knowledge proofs and quantum proofs of knowledge are inherently difficult to analyze because their security analysis uses rewinding. Certain cases of quantum rewinding are handled by the results by Watrous (SIAM J Comput, 2009) and Unruh (Eurocrypt 2012), yet in general the problem remains elusive. We show that this is not on...More
PPT (Upload PPT)