{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:23:58Z","timestamp":1743128638479,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030568764"},{"type":"electronic","value":"9783030568771"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-56877-1_19","type":"book-chapter","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T17:17:58Z","timestamp":1597166278000},"page":"544-573","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence"],"prefix":"10.1007","author":[{"given":"Itay","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iftach","family":"Haitner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eliad","family":"Tsfadia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,10]]},"reference":[{"key":"19_CR1","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, 19\u201322 October 1997, pp. 374\u2013383 (1997)"},{"key":"19_CR2","unstructured":"Berman, I., Haitner, I., Tsfadia, E.: A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence. Cryptology ePrint Archive, Report 2019\/393 (2019). https:\/\/eprint.iacr.org\/2019\/393"},{"issue":"2","key":"19_CR3","first-page":"831","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. J. ACM 43(2), 831\u2013871 (2014)","journal-title":"J. ACM"},{"key":"19_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. 3378, pp. 17\u201333. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_2"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00012580","volume":"6","author":"F Chung","year":"2002","unstructured":"Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Ann. Comb. 6, 125\u2013145 (2002). https:\/\/doi.org\/10.1007\/PL00012580","journal-title":"Ann. Comb."},{"key":"19_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. 5978, pp. 19\u201336. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_2"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Chung, K.M., Pass, R.: The randomness complexity of parallel repetition. In: Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 658\u2013667 (2011)","DOI":"10.1109\/FOCS.2011.93"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-662-46497-7_9","volume-title":"Theory of Cryptography","author":"K-M Chung","year":"2015","unstructured":"Chung, K.-M., Pass, R.: Tight parallel repetition theorems for public-coin arguments Using KL-divergence. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol. 9015, pp. 229\u2013246. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_9"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Damg\u00e4rd, I.B., Pfitzmann, B.: Sequential iteration arguments and an efficient zero-knowledge argument for NP. In: Annual International Colloquium on Automata, Languages and Programming (ICALP), pp. 772\u2013783 (1998)","DOI":"10.1007\/BFb0055101"},{"key":"19_CR10","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, 31 May\u201303 June 2014, pp. 624\u2013633 (2014)"},{"key":"19_CR11","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. 7194, pp. 476\u2013493. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_27"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/cpa.3160360204","volume":"36","author":"MD Donsker","year":"1983","unstructured":"Donsker, M.D., Varadhan, S.R.S.: Asymptotic evaluation of certain markov process expectations for large time. IV. Commun. Pure Appl. Math. 36(2), 183\u2013212 (1983)","journal-title":"Commun. Pure Appl. Math."},{"key":"19_CR13","unstructured":"Feige, U.: On the success probability of the two provers in one-round proof systems. In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, 30 June\u20133 July 1991, pp. 116\u2013123 (1991)"},{"issue":"4","key":"19_CR14","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 - a negative result. Combinatorica 22(4), 461\u2013478 (2002)","journal-title":"Combinatorica"},{"key":"19_CR15","unstructured":"Fortnow, L., Rompel, J., Sipser, M.: Errata for on the power of multi-prover interactive protocols. In: Proceedings: Fifth Annual Structure in Complexity Theory Conference, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain, 8\u201311 July 1990, pp. 318\u2013319 (1990)"},{"key":"19_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12521-2","volume-title":"Modern Cryptography Probabilistic Proofs and Pseudorandomness","author":"O Goldreich","year":"1999","unstructured":"Goldreich, O.: Modern Cryptography Probabilistic Proofs and Pseudorandomness. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-12521-2"},{"issue":"6","key":"19_CR17","doi-asserted-by":"publisher","first-page":"2487","DOI":"10.1137\/100810630","volume":"42","author":"I Haitner","year":"2013","unstructured":"Haitner, I.: A parallel repetition theorem for any interactive argument. SIAM J. Comput. 42(6), 2487\u20132501 (2013). https:\/\/doi.org\/10.1137\/100810630","journal-title":"SIAM J. Comput."},{"key":"19_CR18","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. 5978, pp. 1\u201318. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_1"},{"issue":"1","key":"19_CR19","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 Comput. 5(1), 141\u2013172 (2009)","journal-title":"Theory Comput."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Moshkovitz, D.: Parallel repetition from fortification. In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, 18\u201321 October 2014, pp. 414\u2013423 (2014)","DOI":"10.1109\/FOCS.2014.51"},{"key":"19_CR21","unstructured":"Mulzer, W.: Chernoff bounds (2018). https:\/\/page.mi.fu-berlin.de\/mulzer\/notes\/misc\/chernoff.pdf"},{"issue":"4","key":"19_CR22","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/2382559.2382561","volume":"4","author":"R Pass","year":"2012","unstructured":"Pass, R., Venkitasubramaniam, M.: A parallel repetition theorem for constant-round Arthur-Merlin proofs. TOCT 4(4), 10:1\u201310:22 (2012)","journal-title":"TOCT"},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00145-010-9090-x","volume":"25","author":"K Pietrzak","year":"2012","unstructured":"Pietrzak, K., Wikstr\u00f6m, D.: Parallel repetition of computationally sound protocols revisited. J. Cryptol. 25(1), 116\u2013135 (2012). https:\/\/doi.org\/10.1007\/s00145-010-9090-x","journal-title":"J. Cryptol."},{"issue":"6","key":"19_CR24","doi-asserted-by":"publisher","first-page":"1871","DOI":"10.1137\/080734042","volume":"40","author":"A Rao","year":"2011","unstructured":"Rao, A.: Parallel repetition in projection games and a concentration bound. SIAM J. Comput. 40(6), 1871\u20131891 (2011)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"19_CR25","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. 27(3), 763\u2013803 (1998)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-56877-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:08:37Z","timestamp":1691712517000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-56877-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030568764","9783030568771"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-56877-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2020\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"371","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.82","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19.43","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}