{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T12:02:06Z","timestamp":1793102526372,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662464960","type":"print"},{"value":"9783662464977","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46497-7_9","type":"book-chapter","created":{"date-parts":[[2015,3,9]],"date-time":"2015-03-09T02:37:58Z","timestamp":1425868678000},"page":"229-246","source":"Crossref","is-referenced-by-count":11,"title":["Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence"],"prefix":"10.1007","author":[{"given":"Kai-Min","family":"Chung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","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":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: FOCS, pp. 374\u2013383 (1997)","DOI":"10.1109\/SFCS.1997.646126"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L. Babai","year":"1988","unstructured":"Babai, L., Moran, S.: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes. J. Comput. Syst. Sci.\u00a036(2), 254\u2013276 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-03685-9_27","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"B. Barak","year":"2009","unstructured":"Barak, B., Rao, A., Raz, R., Rosen, R., Shaltiel, R.: Strong parallel repetition theorem for free projection games. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 352\u2013365. Springer, Heidelberg (2009)"},{"key":"9_CR5","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":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-11799-2_2","volume-title":"Theory of Cryptography","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":"9_CR7","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing). Wiley-Interscience (2006)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-28914-9_27","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2012","unstructured":"Dodis, Y., Jain, A., Moran, T., Wichs, D.: Counterexamples to hardness amplification beyond negligible. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 476\u2013493. Springer, Heidelberg (2012)"},{"key":"9_CR9","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)"},{"issue":"1","key":"9_CR10","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":"9_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic tools. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Haitner, I.: A parallel repetition theorem for any interactive argument. In: FOCS (2009)","DOI":"10.1109\/FOCS.2009.50"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.4086\/toc.2009.v005a008","volume":"5","author":"T. Holenstein","year":"2009","unstructured":"Holenstein, T.: Parallel repetition: Simplification and the no-signaling case. Theory of Computing\u00a05(1), 141\u2013172 (2009)","journal-title":"Theory of Computing"},{"key":"9_CR14","unstructured":"H\u00e5stad, J., Pass, R., Wikstr\u00f6m, D., Pietrzak, K.: An efficient parallel repetition theorem (2008) (unpublished manuscript)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-11799-2_1","volume-title":"Theory of Cryptography","author":"J. H\u00e5stad","year":"2010","unstructured":"H\u00e5stad, J., Pass, R., Wikstr\u00f6m, D., Pietrzak, K.: An efficient parallel repetition theorem. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 1\u201318. Springer, Heidelberg (2010)"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00145-008-9029-7","volume":"22","author":"R. Impagliazzo","year":"2009","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V.: Chernoff-type direct product theorems. J. Cryptology\u00a022(1), 75\u201392 (2009)","journal-title":"J. Cryptology"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Pass, R., Venkitasubramaniam, M.: An efficient parallel repetition theorem for arthur-merlin games. In: STOC, pp. 420\u2013429 (2007)","DOI":"10.1145\/1250790.1250853"},{"issue":"4","key":"9_CR18","first-page":"10","volume":"4","author":"R. Pass","year":"2012","unstructured":"Pass, R., Venkitasubramaniam, M.: A parallel repetition theorem for constant-round arthur-merlin proofs. Transactions on Computation Theory\u00a04(4), 10 (2012)","journal-title":"Transactions on Computation Theory"},{"key":"9_CR19","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":"9_CR20","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 J. Comput.\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM J. Comput."},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions (extended abstract). In: FOCS, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"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-662-46497-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T16:01:04Z","timestamp":1747756864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46497-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662464960","9783662464977"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46497-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}