{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:24:32Z","timestamp":1748384672410},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T00:00:00Z","timestamp":1288742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s00145-010-9090-x","type":"journal-article","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T14:38:11Z","timestamp":1288708691000},"page":"116-135","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Repetition of Computationally Sound Protocols Revisited"],"prefix":"10.1007","volume":"25","author":[{"given":"Krzysztof","family":"Pietrzak","sequence":"first","affiliation":[]},{"given":"Douglas","family":"Wikstr\u00f6m","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,3]]},"reference":[{"issue":"5","key":"9090_CR1","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1137\/070709244","volume":"38","author":"B. Barak","year":"2008","unstructured":"B. Barak, O. Goldreich, Universal arguments and their applications. SIAM J. Comput. 38(5), 1661\u20131694 (2008)","journal-title":"SIAM J. Comput."},{"key":"9090_CR2","first-page":"374","volume-title":"38th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"M. Bellare","year":"1997","unstructured":"M. Bellare, R. Impagliazzo, M. Naor, Does parallel repetition lower the error in computationally sound protocols? in 38th IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Los Alamitos, 1997), pp. 374\u2013383"},{"issue":"2","key":"9090_CR3","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, C. Cr\u00e9peau, Minimum disclosure proofs of knowledge. J.\u00a0Comput. Syst. Sci. 37(2), 156\u2013189 (1988)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9090_CR4","first-page":"17","volume-title":"TCC","author":"R. Canetti","year":"2005","unstructured":"R. Canetti, S. Halevi, M. Steiner, Hardness amplification of weakly verifiable puzzles, in TCC (2005), pp. 17\u201333"},{"key":"9090_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-11799-2_2","volume-title":"TCC 2010: 7th Theory of Cryptography Conference","author":"K.-M. Chung","year":"2010","unstructured":"K.-M. Chung, F.-H. Liu, Parallel repetition theorems for interactive arguments, in TCC 2010: 7th Theory of Cryptography Conference, ed. by Daniele Micciancio. Zurich, Switzerland, February 9\u201311, 2010. Lecture Notes in Computer Science, vol.\u00a05978 (Springer, Berlin, 2010), pp. 19\u201336"},{"key":"9090_CR6","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\u2014Eurocrypt 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"I. Damg\u00e5rd, M. Koprowski, Generic lower bounds for root extraction and signature schemes in general groups, in Advances in Cryptology\u2014Eurocrypt 2002. Lecture Notes in Computer Science, vol.\u00a02332 (Springer, Berlin, 2002), pp. 256\u2013271"},{"key":"9090_CR7","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1007\/BFb0055101","volume-title":"25th International Colloquium on Automata, Languages and Programming (ICALP)","author":"I. Damg\u00e5rd","year":"1998","unstructured":"I. Damg\u00e5rd, B. Pfitzmann, Sequential iteration of interactive arguments and an efficient zero-knowledge argument for np, in 25th International Colloquium on Automata, Languages and Programming (ICALP) (1998), pp. 772\u2013783"},{"key":"9090_CR8","first-page":"542","volume-title":"23rd ACM Symposium on the Theory of Computing (STOC)","author":"D. Dolev","year":"1991","unstructured":"D. Dolev, C. Dwork, M. Naor, Non-malleable cryptography, in 23rd ACM Symposium on the Theory of Computing (STOC) (ACM, New York, 1991), pp. 542\u2013552"},{"key":"9090_CR9","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/SCT.1991.160251","volume-title":"Structure in Complexity Theory Conference","author":"U. Feige","year":"1991","unstructured":"U. Feige, On the success probability of the two provers in one-round proof systems, in Structure in Complexity Theory Conference (1991), pp.\u00a0116\u2013123"},{"issue":"4","key":"9090_CR10","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00493-002-0001-0","volume":"22","author":"U. Feige","year":"2002","unstructured":"U. Feige, O. Verbitsky, Error reduction by parallel repetition\u2014a\u00a0negative result. Combinatorica 22(4), 461\u2013478 (2002)","journal-title":"Combinatorica"},{"key":"9090_CR11","volume-title":"Modern Cryptography, Probabilistic Proofs, and Pseudorandomness","author":"O. Goldreich","year":"1998","unstructured":"O. Goldreich, Modern Cryptography, Probabilistic Proofs, and Pseudorandomness (Springer, New York, 1998)"},{"issue":"1","key":"9090_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich, H. Krawczyk, On the composition of zero-knowledge proof systems. SIAM J. Comput. 25(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9090_CR13","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"9090_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1109\/FOCS.2009.50","volume-title":"50th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"I. Haitner","year":"2009","unstructured":"I. Haitner, A\u00a0parallel repetition theorem for any interactive argument, in 50th IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Los Alamitos, 2009), pp. 241\u2013250"},{"key":"9090_CR15","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"TCC 2010: 7th Theory of Cryptography Conference","author":"J. H\u00e5stad","year":"2010","unstructured":"J. H\u00e5stad, R. Pass, D. Wikstr\u00f6m, K. Pietrzak, An efficient parallel repetition theorem, in TCC 2010: 7th Theory of Cryptography Conference, ed. by D. Micciancio. Zurich, Switzerland, February 9\u201311, 2010. Lecture Notes in Computer Science, vol. 5978 (Springer, Berlin, 2010), pp. 1\u201318"},{"key":"9090_CR16","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-540-74143-5_28","volume-title":"Advances in Cryptology\u2014Crypto 2007","author":"R. Impagliazzo","year":"2007","unstructured":"R. Impagliazzo, R. Jaiswal, V. Kabanets, Chernoff-type direct product theorems, in Advances in Cryptology\u2014Crypto 2007 (2007), pp. 500\u2013516"},{"issue":"4","key":"9090_CR17","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S. Micali","year":"2000","unstructured":"S. Micali, Computationally sound proofs. SIAM J. Comput. 30(4), 1253\u20131298 (2000)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9090_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"V.I. Nechaev","year":"1994","unstructured":"V.I. Nechaev, Complexity of a determinate algorithm for the discrete logarithm. Math. Not. 55(2), 165\u2013172 (1994)","journal-title":"Math. Not."},{"key":"9090_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-85174-5_4","volume-title":"Advances in Cryptology-Crypto 2008","author":"O. Pandey","year":"2008","unstructured":"O. Pandey, R. Pass, V. Vaikuntanathan, Adaptive one-way functions and applications, in Advances in Cryptology-Crypto 2008. Lecture Notes in Computer Science, vol.\u00a05157 (Springer, Berlin, 2008), pp. 57\u201374"},{"key":"9090_CR20","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1145\/1250790.1250853","volume-title":"STOC","author":"R. Pass","year":"2007","unstructured":"R. Pass, M. Venkitasubramaniam, An efficient parallel repetition theorem for Arthur-Merlin games, in STOC2007, pp. 420\u2013429"},{"key":"9090_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1007\/978-3-642-13190-5_32","volume-title":"Advances in Cryptology\u2014Eurocrypt\u201910","author":"R. Pass","year":"2010","unstructured":"R. Pass, H. Wee, Constant-round non-malleable commitments from sub-exponential one-way functions, in Advances in Cryptology\u2014Eurocrypt\u201910. Lecture Notes in Computer Science (Springer, Berlin, 2010), pp. 638\u2013655"},{"issue":"3","key":"9090_CR22","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"R. Raz, A\u00a0parallel repetition theorem. SIAM J. Comput. 27(3), 763\u2013803 (1998)","journal-title":"SIAM J. Comput."},{"key":"9090_CR23","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/FOCS.2008.49","volume-title":"49th Annual Symposium on Foundations of Computer Science","author":"R. Raz","year":"2008","unstructured":"R. Raz, A\u00a0counterexample to strong parallel repetition, in 49th Annual Symposium on Foundations of Computer Science. Philadelphia, Pennsylvania, USA, October 25\u201328, 2008 (IEEE Computer Society, Los Alamitos, 2008), pp. 369\u2013373"},{"key":"9090_CR24","series-title":"Lecture Notes in Computer Science","first-page":"433","volume-title":"Advances in Cryptology\u2014Crypto\u201991","author":"C. Rackoff","year":"1991","unstructured":"C. Rackoff, D. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack, in Advances in Cryptology\u2014Crypto\u201991. Lecture Notes in Computer Science, vol.\u00a0576 (Springer, Berlin, 1991), pp. 433\u2013444"},{"key":"9090_CR25","first-page":"543","volume-title":"40th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"A. Sahai","year":"1999","unstructured":"A. Sahai, Non-malleable non-interactive zero-knowledge and adaptive chosen-ciphertext security, in 40th IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Los Alamitos, 1999), pp.\u00a0543\u2013553"},{"key":"9090_CR26","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\u2014Eurocrypt\u201997","author":"V. Shoup","year":"1997","unstructured":"V. Shoup, Lower bounds for discrete logarithms and related problems, in Advances in Cryptology\u2014Eurocrypt\u201997. Lecture Notes in Computer Science, vol.\u00a01233 (Springer, Berlin, 1997), pp.\u00a0256\u2013266"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9090-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-010-9090-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9090-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9090-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T02:54:35Z","timestamp":1685847275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-010-9090-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,3]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9090"],"URL":"https:\/\/doi.org\/10.1007\/s00145-010-9090-x","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,3]]},"assertion":[{"value":"3 May 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2010","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}