Treffer: Zero-knowledge against quantum attacks

Title:
Zero-knowledge against quantum attacks
Authors:
WATROUS, John
Source:
STOC'06 (Proceedings of the 38th annual ACM symposium on theory of computing). :296-305
Publisher Information:
New York NY: ACM Press, 2006.
Publication Year:
2006
Physical Description:
print, 29 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Analyse statistique, Statistical analysis, Análisis estadístico, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Calcul quantique, Quantum computation, Calculo cuántico, Chaîne caractère, Character string, Cadena carácter, Classe complexité, Complexity class, Clase complejidad, Information quantique, Quantum information, Información cuántica, Isomorphisme, Isomorphism, Isomorfismo, Modèle référence, Reference model, Modelo referencia, Ordinateur quantique, Quantum computer, Protocole engagement, Commitment scheme, Protocolo compromiso, Protocole zéro connaissance, Zero knowledge protocol, Protocolo cero conocimiento, Système conversationnel, Interactive system, Sistema interactivo, Sécurité, Safety, Seguridad, Théorie preuve, Proof theory, Teoría demonstración, Vérification programme, Program verification, Verificación programa
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science University of Calgary, Calgary, Alberta, Canada
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18297921
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18297921
Database:
PASCAL Archive

Weitere Informationen

This paper proves that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the well-known Goldreich-Micali-Wigderson classical zero-knowledge protocols for Graph Isomorphism and Graph 3-Coloring (assuming the existence of quantum computationally concealing commitment schemes in the second case). Also included is a quantum interactive protocol for a complete problem for the complexity class of problems having honest verifier quantum statistical zero-knowledge proofs, which therefore establishes that honest verifier and general quantum statistical zero-knowledge are equal: QSZK = QSZKHV. Previously no non-trivial proof systems were known to be zero-knowledge against quantum attacks, except in restricted settings such as the honest-verifier and common reference string models. This paper therefore establishes for the first time that true zero-knowledge is indeed possible in the presence of quantum information and computation.