{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T08:27:47Z","timestamp":1772180867383,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540406747","type":"print"},{"value":"9783540451464","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45146-4_17","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T21:51:19Z","timestamp":1277243479000},"page":"282-298","source":"Crossref","is-referenced-by-count":87,"title":["Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More"],"prefix":"10.1007","author":[{"given":"Daniele","family":"Micciancio","sequence":"first","affiliation":[]},{"given":"Salil P.","family":"Vadhan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput.\u00a018, 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Petrank, E.: Making zero-knowledge provers efficient. In: 24th STOC, pp. 711\u2013722 (1992)","DOI":"10.1145\/129712.129781"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00196727","volume":"4","author":"J. Boyar","year":"1991","unstructured":"Boyar, J., Friedl, K., Lund, C.: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. J. Cryptology\u00a04, 185\u2013206 (1991)","journal-title":"J. Cryptology"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"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\u00a038, 691\u2013729 (1991)","journal-title":"J. ACM"},{"key":"17_CR5","unstructured":"Fortnow, L.: The complexity of perfect zero-knowledge. In: Advances in Computing Research, vol.\u00a05, pp. 327\u2013343. JAC Press (1989)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0022-0000(91)90006-Q","volume":"42","author":"W. Aiello","year":"1991","unstructured":"Aiello, W., H\u00e5stad, J.: Statistical zero-knowledge languages can be recognized in two rounds. J. Comput. System Sci.\u00a042, 327\u2013345 (1991)","journal-title":"J. Comput. System Sci."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jcss.1999.1664","volume":"60","author":"T. Okamoto","year":"2000","unstructured":"Okamoto, T.: On relationships between statistical zero-knowledge proofs. J. Comput. System Sci.\u00a060, 47\u2013108 (2000)","journal-title":"J. Comput. System Sci."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/636865.636868","volume":"50","author":"A. Sahai","year":"2003","unstructured":"Sahai, A., Vadhan, S.: A complete problem for statistical zero knowledge. J. ACM\u00a050, 196\u2013249 (2003)","journal-title":"J. ACM"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Vadhan, S.: Comparing entropies in statistical zero-knowledge with applications to the structure of SZK. In: 14th CCC, pp. 54\u201373 (1999)","DOI":"10.1109\/CCC.1999.766262"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Honest verifier statistical zero-knowledge equals general statistical zero-knowledge. In: 30th STOC, pp. 399\u2013408 (1998)","DOI":"10.1145\/276698.276852"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: On transformations of interactive proofs that preserve the prover\u2019s complexity. In: 32nd STOC, pp. 200\u2013207 (2000)","DOI":"10.1145\/335305.335330"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(99)00164-4","volume":"255","author":"V. Arvind","year":"2001","unstructured":"Arvind, V., K\u00f6bler, J.: On pseudorandomness and resource-bounded measure. Theoret. Comput. Sci.\u00a0255, 205\u2013221 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/S0097539700389652","volume":"31","author":"A.R. Klivans","year":"2002","unstructured":"Klivans, A.R., van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput.\u00a031, 1501\u20131526 (2002)","journal-title":"SIAM J. Comput."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Miltersen, P.B., Vinodchandran, N.V.: Derandomizing Arthur-Merlin games using hitting sets. In: 40th FOCS, pp. 71\u201380 (1999)","DOI":"10.1109\/SFFCS.1999.814579"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1006\/jcss.1997.1472","volume":"54","author":"S. Arora","year":"1997","unstructured":"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.\u00a054, 317\u2013331 (1997)","journal-title":"J. Comput. System Sci."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in L_2 is NP-hard for randomized reductions (extended abstract). In: 30th STOC, pp. 10\u201319 (1998)","DOI":"10.1145\/276698.276705"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1137\/S0097539700373039","volume":"30","author":"D. Micciancio","year":"2001","unstructured":"Micciancio, D.: The shortest vector problem is NP-hard to approximate to within some constant. SIAM J. Comput.\u00a030, 2008\u20132035 (2001)","journal-title":"SIAM J. Comput."},{"key":"17_CR18","unstructured":"Dinur, I., Kindler, G., Raz, R., Safra, S.: An improved lower bound for approximating CVP. Combinatorica (To appear) Preliminary version in FOCS 1998"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th STOC, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: Generalized compact knapsaks, cyclic lattices, and efficient oneway functions from worst-case complexity assumptions (extended abstract). In: 43rd FOCS, pp. 356\u2013365 (2002)","DOI":"10.1109\/SFCS.2002.1181960"},{"key":"17_CR21","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Collision-free hashing from lattice problems. Technical Report TR96-056, ECCC (1996)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: Improved cryptographic hash functions with worst-case\/averagecase connection (extended abstract). In: 34th STOC, pp. 609\u2013618 (2002)","DOI":"10.1145\/509907.509995"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 112\u2013131. Springer, Heidelberg (1997)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: 29th STOC, pp. 284\u2013293 (1997)","DOI":"10.1145\/258533.258604"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J. Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1006\/jcss.1999.1686","volume":"60","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. J. Comput. System Sci.\u00a060, 540\u2013563 (2000)","journal-title":"J. Comput. System Sci."},{"key":"17_CR27","volume-title":"A Study of Statistical Zero-Knowledge Proofs. PhD thesis","author":"S.P. Vadhan","year":"1999","unstructured":"Vadhan, S.P.: A Study of Statistical Zero-Knowledge Proofs. PhD thesis. MIT, Cambridge (1999)"},{"key":"17_CR28","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. J. Cryptology\u00a01, 77\u201394 (1988)","journal-title":"J. Cryptology"},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s001459900018","volume":"10","author":"T. Itoh","year":"1997","unstructured":"Itoh, T., Ohta, Y., Shizuya, H.: A language-dependent cryptographic primitive. J. Cryptology\u00a010, 37\u201349 (1997)","journal-title":"J. Cryptology"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Micciancio, D., Rabin, T.: An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In: 5th ACM CCS, pp. 67\u201372 (1998)","DOI":"10.1145\/288090.288108"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Tompa, M., Woll, H.: Random self-reducibility and zero knowledge interactive proofs of possession of information. In: 28th FOCS, pp. 472\u2013482 (1987)","DOI":"10.1109\/SFCS.1987.49"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On monotone formula closure of SZK. In: 35th FOCS, pp. 454\u2013465 (1994)","DOI":"10.1109\/SFCS.1994.365745"},{"key":"17_CR33","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/S0097539792228289","volume":"23","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Goldwasser, S.: The complexity of decision versus search. SIAM J. Comput.\u00a023, 97\u2013119 (1994)","journal-title":"SIAM J. Comput."},{"key":"17_CR34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge U. Press, New York (2001)"},{"key":"17_CR35","series-title":"Engineering and Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of lattice problems: a cryptographic perspective","author":"D. Micciancio","year":"2002","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of lattice problems: a cryptographic perspective. Engineering and Computer Science, vol.\u00a0671. Kluwer, Dordrecht (2002)"},{"key":"17_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44670-2_11","volume-title":"Cryptography and Lattices","author":"D. Micciancio","year":"2001","unstructured":"Micciancio, D.: Improving lattice based cryptosystems using the Hermite normal form. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 126\u2013145. Springer, Heidelberg (2001)"},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micciancio, D., Safra, S., Seifert, J.P.: Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inf. In: Proc. Lett., vol.\u00a071, pp. 55\u201361 (1999)","DOI":"10.1016\/S0020-0190(99)00083-6"},{"key":"17_CR38","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A hard predicate for all one-way functions. In: 21st STOC (1989)","DOI":"10.1145\/73007.73010"},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: 22nd STOC, pp. 416\u2013426 (1990)","DOI":"10.1145\/100216.100272"},{"key":"17_CR40","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1109\/18.915688","volume":"47","author":"D. Micciancio","year":"2001","unstructured":"Micciancio, D.: The hardness of the closest vector problem with preprocessing. IEEE Trans. Inform. Theory\u00a047, 1212\u20131215 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"17_CR41","unstructured":"Feige, U., Micciancio, D.: The inapproximability of lattice and coding problems with preprocessing. J. Comput. System Sci. (To appear) Preliminary version in CCC (2002)"},{"key":"17_CR42","doi-asserted-by":"crossref","unstructured":"Regev, O.: Improved Inapproximability of Lattice and Coding Problems with Preprocessing. In: 18th CCC (2003)","DOI":"10.1109\/CCC.2003.1214435"},{"key":"17_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-48405-1_30","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"O. Goldreich","year":"1999","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Can statistical zero-knowledge be made noninteractive?, or On the relationship of SZK and NISZK. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, p. 467. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45146-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:05:38Z","timestamp":1740200738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45146-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406747","9783540451464"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45146-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}