{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:51:41Z","timestamp":1725511901781},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709350"},{"type":"electronic","value":"9783540709367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70936-7_5","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T11:43:44Z","timestamp":1179315824000},"page":"86-102","source":"Crossref","is-referenced-by-count":20,"title":["Parallel Repetition of Computationally Sound Protocols Revisited"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Pietrzak","sequence":"first","affiliation":[]},{"given":"Douglas","family":"Wikstr\u00f6m","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. Electronic Colloquium on Computational Complexity (ECCC), (093) (2001)"},{"key":"5_CR2","first-page":"374","volume-title":"38th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: 38th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 374\u2013383. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-46035-7_17","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Koprowski, M.: Generic lower bounds for root extraction and signature schemes in general groups. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 256\u2013271. Springer, Heidelberg (2002)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1007\/BFb0055101","volume-title":"Automata, Languages and Programming","author":"I. Damg\u00e5rd","year":"1998","unstructured":"Damg\u00e5rd, I., Pfitzmann, B.: Sequential iteration of interactive arguments and an efficient zero-knowledge argument for np. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 772\u2013783. Springer, Heidelberg (1998)"},{"key":"5_CR5","first-page":"542","volume-title":"23rd ACM Symposium on the Theory of Computing (STOC)","author":"D. Dolev","year":"1991","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: 23rd ACM Symposium on the Theory of Computing (STOC), pp. 542\u2013552. ACM Press, New York (1991)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Feige, U.: On the success probability of the two provers in one-round proof systems. In: Structure in Complexity Theory Conference, pp. 116\u2013123 (1991)","DOI":"10.1109\/SCT.1991.160251"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00493-002-0001-0","volume":"22","author":"U. Feige","year":"2002","unstructured":"Feige, U., Verbitsky, O.: Error reduction by parallel repetition \u2013 a negative result. Combinatorica\u00a022(4), 461\u2013478 (2002)","journal-title":"Combinatorica"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM Journal on Computing\u00a025(1), 169\u2013192 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S. Micali","year":"2000","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput.\u00a030(4), 1253\u20131298 (2000)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"V.I. Nechaev","year":"1994","unstructured":"Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes\u00a055(2), 165\u2013172 (1994)","journal-title":"Mathematical Notes"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 433\u2013444. Springer, Heidelberg (1992)"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A parallel repetition theorem. SIAM Journal on Computing\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR13","first-page":"543","volume-title":"40th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"A. Sahai","year":"1999","unstructured":"Sahai, A.: Non-malleable non-interactive zero-knowledge and adaptive chosen-ciphertext security. In: 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 543\u2013553. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70936-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:12:59Z","timestamp":1605762779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70936-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709350","9783540709367"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70936-7_5","relation":{},"subject":[]}}