Making classical honest verifier zero knowledge protocols secure against quantum attacks

Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang

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

10 Citations (Scopus)

Abstract

We show that any problem that has a classical zero-knowledge protocol against the honest verifier also has, under a reasonable condition, a classical zero-knowledge protocol which is secure against all classical and quantum polynomial time verifiers, even cheating ones. Here we refer to the generalized notion of zero-knowledge with classical and quantum auxiliary inputs respectively. Our condition on the original protocol is that, for positive instances of the problem, the simulated message transcript should be quantum computationally indistinguishable from the actual message transcript. This is a natural strengthening of the notion of honest verifier computational zero-knowledge, and includes in particular, the complexity class of honest verifier statistical zero-knowledge. Our result answers an open question of Watrous [Wat06], and generalizes classical results by Goldreich, Sahai and Vadhan [GSV98], and Vadhan [Vad06] who showed that honest verifier statistical, respectively computational, zero knowledge is equal to general statistical, respectively computational, zero knowledge.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings
Pages592-603
Number of pages12
EditionPART 2
DOIs
StatePublished - Aug 14 2008
Event35th International Colloquium on Automata, Languages and Programming, ICALP 2008 - Reykjavik, Iceland
Duration: Jul 7 2008Jul 11 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume5126 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other35th International Colloquium on Automata, Languages and Programming, ICALP 2008
CountryIceland
CityReykjavik
Period7/7/087/11/08

Fingerprint

Zero-knowledge
Attack
Polynomials
Complexity Classes
Strengthening
Polynomial time
Generalise

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Hallgren, S., Kolla, A., Sen, P., & Zhang, S. (2008). Making classical honest verifier zero knowledge protocols secure against quantum attacks. In Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings (PART 2 ed., pp. 592-603). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5126 LNCS, No. PART 2). https://doi.org/10.1007/978-3-540-70583-3_48
Hallgren, Sean ; Kolla, Alexandra ; Sen, Pranab ; Zhang, Shengyu. / Making classical honest verifier zero knowledge protocols secure against quantum attacks. Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 2. ed. 2008. pp. 592-603 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{2d630ba5a958429583e82af9c282f065,
title = "Making classical honest verifier zero knowledge protocols secure against quantum attacks",
abstract = "We show that any problem that has a classical zero-knowledge protocol against the honest verifier also has, under a reasonable condition, a classical zero-knowledge protocol which is secure against all classical and quantum polynomial time verifiers, even cheating ones. Here we refer to the generalized notion of zero-knowledge with classical and quantum auxiliary inputs respectively. Our condition on the original protocol is that, for positive instances of the problem, the simulated message transcript should be quantum computationally indistinguishable from the actual message transcript. This is a natural strengthening of the notion of honest verifier computational zero-knowledge, and includes in particular, the complexity class of honest verifier statistical zero-knowledge. Our result answers an open question of Watrous [Wat06], and generalizes classical results by Goldreich, Sahai and Vadhan [GSV98], and Vadhan [Vad06] who showed that honest verifier statistical, respectively computational, zero knowledge is equal to general statistical, respectively computational, zero knowledge.",
author = "Sean Hallgren and Alexandra Kolla and Pranab Sen and Shengyu Zhang",
year = "2008",
month = "8",
day = "14",
doi = "10.1007/978-3-540-70583-3_48",
language = "English (US)",
isbn = "3540705821",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "592--603",
booktitle = "Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings",
edition = "PART 2",

}

Hallgren, S, Kolla, A, Sen, P & Zhang, S 2008, Making classical honest verifier zero knowledge protocols secure against quantum attacks. in Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 5126 LNCS, pp. 592-603, 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, Reykjavik, Iceland, 7/7/08. https://doi.org/10.1007/978-3-540-70583-3_48

Making classical honest verifier zero knowledge protocols secure against quantum attacks. / Hallgren, Sean; Kolla, Alexandra; Sen, Pranab; Zhang, Shengyu.

Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 2. ed. 2008. p. 592-603 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5126 LNCS, No. PART 2).

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

TY - GEN

T1 - Making classical honest verifier zero knowledge protocols secure against quantum attacks

AU - Hallgren, Sean

AU - Kolla, Alexandra

AU - Sen, Pranab

AU - Zhang, Shengyu

PY - 2008/8/14

Y1 - 2008/8/14

N2 - We show that any problem that has a classical zero-knowledge protocol against the honest verifier also has, under a reasonable condition, a classical zero-knowledge protocol which is secure against all classical and quantum polynomial time verifiers, even cheating ones. Here we refer to the generalized notion of zero-knowledge with classical and quantum auxiliary inputs respectively. Our condition on the original protocol is that, for positive instances of the problem, the simulated message transcript should be quantum computationally indistinguishable from the actual message transcript. This is a natural strengthening of the notion of honest verifier computational zero-knowledge, and includes in particular, the complexity class of honest verifier statistical zero-knowledge. Our result answers an open question of Watrous [Wat06], and generalizes classical results by Goldreich, Sahai and Vadhan [GSV98], and Vadhan [Vad06] who showed that honest verifier statistical, respectively computational, zero knowledge is equal to general statistical, respectively computational, zero knowledge.

AB - We show that any problem that has a classical zero-knowledge protocol against the honest verifier also has, under a reasonable condition, a classical zero-knowledge protocol which is secure against all classical and quantum polynomial time verifiers, even cheating ones. Here we refer to the generalized notion of zero-knowledge with classical and quantum auxiliary inputs respectively. Our condition on the original protocol is that, for positive instances of the problem, the simulated message transcript should be quantum computationally indistinguishable from the actual message transcript. This is a natural strengthening of the notion of honest verifier computational zero-knowledge, and includes in particular, the complexity class of honest verifier statistical zero-knowledge. Our result answers an open question of Watrous [Wat06], and generalizes classical results by Goldreich, Sahai and Vadhan [GSV98], and Vadhan [Vad06] who showed that honest verifier statistical, respectively computational, zero knowledge is equal to general statistical, respectively computational, zero knowledge.

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

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

U2 - 10.1007/978-3-540-70583-3_48

DO - 10.1007/978-3-540-70583-3_48

M3 - Conference contribution

AN - SCOPUS:49049100467

SN - 3540705821

SN - 9783540705826

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 592

EP - 603

BT - Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings

ER -

Hallgren S, Kolla A, Sen P, Zhang S. Making classical honest verifier zero knowledge protocols secure against quantum attacks. In Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 2 ed. 2008. p. 592-603. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-540-70583-3_48