134 citations · 254 across the 10 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
quant-ph2014★ 4 cited
Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding
Andris Ambainis, Ansis Rosmanis, Dominique Unruh
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…
quant-ph2014★ 7 cited
An adaptive attack on Wiesner's quantum money
Aharon Brodutch, Daniel Nagaj, Or Sattath +1
Unlike classical money, which is hard to forge for practical reasons (e.g. producing paper with a certain property), quantum money is attractive because its security might be based…