{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:45Z","timestamp":1725490425918},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_30","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T10:58:43Z","timestamp":1188039523000},"page":"328-339","source":"Crossref","is-referenced-by-count":5,"title":["A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)"],"prefix":"10.1007","author":[{"given":"Bruce","family":"Kapron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lior","family":"Malka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"30_CR1","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. of Computer and System Sciences\u00a042(3), 327\u2013345 (1991)","journal-title":"J. of Computer and System Sciences"},{"key":"30_CR2","unstructured":"Angluin, D., Lichtenstein, D.: Provable security in cryptosystems: a survey. Technical Report 288, Department of Computer Science, Yale University (1983)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., Ostrovsky, R.: Perfect zero-knowledge in constant rounds. In: 22nd STOC, pp. 482\u2013493 (1990)","DOI":"10.1145\/100216.100283"},{"key":"30_CR5","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the ICM, pp. 1444\u20131451 (1986)"},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R.B. Boppana","year":"1987","unstructured":"Boppana, R.B., H\u00e5stad, J., Zachos, S.: Does co-NP have short interactive proofs? Inf. Process. Lett.\u00a025(2), 127\u2013132 (1987)","journal-title":"Inf. Process. Lett."},{"key":"30_CR7","unstructured":"Cramer, R.: Modular Design of Secure yet Practical Cryptographic Protocols. PhD thesis, CWI and Uni. of Amsterdam (1996)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., MacKenzie, P.D.: Efficient zero-knowledge proofs of knowledge without intractability assumptions. In: Public Key Cryptography, pp. 354\u2013372 (2000)","DOI":"10.1007\/978-3-540-46588-1_24"},{"key":"30_CR9","unstructured":"D\u00e5mgard, I., Cramer, R.: On monotone function closure of perfect and statistical zero-knowledge (1996)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/0-387-34805-0_3","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I.B. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: On the existence of bit commitment schemes and zero-knowledge proofs. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 17\u201327. Springer, Heidelberg (1990)"},{"key":"30_CR11","unstructured":"Damg\u00e5rd, I.B.: On \u03a3-protocols (2005), available online at www.daimi.au.dk\/~ivan\/Sigma.pdf"},{"key":"30_CR12","unstructured":"Fortnow, L.: The complexity of perfect zero-knowledge. In: Micali, S. (ed.) Advances in Computing Research, vol.\u00a05, pp. 327\u2013343. JAC Press (1989)"},{"issue":"3","key":"30_CR13","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(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"issue":"1","key":"30_CR14","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(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"30_CR15","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"30_CR16","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(1), 37\u201350 (1997)","journal-title":"J. Cryptology"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R.: Local zero knowledge. In: STOC, pp. 306\u2013315 (2006)","DOI":"10.1145\/1132516.1132561"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11681878_1","volume-title":"Theory of Cryptography","author":"D. Micciancio","year":"2006","unstructured":"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.\u00a03876, pp. 1\u201320. Springer, Heidelberg (2006)"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/978-3-540-45146-4_17","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"D. Micciancio","year":"2003","unstructured":"Micciancio, D., Vadhan, S.P.: Statistical zero-knowledge proofs with efficient provers: Lattice problems and more. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 282\u2013298. Springer, Heidelberg (2003)"},{"issue":"2","key":"30_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/1132516.1132559","volume-title":"STOC 2006","author":"M.-H. Nguyen","year":"2006","unstructured":"Nguyen, M.-H., Vadhan, S.: Zero knowledge with efficient provers. In: STOC 2006. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, Seattle, WA, USA, pp. 287\u2013295. ACM Press, New York (2006)"},{"key":"30_CR22","unstructured":"Ong, S.J., Vadhan, S.: Zero knowledge and soundness are symmetric. Electronic Colloquium on Computational Complexity (ECCC) (TR06-139) (2006)"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS, pp. 366\u2013375 (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"issue":"2","key":"30_CR24","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/636865.636868","volume":"50","author":"A. Sahai","year":"2003","unstructured":"Sahai, A., Vadhan, S.P.: A complete problem for statistical zero-knowledge. J. ACM\u00a050(2), 196\u2013249 (2003)","journal-title":"J. ACM"},{"key":"30_CR25","first-page":"454","volume-title":"IEEE Symposium on Foundations of Computer Science","author":"A. Santis De","year":"1994","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On monotone formula closure of SZK. In: IEEE Symposium on Foundations of Computer Science, pp. 454\u2013465. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"30_CR26","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":"30_CR27","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: An unconditional study of computational zero knowledge. In: FOCS, pp. 176\u2013185 (2004)","DOI":"10.1109\/FOCS.2004.13"},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. In: STOC, pp. 296\u2013305 (2006)","DOI":"10.1145\/1132516.1132560"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:11:06Z","timestamp":1619503866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}