Statistical zero-knowledge proofs with efficient provers: Lattice problems and more

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

Volumn 2729, Issue , 2003, Pages 282-298

  Micciancio, Daniele ^a   Vadhan, Salil P ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; PROGRAMMABLE LOGIC CONTROLLERS; VECTORS;

CLOSEST VECTOR PROBLEM; COMPLETE PROBLEMS; IDENTIFICATION SCHEME; LATTICE PROBLEMS; PROBABILISTIC POLYNOMIAL TIME; SHORTEST VECTOR PROBLEM; STATISTICAL DIFFERENCES; STATISTICAL ZERO KNOWLEDGE;

STATISTICS;

EID: 35248837045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_17     Document Type: Article

References (43)

1. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18 (1989) 186-208
2. Bellare, M., Petrank, E.: Making zero-knowledge provers efficient. In: 24th STOC. (1992) 711-722
3. Boyar, J., Friedl, K., Lund, C.: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. J. Cryptology 4 (1991) 185-206
4. 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 (1991) 691-729
5. Fortnow, L.: The complexity of perfect zero-knowledge. In: Advances in Computing Research. Volume 5. JAC Press (1989) 327-343
6. Aiello, W., Hastad, J.: Statistical zero-knowledge languages can be recognized in two rounds. J. Comput. System Sci. 42 (1991) 327-345
7. Okamoto, T.: On relationships between statistical zero-knowledge proofs. J. Comput. System Sci. 60 (2000) 47-108
8. Sahai, A., Vadhan, S.: A complete problem for statistical zero knowledge. J. ACM 50 (2003) 196-249
9. Goldreich, O., Vadhan, S.: Comparing entropies in statistical zero-knowledge with applications to the structure of SZK. In: 14th CCC. (1999) 54-73
10. Goldreich, O., Sahai, A., Vadhan, S.: Honest verifier statistical zero-knowledge equals general statistical zero-knowledge. In: 30th STOC. (1998) 399-408
11. Vadhan, S.P.: On transformations of interactive proofs that preserve the prover's complexity. In: 32nd STOC. (2000) 200-207
12. Arvind, V., Köbler, J.: On pseudorandomness and resource-bounded measure. Theoret. Comput. Sci. 255 (2001) 205-221
13. Klivans, A.R., van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput. 31 (2002) 1501-1526
14. Miltersen, P.B., Vinodchandran, N.V.: Derandomizing Arthur-Merlin games using hitting sets. In: 40th FOCS. (1999) 71-80
15. Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. System Sci. 54 (1997) 317-331
16. Ajtai, M.: The shortest vector problem in L_2 is NP-hard for randomized reductions (extended abstract). In: 30th STOC. (1998) 10-19
17. Micciancio, D.: The shortest vector problem is NP-hard to approximate to within some constant. SIAM J. Comput. 30 (2001) 2008-2035
18. Dinur, I., Kindler, G., Raz, R., Safra, S.: An improved lower bound for approximating CVP. Combinatorica (To appear) Preliminary version in FOCS '98.
19. Ajtai, MT: Generating hard instances of lattice problems (extended abstract). In: 28th STOC. (1996) 99-108
20. Micciancio, D.: Generalized compact knapsaks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions (extended abstract). In: 43rd FOCS. (2002) 356-365
21. Goldreich, O., Goldwasser, S., Halevi, S.: Collision-free hashing from lattice problems. Technical Report TR96-056, ECCC (1996)
22. Micciancio, D.: Improved cryptographic hash functions with worst-case/average-case connection (extended abstract). In: 34th STOC. (2002) 609-618
23. Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: CRYPTO '97. Volume 1294 of Springer LNCS. (1997) 112-131
24. Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average-case equivalence. In: 29th STOC. (1997) 284-293
25. Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring based public key cryptosystem. In: Algorithmic number theory (ANTS III). Volume 1423 of Springer LNCS. (1998) 267-288
26. Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. J. Comput. System Sci. 60 (2000) 540-563
27. Vadhan, S.P.: A Study of Statistical Zero-Knowledge Proofs. PhD thesis, MIT (1999)
28. Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. J. Cryptology 1 (1988) 77-94
29. Itoh, T., Ohta, Y., Shizuya, H.: A language-dependent cryptographic primitive. J. Cryptology 10 (1997) 37-49
30. Gennaro, R., Micciancio, D., Rabin, T.: An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In: 5th ACM CCS. (1998) 67-72
31. Tompa, M., Woll, H.: Random self-reducibility and zero knowledge interactive proofs of possession of information. In: 28th FOCS. (1987) 472-482
32. De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On monotone formula closure of SZK. In: 35th FOCS. (1994) 454-465
33. Bellare, M., Goldwasser, S.: The complexity of decision versus search. SIAM J. Comput. 23 (1994) 97-119
34. Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge U. Press (2001)
35. Micciancio, D., Goldwasser, S.: Complexity of lattice problems: a cryptographic perspective. Volume 671 of Engineering and Computer Science. Kluwer (2002)
36. Micciancio, D.: Improving lattice based cryptosystems using the Hermite normal form. In: Cryptography and Lattices Conference. Volume 2146 of Springer LNCS. (2001) 126-145
37. Goldreich, O., Micciancio, D., Safra, S., Seifert, J.P.: Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inf. Proc. Lett. 71 (1999) 55-61
38. Goldreich, O., Levin, L.: A hard predicate for all one-way functions. In: 21st STOC. (1989)
39. Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: 22nd STOC. (1990) 416-426
40. Micciancio, D.: The hardness of the closest vector problem with preprocessing. IEEE Trans. Inform. Theory 47 (2001) 1212-1215
41. Feige, U., Micciancio, D.: The inapproximability of lattice and coding problems with preprocessing. J. Comput. System Sci. (To appear) Preliminary version in CCC 2002.
42. Regev, O.: Improved Inapproximability of Lattice and Coding Problems with Preprocessing. In: 18th CCC. (2003)
43. Goldreich, O., Sahai, A., Vadhan, S.: Can statistical zero-knowledge be made non-interactive?, or On the relationship of SZK and NISZK. In: CRYPTO '99. Volume 1666 of Springer LNCS. (1999)