Concurrent zero knowledge without complexity assumptions

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

Volumn 3876 LNCS, Issue , 2006, Pages 1-20

  Micciancio, Daniele ^a   Ong, Shien Jin ^b   Sahai, Amit ^c   Vadhan, Salil ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HARVARD UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; KNOWLEDGE ACQUISITION; POLYNOMIAL APPROXIMATION; PROBABILISTIC LOGICS; PROBLEM SOLVING;

COMPLEXITY ASSUMPTIONS; NON-TRIVIAL PROBLEMS; QUADRATIC RESIDUOSITY; ZERO-KNOWLEDGE PROOFS;

COMPUTATIONAL COMPLEXITY;

EID: 33745515138     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11681878_1     Document Type: Conference Paper

References (44)

1. Micciancio, D., Ong, S.J., Sahai, A., Vadhan, S.: Concurrent zero knowledge without complexity assumptions. Technical Report 05-093, Electronic Colloquium on Computational Complexity (2005) http://eccc.uni-trier.de/eccc- reports/2005/TR05-093/.
2. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18(1) (1989) 186-208
3. Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM Journal on Computing 25(1) (1996) 169-192
4. Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: Proc. 30th STOC. (1998) 409-418
5. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38(1) (1991) 691-729
6. Goldreich, O.: Foundations of cryptography. Volume 1. Cambridge University Press, Cambridge, UK (2001)
7. Goldreich, O.: Zero-knowledge twenty years after its invention, http://www.wisdom.weizmann.ac.il/~oded/zk-tut02.html (2002)
8. Yao, A.C.: How to generate and exchange secrets. In: Proc. 27th FOGS. (1986) 162-167
9. Naor, M., Yung, M.; Public-key cryptosystems provably secure against chosen ciphertext attack, In: Proc. 22nd STOC. (1990) 427-437
10. Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM Journal on Computing 30(2) (2001) 391-437
11. Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosenciphertext security, In: Proc. 40th FOGS. (1999) 543-553
12. Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. Journal of Cryptology 1(2) (1988) 77-94
13. Gramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Proc, CRYPTO '98. (1998) 13-25
14. Blkind, E., Sahai, A.: A unified methodology for constructing public-key encryption schemes secure against adaptive chosen-ciphertext attack. Cryptology ePrint Archive, Report 2002/042 (2002) http://eprint.iacr.org/.
15. Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing 33(1) (2004) 167-226
16. Gennaro, R., Micciancio, D., Rabin, T.: An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In: Proc. of the 5th ACM Conference on Computer and Communications Security. (1998) 67-72
17. Okamoto, T.: On relationships between statistical zero-knowledge proofs. Journal of Computer and System Sciences 60(1) (2000) 47-108
18. Goldreich, O., Sahai, A., Vadhan, S.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge, In: Proc. 30th STOC. (1998) 399-408
19. Vadhan, S.: An unconditional study of computational zero knowledge. In: Proc. 45th STOC. (2004) 176-185
20. Ostrovsky, R.: One-way functions, hard on average problems, and statistical zero-knowledge proofs. In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference. (1991)
21. Ostrovsky, R., Wigderson, A.: One-way functions are essential for non-trivial zero-knowledge. In: Second Israel Symposium on Theory of Computing Systems. (1993) 3-17
22. Feige, U.: Alternative models for zero knowledge interactive proofs. PhD thesis, Weizmann Institute of Science, Israel (1990)
23. Richardson, R., Kilian, J.: On the concurrent composition of zero-knowledge proofs. In: Proc. EUROCRYPT '99. (1999) 415-431
24. Kilian, J., Petrank, E., Rackoff, C.: Lower bounds for zero knowledge on the Internet. In: Proc. 39th FOGS. (1998) 484-492
25. Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-logarithm rounds. In: Proc. 33rd STOC. (2001) 560-569
26. Rosen, A.: A note on the round-complexity of concurrent zero-knowledge. In: Proc. CRYPTO '00. (2000) 451-468
27. Canetti, R., Kilian, J., Petrank, E., Rosen, R.: Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds. SIAM Journal on Computing 32(1) (2003) 1-47
28. Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: Proc. 43rd FOGS. (2002) 366-375
29. Barak, B.: How to go beyond the black-box simulation barrier. In: Proc. 42nd FOGS. (2001) 106-115
30. Di Crescenzo, G.: Removing complexity assumptions from concurrent zero-knowledge proofs. In: Proc. 6th COCOON. (2000) 426-435
31. Micciancio, D., Petrank, E.: Simulatable commitments and efficient concurrent zero-knowledge. In: Proc. EUROCRYPT '03. (2003) 140-159
32. Brassard, G., Chaum, D., Crepeau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences 37(2) (1988) 156-189
33. Sahai, A., Vadhan, S.: A complete problem for statistical zero knowledge. Journal of the ACM 50(2) (2003)
34. Micciancio, D., Vadhan, S.: Statistical zero-knowledge proofs with efficient provers: lattice problems and more. In: Proc. CRYPTO '03. (2003) 282-298
35. Bellare, M., Micali, S., Ostrovsky, R.: Perfect zero-knowledge in constant rounds. In: Proc. 22nd STOC. (1990) 482-493
36. Itoh, T., Ohta, Y., Shizuya, H.: A language-dependent cryptographic primitive. Journal of Cryptology 10(1) (1997) 37-49
37. Rosen, A.: The Round-Complexity of Black-Box Concurrent Zero-Knowledge. PhD thesis, Weizmann Institute of Science, Israel (2003)
38. Chase, M., Healy, A., Lysyanskaya, A., Malkin, T., Reyzin, L.: Mercurial commitments with applications to zero-knowledge sets. In: Proc. EUROCRYPT '05. (2005) 422-439
39. Micali, S., Rabin, M.O., Kilian, J.: Zero-knowledge sets. In: Proc. 44th FOGS. (2003) 80-91
40. Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology 4(2) (1991) 151-158
41. Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing 28(4) (1999) 1364-1396
42. Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. Journal of Computer and System Sciences 60(3) (2000) 540-563
43. Blum, M., De Santis, A., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM Journal on Computing 20(6) (1991) 1084-1118
44. Aharonov, D., Regev, O.: Lattice problems in NP n coNP. In: Proc. 45th FOGS. (2004) 362-371