198 search results - page 4 / 40 » The Multiplicative Quantum Adversary |
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that ...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
SIAMCOMP
2008
13 years 6 months ago
2008
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivio...
WDAG
2010
Springer
13 years 5 months ago
2010
Springer
We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...