A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the 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 proof system for a complete problem for the complexity class of problems having honest verifier quantum statistical zero-knowledgedoi:10.1145/1132516.1132560 dblp:conf/stoc/Watrous06 fatcat:t7zoaapdjbhqfjodg4dsyj56va