17 citations · 34 across the 2 of their papers we have counts for
2 papers
quant-ph2011★ 17 cited
Component mixers and a hardness result for counterfeiting quantum money
Andrew Lutomirski
In this paper we give the first proof that, under reasonable assumptions, a problem related to counterfeiting quantum money from knots [Farhi et al. 2010] is hard. Along the way, w…
quant-ph2010★ 17 cited
An online attack against Wiesner's quantum money
Andrew Lutomirski
Wiesner's quantum money [5] is a simple, information-theoretically secure quantum cryptographic protocol. In his protocol, a mint issues quantum bills and anyone can query the mint…