Exponential separations for one-way quantum communication complexity, with applications to cryptography
Authors:
- Dmitry GavinskyDGDmitry Gavinsky
- Julia KempeJKJulia Kempe
- Iordanis KerenidisIKIordanis Kerenidis
- Ran RazRRRan Raz
- Ronald de WolfRWRonald de Wolf
Preprint
Abstract
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden Matching Problem of Bar-Yossef et al. Earlier such an exponential separation was known only for a relational version of the Hidden Matching Problem. Our proofs use the Fourier coefficients inequality of Kahn, Kalai, and Linial. We also give a number of applications of this separation. In particular, we provide the first example in the bounded storage model of cryptography where the key is secure if the adversary has a certain amount of classical storage, but is completely insecure if he has a similar (or even much smaller) amount of \emph{quantum} storage. Moreover, in the setting of privacy amplification, we show that there exist extractors which yield a classically secure key, but are insecure against a quantum adversary.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- The Bounded-Storage Model in the Presence of a Quantum AdversaryIEEE Transactions on Information Theory, 2008
- Optimal Randomizer Efficiency in the Bounded-Storage ModelJournal of Cryptology, 2003
- Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage ModelJournal of Cryptology, 2003
- Encryption against Storage-Bounded Adversaries from On-Line Strong ExtractorsJournal of Cryptology, 2003
- Everlasting security in the bounded storage modelIEEE Transactions on Information Theory, 2002
- The Space Complexity of Approximating the Frequency MomentsJournal of Computer and System Sciences, 1999
- Fourier analysis for probabilistic communication complexitycomputational complexity, 1995
- Conditionally-perfect secrecy and a provably-secure randomized cipherJournal of Cryptology, 1992
- Private vs. common random bits in communication complexityInformation Processing Letters, 1991
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988