Sciweavers

198 search results - page 2 / 40
» The Multiplicative Quantum Adversary
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 5 months ago
Short seed extractors against quantum storage
Some, but not all, extractors resist adversaries with limited quantum storage. In this paper we show that Trevisan's extractor has this property, thereby showing an extractor...
Amnon Ta-Shma
CORR
2010
Springer
87views Education» more  CORR 2010»
13 years 3 months ago
Quantum money from knots
Quantum money is a cryptographic protocol in which a mint can produce a quantum state, no one else can copy the state, and anyone (with a quantum computer) can verify that the sta...
Edward Farhi, David Gosset, Avinatan Hassidim, And...
JUCS
2006
137views more  JUCS 2006»
13 years 5 months ago
Progress in Quantum Computational Cryptography
: Shor's algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on publickey cryptography. ...
Akinori Kawachi, Takeshi Koshiba
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 5 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
14 years 2 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick