198 search results - page 8 / 40 » The Multiplicative Quantum Adversary |
177
click to vote
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w ...
155
click to vote
FOCS
2009
IEEE
16 years 3 days ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
164
Voted
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
148
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damg...
144
Voted
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— According to the cognitive radio paradigm, a terminal or subsystem will opportunistically select a frequency band for data transmission. Because the spectrum is shared,...