Making classical honest verifier zero knowledge protocols secure against quantum attacks

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

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 592-603

  Hallgren, Sean ^a   Kolla, Alexandra ^b   Sen, Pranab ^c   Zhang, Shengyu ^d  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^d CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTATIONAL COMPLEXITY; KETONES; LAWS AND LEGISLATION; LINGUISTICS; POLYNOMIAL APPROXIMATION; STATISTICAL METHODS; TRANSLATION (LANGUAGES);

COMPLEXITY CLASS; POLYNOMIAL-TIME VERIFIERS; ZERO-KNOWLEDGE; ZERO-KNOWLEDGE PROTOCOLS;

QUANTUM CRYPTOGRAPHY;

EID: 49049100467     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_48     Document Type: Conference Paper

References (18)

1. +90] Ben-Or, M., Goldreich, O., Goldwasser, S., H° astad, J., Kilian, J., Micali, S., Rogaway, P.: Every provable is provable in zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 37-56. Springer, Heidelberg (1990)
2. [DGW94] Damg° ard, I., Goldreich, O., Wigderson, A.: Hashing functions can simplify zero-knowledge protocol design (too). Technical Report RS-94-39, BRICS (1994)
3. [FFS88] Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. Journal of Cryptology 1(2), 77-94 (1988)
4. [GMW91] Goldreich, O., Micali, S., Widgerson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38(1), 691-729 (1991)
5. [Gol01] Goldreich, O.: Foundations of cryptography, vol. 1. Cambridge University Press, Cambridge (2001)
6. [GS89] Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. Advances in Computing Research, vol. 5, pp. 73-90. JAC Press, Inc. (1989)
7. [GSV98] Goldreich, O., Sahai, A., Vadhan, S.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 399-408 (1998)
8. [GV97] Goldreich, O., Vadhan, S.: Comparing entropies in statistical zero knowledge with applications to the structure of SZK. In: Proceedings of the 14th Annual IEEE Symposium on Foundations of Computer Science, pp. 448-457 (1997)
9. [HILL99] H° astad, J., Impagliazzo, R., Levin, L., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing 28(4), 1364-1396 (1999)
10. [IY88] Impagliazzo, R., Yung, M.: Direct zero-knowledge computations. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 40-51. Springer, Heidelberg (1988)
11. [Kob08] Kobayashi, H.: General properties of quantum zero-knowledge proofs. In: Proceedings of the 5th Theory of Cryptography Conference, pp. 107-124 (2008), Also quant-ph/0705.1129
12. [Nao91] Naor,M.: Bit commitment using pseudorandom generator. Journal of Cryptology 4, 151-158 (1991)
13. [NV06] Nguyen, M.-H., Vadhan, S.: Zero knowledge with efficient provers. In: Proceedings of the 38th Annual ACMSymposium on Theory of Computing, pp. 287-295 (2006)
14. [OV08] Ong, S., Vadhan, S.: An equivalence between zero knowledge and commitments. In: Proceedings of the 5th Theory of Cryptography Conference (to appear, 2008)
15. [SV03] Sahai, A., Vadhan, S.: A complete promise problem for statistical zero-knowledge. Journal of the ACM 50(2), 196-249 (2003)
16. [Vad06] Vadhan, S.: An unconditional study of computational zero knowledge. SIAM Journal on Computing 36(4), 1160-1214 (2006)
17. [Wat02] Watrous, J.: Limits on the power of quantum statistical zero-knowledge. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 459-468 (2002)
18. [Wat06] Watrous, J.: Zero-knowledge against quantum attacks. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 296-305 (2006)