{"date_published":"2012-11-01T00:00:00Z","intvolume":"        25","extern":1,"year":"2012","quality_controlled":0,"volume":25,"type":"journal_article","_id":"3241","citation":{"ama":"Pietrzak KZ, Wikström D. Parallel repetition of computationally sound protocols revisited. <i>Journal of Cryptology</i>. 2012;25(1):116-135. doi:<a href=\"https://doi.org/10.1007/s00145-010-9090-x\">10.1007/s00145-010-9090-x</a>","ista":"Pietrzak KZ, Wikström D. 2012. Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. 25(1), 116–135.","ieee":"K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound protocols revisited,” <i>Journal of Cryptology</i>, vol. 25, no. 1. Springer, pp. 116–135, 2012.","mla":"Pietrzak, Krzysztof Z., and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” <i>Journal of Cryptology</i>, vol. 25, no. 1, Springer, 2012, pp. 116–35, doi:<a href=\"https://doi.org/10.1007/s00145-010-9090-x\">10.1007/s00145-010-9090-x</a>.","short":"K.Z. Pietrzak, D. Wikström, Journal of Cryptology 25 (2012) 116–135.","apa":"Pietrzak, K. Z., &#38; Wikström, D. (2012). Parallel repetition of computationally sound protocols revisited. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-010-9090-x\">https://doi.org/10.1007/s00145-010-9090-x</a>","chicago":"Pietrzak, Krzysztof Z, and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” <i>Journal of Cryptology</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00145-010-9090-x\">https://doi.org/10.1007/s00145-010-9090-x</a>."},"publist_id":"3439","abstract":[{"lang":"eng","text":"We prove a negative result concerning error reduction by parallel repetition for computationally sound protocols, e.g., interactive arguments. Our main result is a complete and computationally sound eight round interactive argument for which k-fold parallel repetition does not reduce the error below a constant for any polynomial k. The starting point for our construction is the work of Bellare, Impagliazzo and Naor (FOCS'97). For any fixed k, they construct a four round protocol for which k-fold parallel repetition does not lower the soundness error. The communication complexity of this protocol is linear in k. By using universal arguments due to Barak and Goldreich (CCC 2002), we turn this protocol into an eight-round protocol whose complexity is basically independent of k. "}],"author":[{"last_name":"Pietrzak","full_name":"Krzysztof Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wikström","full_name":"Wikström, Douglas","first_name":"Douglas"}],"issue":"1","date_created":"2018-12-11T12:02:12Z","status":"public","doi":"10.1007/s00145-010-9090-x","page":"116 - 135","publication_status":"published","day":"01","date_updated":"2021-01-12T07:42:03Z","month":"11","publication":"Journal of Cryptology","publisher":"Springer","title":"Parallel repetition of computationally sound protocols revisited"}