Concurrent statistical zero-knowledge arguments for NP from one way functions

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

Volumn 4833 LNCS, Issue , 2007, Pages 444-459

  Goyal, Vipul ^a   Moriarty, Ryan ^a   Ostrovsky, Rafail ^a   Sahai, Amit ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; FUNCTION EVALUATION; MATHEMATICAL TRANSFORMATIONS; STATISTICAL METHODS;

NON-TRIVIAL LANGUAGE; ZERO-KNOWLEDGE ARGUMENTS;

KNOWLEDGE ACQUISITION;

EID: 38149062007     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76900-2_27     Document Type: Conference Paper

References (24)

1. Brassard, G., Chaum, D., Crépeau, C.: Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci. 37(2), 156-189 (1988)
2. Boppana, R.B., Hâstad, J., Zachos, S.: Does co-np have short interactive proofs? Inf. Process. Lett. 25(2), 127-132 (1987)
3. Boyar, J., Kurtz, S.A., Krentel, M.W.: A discrete logarithm implementation of perfect zero-knowledge blobs. J. Cryptology 2(2), 63-76 (1990)
4. Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: STOC, pp. 409-418 (1998)
5. Feige, U.: Ph.d. thesis, alternative models for zero knowledge interactive proofs. Weizmann Institute of Science (1990)
6. Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for np. J. Cryptology 9(3), 167-190 (1996)
7. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186-208 (1989)
8. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems. J. ACM 38(3), 691-729 (1991)
9. Goldreich, O.: Foundations of Cryptography - Basic Tools. Cambridge University Press, Cambridge (2001)
10. Haitner, I., Horvitz, O., Katz, J., Koo, C.-Y., Morselli, R., Shaltiel, R.: Reducing complexity assumptions for statistically-hiding commitment. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 58-77. Springer, Heidelberg (2005)
11. Håstad, J., Impagliazzo, R., Levin, L.A, Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364-1396 (1999)
12. Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. In: Johnson, D.S., Feige, U. (eds.) STOC, pp. 1-10. ACM, New York (2007)
13. Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. In: STOC, pp. 560-569 (2001)
14. Micciancio, D., Ong, S.J, Sahai, A., Vadhan, S.P.: Concurrent zero knowledge without complexity assumptions. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 1-20. Springer, Heidelberg (2006)
15. Micciancio, D., Petrank, E.: Simulatable commitments and efficient concurrent zero-knowledge. In: Biham, E. (ed.) Advances in Cryptology - EUROCRPYT 2003. LNCS, vol. 2656, pp. 140-159. Springer, Heidelberg (2003)
16. Naor, M.: Bit commitment using pseudorandomness. J. Cryptology 4(2), 151-158 (1991)
17. Nguyen, M.-H, Ong, S.J, Vadhan, S.P.: Statistical zero-knowledge arguments for np from any one-way function. In: FOCS, pp. 3-14. IEEE Computer Society, Los Alamitos (2006)
18. Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for p using any one-way permutation. J. Cryptology 11(2), 87-108 (1998)
19. Nguyen, M.-H., Vadhan, S.P.: Zero knowledge with efficient provers. In: Proceedings of the 38th Annual ACM symposium on Theory of Comput ing, ACM Press, New York (2006)
20. Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: STOC, pp. 33-43 (1989)
21. Ostrovsky, R.: One-way functions, hard on average problems, and statistical zero-knowledge proofs. In: Structure in Complexity Theory Conference, pp. 133-138 (1991)
22. Ostrovsky, R., Wigderson, A.: One-way fuctions are essential for non-trivial zero-knowledge. In: ISTCS, pp. 3-17 (1993)
23. Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS, pp. 366-375 (2002)
24. Richardson, R., Kilian, J.: On the concurrent composition of zero-knowledge proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 415-431. Springer, Heidelberg (1999)