13 citations · 46 across the 17 of their papers we have counts for
Showing 2014 · quant-phShow all
2 papers · 2 filters
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★ 3 cited
Adversary Lower Bound for Element Distinctness with Small Range
Ansis Rosmanis
The Element Distinctness problem is to decide whether each character of an input string is unique. The quantum query complexity of Element Distinctness is known to be ;…