{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:05:12Z","timestamp":1765112712671,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642117985"},{"type":"electronic","value":"9783642117992"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11799-2_1","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T08:55:48Z","timestamp":1265100948000},"page":"1-18","source":"Crossref","is-referenced-by-count":29,"title":["An Efficient Parallel Repetition Theorem"],"prefix":"10.1007","author":[{"given":"Johan","family":"H\u00e5stad","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[]},{"given":"Douglas","family":"Wikstr\u00f6m","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","first-page":"421","volume-title":"17th ACM Symposium on the Theory of Computing (STOC)","author":"L. Babai","year":"1985","unstructured":"Babai, L.: Trading group theory for randomness. In: 17th ACM Symposium on the Theory of Computing (STOC), pp. 421\u2013429. ACM Press, New York (1985)"},{"key":"1_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)"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences\u00a037(2), 156\u2013189 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-30576-7_2","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Hardness amplification of weakly verifiable puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 17\u201333. Springer, Heidelberg (2005)"},{"key":"1_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","author":"K.-M. Chung","year":"2010","unstructured":"Chung, K.-M., Liu, F.-H.: Parallel repetition theorems for interactive arguments. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 19\u201336. Springer, Heidelberg (2010)"},{"key":"1_CR6","series-title":"Algorithms and Combinatorics","volume-title":"Modern Cryptography, Probabilistic Proofs and Pseudorandomness","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O.: Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics. Springer, Heidelberg (1998)"},{"issue":"1","key":"1_CR7","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 Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR8","volume-title":"50th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"I. Haitner","year":"2009","unstructured":"Haitner, I.: A parallel repetition theorem for any interactive argument. In: 50th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos (2009)"},{"key":"1_CR9","unstructured":"H\u00e5stad, J., Pass, R., Pietrzak, Wikstr\u00f6m, D.: An efficient parallel repetition theorem (April 2008) (manuscript)"},{"key":"1_CR10","first-page":"411","volume-title":"39th ACM Symposium on the Theory of Computing (STOC)","author":"T. Holenstein","year":"2007","unstructured":"Holenstein, T.: Parallel repetition: simplifications and the no-signaling case. In: 39th ACM Symposium on the Theory of Computing (STOC), pp. 411\u2013419. ACM, New York (2007)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-540-74143-5_28","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"R. Impagliazzo","year":"2007","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V.: Chernoff-type direct product theorems. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 500\u2013516. Springer, Heidelberg (2007)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-03356-8_10","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"R. Pass","year":"2009","unstructured":"Pass, R., Tseng, D., Wikstr\u00f6m, D.: On the composition of public-coin zero-knowledge protocols. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 160\u2013176. Springer, Heidelberg (2009)"},{"key":"1_CR13","first-page":"420","volume-title":"39th ACM Symposium on the Theory of Computing (STOC)","author":"R. Pass","year":"2007","unstructured":"Pass, R., Venkitasubramaniam, M.: An efficient parallel repetition theorem for arthur-merlin games. In: 39th ACM Symposium on the Theory of Computing (STOC), pp. 420\u2013429. ACM, New York (2007)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-70936-7_5","volume-title":"Theory of Cryptography","author":"K. Pietrzak","year":"2007","unstructured":"Pietrzak, K., Wikstr\u00f6m, D.: Parallel repetition of computationally sound protocols revisited. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 86\u2013102. Springer, Heidelberg (2007)"},{"issue":"3","key":"1_CR15","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":"1_CR16","unstructured":"Wikstr\u00f6m, D.: An efficient concurrent repetition theorem (2009), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"1_CR17","first-page":"80","volume-title":"23rd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 80\u201391. IEEE Computer Society Press, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11799-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T11:04:06Z","timestamp":1548414246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11799-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642117985","9783642117992"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11799-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}