{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:41:53Z","timestamp":1725468113402},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647812"},{"type":"electronic","value":"9783540686811"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055101","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T08:08:05Z","timestamp":1154419685000},"page":"772-783","source":"Crossref","is-referenced-by-count":8,"title":["Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[]},{"given":"Birgit","family":"Pfitzmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"66_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, and C. Cr\u00e9peau, \u201cMinimum Disclosure Proofs of Knowledge\u201d, J. Computer and System Sciences, vol. 37, pp. 156\u2013189, 1988.","journal-title":"J. Computer and System Sciences"},{"key":"66_CR2","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology \u2014 Proc. CRYPTO '92","author":"M. Bellare","year":"1993","unstructured":"M. Bellare and O. Goldreich, \u201cOn Defining Proofs of Knowledge\u201d, in Advances in Cryptology \u2014 Proc. CRYPTO '92, Berlin: Springer-Verlag, 1993, pp. 390\u2013420."},{"key":"66_CR3","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L. Babai","year":"1988","unstructured":"L. Babai and S. Moran, \u201cArthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes\u201d, J. Computer and System Sciences, vol.36, pp.254\u2013276, 1988.","journal-title":"J. Computer and System Sciences"},{"key":"66_CR4","series-title":"Theory of Cryptography Library 97-04","volume-title":"Technical Report CS97-529","author":"M. Bellare","year":"1997","unstructured":"M. Bellare, \u201cA Note on Negligible Functions\u201d, Technical Report CS97-529, Dept. of Comp. Sc. and Eng., UC San Diego, 1997, and Theory of Cryptography Library 97-04, http:\/\/theory.lcs.mit.edu\/teryptol\/."},{"key":"66_CR5","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Impagliazzo, and M. Naor, \u201cDoes Parallel Repetition Lower the Error in Computationally Sound Protocols?\u201d, in Proc. 38th IEEE Symp. Foundations of Computer Science, 1997.","DOI":"10.1109\/SFCS.1997.646126"},{"key":"66_CR6","doi-asserted-by":"crossref","unstructured":"R. Cramer and I. B. Damg\u00e5rd, \u201cLinear Zero-Knowledge \u2014 A Note on Efficient Zero-Knowledge Proofs and Arguments\u201d, in Proc. 29th Annual ACM Symp. Theory of Computing, 1997, pp. 436\u2013445.","DOI":"10.1145\/258533.258635"},{"key":"66_CR7","first-page":"203","volume-title":"Advances in Cryptology \u2014 Proc. EUROCRYPT '87","author":"I. B. Damg\u00e5rd","year":"1988","unstructured":"I. B. Damg\u00e5rd, \u201cCollision free hash functions and public key signature schemes\u201d, in Advances in Cryptology \u2014 Proc. EUROCRYPT '87, Berlin: Springer-Verlag, 1988, pp. 203\u2013216."},{"key":"66_CR8","doi-asserted-by":"crossref","unstructured":"I. B. Damg\u00e5rd and B. Pfitzmann, \u201cSequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP\u201d, BRICS report RS-97-50, 1997, http:\/\/www.brics.dk.","DOI":"10.7146\/brics.v4i50.19271"},{"key":"66_CR9","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-48329-2_22","volume-title":"Advances in Cryptology \u2014 Proc. CRYPTO '93","author":"I. B. Damg\u00e5rd","year":"1994","unstructured":"I. B. Damg\u00e5rd, T. P. Pedersen, and B. Pfitzmann, \u201cOn the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures\u201d, in Advances in Cryptology \u2014 Proc. CRYPTO '93, Berlin: Springer-Verlag, 1994, pp. 250\u2013265."},{"key":"66_CR10","doi-asserted-by":"crossref","unstructured":"I. B. Damg\u00e5rd, T. P. Pedersen, and B. Pfitzmann, \u201cStatistical Secrecy and Multi-Bit Commitments\u201d, BRICS report RS-96-45, 1996, http:\/\/www.brics.dk. To appear in IEEE Trans. Inform. Theory, May 1998.","DOI":"10.7146\/brics.v3i45.20047"},{"key":"66_CR11","doi-asserted-by":"crossref","unstructured":"L. Fortnow, \u201cThe Complexity of Perfect Zero Knowledge\u201d, in Proc. 19th Annual ACM Symp. Theory of Computing, 1987, pp. 204\u2013209.","DOI":"10.1145\/28395.28418"},{"key":"66_CR12","volume-title":"Foundations of Cryptography (Fragments of a Book)","author":"O. Goldreich","year":"1995","unstructured":"O. Goldreich, Foundations of Cryptography (Fragments of a Book), Dept. of Comp. Sc. and Applied Math., Weizmann Institute of Science, Rehovot, Israel, 1995,http:\/\/theory.lcs.mit.edu\/oded\/ (with updates)."},{"issue":"no.1","key":"66_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02620230","volume":"6","author":"O. Goldreich","year":"1993","unstructured":"O. Goldreich, \u201cA Uniform-Complexity Treatment of Encryption and Zero-Knowledge\u201d, J. Cryptology, vol. 6, no. 1, pp. 21\u201353, 1993.","journal-title":"J. Cryptology"},{"key":"66_CR14","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, \u201cProbabilistic encryption\u201d, J. Computer and System Sciences, vol. 28, pp. 270\u2013299, 1984.","journal-title":"J. Computer and System Sciences"},{"issue":"no.1","key":"66_CR15","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, \u201cThe knowledge complexity of interactive proof systems\u201d, SIAM J. Computing, vol. 18, no. 1, pp. 186\u2013208, 1989.","journal-title":"SIAM J. Computing"},{"issue":"no.1","key":"66_CR16","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, \u201cProofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems\u201d, J. ACM, vol. 38, no. 1, pp. 691\u2013729, 1991.","journal-title":"J. ACM"},{"key":"66_CR17","doi-asserted-by":"crossref","unstructured":"J. Kilian, \u201cA Note on Efficient Zero-Knowledge Proofs and Arguments\u201d, in Proc. 24th Annual ACM Symp. Theory of Computing, 1992, pp. 723\u2013732.","DOI":"10.1145\/129712.129782"},{"key":"66_CR18","doi-asserted-by":"crossref","unstructured":"J. Kilian, S. Micali, and R. Ostrovsky, \u201cMinimum resource zero-knowledge proofs\u201d, in Proc. 30th IEEE Symp. Foundations of Computer Science, 1989, pp. 474\u2013479.","DOI":"10.1109\/SFCS.1989.63521"},{"key":"66_CR19","unstructured":"Secure Hash Standard, Federal Information Processing Standards Publication FIPS PUB 180-1, 1995."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:18:48Z","timestamp":1555748328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647812","9783540686811"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0055101","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}