Exponential separations for one-way quantum communication complexity, with applications to cryptography

Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald De Wolf

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We give an exponential separation between one-way quantum and classical communication protocols for twopartial 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 give a number of applications of this separation. In particular, in the bounded-storage model of cryptography we exhibita scheme that is secure against adversaries with a certain amount of classical storage, but insecure against adversaries with a similar (or even much smaller) amount of quantum storage; in the setting of privacy amplification, we show that there are strong extractors that yield a classically secure key, but are insecure against a quantum adversary.

Original languageEnglish (US)
Title of host publicationSTOC'07
Subtitle of host publicationProceedings of the 39th Annual ACM Symposium on Theory of Computing
Pages516-525
Number of pages10
DOIs
StatePublished - Oct 30 2007
EventSTOC'07: 39th Annual ACM Symposium on Theory of Computing - San Diego, CA, United States
Duration: Jun 11 2007Jun 13 2007

Other

OtherSTOC'07: 39th Annual ACM Symposium on Theory of Computing
CountryUnited States
CitySan Diego, CA
Period6/11/076/13/07

Fingerprint

Quantum communication
Cryptography
Boolean functions
Amplification
Network protocols

Keywords

  • Communication complexity
  • Cryptography
  • Quantum

ASJC Scopus subject areas

  • Software

Cite this

Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., & De Wolf, R. (2007). Exponential separations for one-way quantum communication complexity, with applications to cryptography. In STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (pp. 516-525) https://doi.org/10.1145/1250790.1250866

Exponential separations for one-way quantum communication complexity, with applications to cryptography. / Gavinsky, Dmitry; Kempe, Julia; Kerenidis, Iordanis; Raz, Ran; De Wolf, Ronald.

STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. 2007. p. 516-525.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gavinsky, D, Kempe, J, Kerenidis, I, Raz, R & De Wolf, R 2007, Exponential separations for one-way quantum communication complexity, with applications to cryptography. in STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. pp. 516-525, STOC'07: 39th Annual ACM Symposium on Theory of Computing, San Diego, CA, United States, 6/11/07. https://doi.org/10.1145/1250790.1250866
Gavinsky D, Kempe J, Kerenidis I, Raz R, De Wolf R. Exponential separations for one-way quantum communication complexity, with applications to cryptography. In STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. 2007. p. 516-525 https://doi.org/10.1145/1250790.1250866
Gavinsky, Dmitry ; Kempe, Julia ; Kerenidis, Iordanis ; Raz, Ran ; De Wolf, Ronald. / Exponential separations for one-way quantum communication complexity, with applications to cryptography. STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. 2007. pp. 516-525
@inproceedings{a824470a13cf41aaac8e136729852296,
title = "Exponential separations for one-way quantum communication complexity, with applications to cryptography",
abstract = "We give an exponential separation between one-way quantum and classical communication protocols for twopartial 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 give a number of applications of this separation. In particular, in the bounded-storage model of cryptography we exhibita scheme that is secure against adversaries with a certain amount of classical storage, but insecure against adversaries with a similar (or even much smaller) amount of quantum storage; in the setting of privacy amplification, we show that there are strong extractors that yield a classically secure key, but are insecure against a quantum adversary.",
keywords = "Communication complexity, Cryptography, Quantum",
author = "Dmitry Gavinsky and Julia Kempe and Iordanis Kerenidis and Ran Raz and {De Wolf}, Ronald",
year = "2007",
month = "10",
day = "30",
doi = "10.1145/1250790.1250866",
language = "English (US)",
isbn = "1595936319",
pages = "516--525",
booktitle = "STOC'07",

}

TY - GEN

T1 - Exponential separations for one-way quantum communication complexity, with applications to cryptography

AU - Gavinsky, Dmitry

AU - Kempe, Julia

AU - Kerenidis, Iordanis

AU - Raz, Ran

AU - De Wolf, Ronald

PY - 2007/10/30

Y1 - 2007/10/30

N2 - We give an exponential separation between one-way quantum and classical communication protocols for twopartial 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 give a number of applications of this separation. In particular, in the bounded-storage model of cryptography we exhibita scheme that is secure against adversaries with a certain amount of classical storage, but insecure against adversaries with a similar (or even much smaller) amount of quantum storage; in the setting of privacy amplification, we show that there are strong extractors that yield a classically secure key, but are insecure against a quantum adversary.

AB - We give an exponential separation between one-way quantum and classical communication protocols for twopartial 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 give a number of applications of this separation. In particular, in the bounded-storage model of cryptography we exhibita scheme that is secure against adversaries with a certain amount of classical storage, but insecure against adversaries with a similar (or even much smaller) amount of quantum storage; in the setting of privacy amplification, we show that there are strong extractors that yield a classically secure key, but are insecure against a quantum adversary.

KW - Communication complexity

KW - Cryptography

KW - Quantum

UR - http://www.scopus.com/inward/record.url?scp=35448991662&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35448991662&partnerID=8YFLogxK

U2 - 10.1145/1250790.1250866

DO - 10.1145/1250790.1250866

M3 - Conference contribution

AN - SCOPUS:35448991662

SN - 1595936319

SN - 9781595936318

SP - 516

EP - 525

BT - STOC'07

ER -