{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:09:38Z","timestamp":1765112978850,"version":"3.41.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031070815"},{"type":"electronic","value":"9783031070822"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07082-2_19","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:09:51Z","timestamp":1653696591000},"page":"519-550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Non-malleable Commitments Against Quantum Attacks"],"prefix":"10.1007","author":[{"given":"Nir","family":"Bitansky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huijia","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omri","family":"Shmueli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"key":"19_CR1","unstructured":"Agarwal, A., Bartusek, J., Goyal, V., Khurana, D., Malavolta, G.: Post-quantum multi-party computation in constant rounds. CoRR, abs\/2005.12904 (2020)"},{"key":"19_CR2","first-page":"1323","volume":"2019","author":"P Ananth","year":"2019","unstructured":"Ananth, P., La Placa, R.L.: Secure quantum extraction protocols. IACR Cryptol. ePrint Arch. 2019, 1323 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model, pp. 345\u2013355 (2002)","DOI":"10.1109\/SFCS.2002.1181957"},{"issue":"5","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1137\/070709244","volume":"38","author":"B Barak","year":"2008","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. SIAM J. Comput. 38(5), 1661\u20131694 (2008)","journal-title":"SIAM J. Comput."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-030-03807-6_8","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2018","unstructured":"Bitansky, N., Lin, H.: One-message zero knowledge and non-malleable commitments. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part I. LNCS, vol. 11239, pp. 209\u2013234. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_8"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Shmueli, O.: Post-quantum zero knowledge in constant rounds. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, 22\u201326 June 2020, pp. 269\u2013279. ACM (2020)","DOI":"10.1145\/3357713.3384324"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Chia, N.-H., Chung, K.-M., Liang, X., Yamakawa, T.: Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round. arXiv preprint arXiv:2111.08665 (2021)","DOI":"10.1007\/978-3-031-15982-4_18"},{"key":"19_CR8","unstructured":"Chia, N.-H., Chung, K.-M., Yamakawa, T.: Black-box approach to post-quantum zero-knowledge in constant round. arXiv preprint arXiv:2011.02670 (2020)"},{"issue":"5","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1137\/110847196","volume":"45","author":"R Canetti","year":"2016","unstructured":"Canetti, R., Lin, H., Pass, R.: Adaptive hardness and composable security in the plain model from standard assumptions. SIAM J. Comput. 45(5), 1793\u20131834 (2016)","journal-title":"SIAM J. Comput."},{"key":"19_CR10","unstructured":"Chiesa, A., Ma, F., Spooner, N., Zhandry, M.: Post-quantum succinct arguments. arXiv preprint arXiv:2103.08140 (2021)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-662-53015-3_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Ciampi","year":"2016","unstructured":"Ciampi, M., Ostrovsky, R., Siniscalchi, L., Visconti, I.: Concurrent non-malleable commitments (and more) in 3 rounds. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 270\u2013299. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_10"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Chor, B., Rabin, M.O.: Achieving independence in logarithmic number of rounds. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, 10\u201312 August 1987, pp. 260\u2013268 (1987)","DOI":"10.1145\/41840.41862"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1137\/S0036144503429856","volume":"45","author":"D Dolev","year":"2003","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM Rev. 45(4), 727\u2013784 (2003)","journal-title":"SIAM Rev."},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U Feige","year":"1999","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J. Comput. 29(1), 1\u201328 (1999)","journal-title":"SIAM J. Comput."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"2038","DOI":"10.1103\/PhysRevA.53.2038","volume":"53","author":"CA Fuchs","year":"1996","unstructured":"Fuchs, C.A., Peres, A.: Quantum-state disturbance versus information gain: uncertainty relations for quantum information. Phys. Rev. A 53, 2038\u20132045 (1996)","journal-title":"Phys. Rev. A"},{"key":"19_CR16","unstructured":"Garg, R., Khurana, D., Lu, G., Waters, B.: Black-box non-interactive non-malleable commitments. Cryptology ePrint Archive, Report 2020\/1197 (2020). https:\/\/eprint.iacr.org\/2020\/1197"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Goyal, V., Khurana, D., Sahai, A.: Breaking the three round barrier for non-malleable commitments, pp. 21\u201330 (2016)","DOI":"10.1109\/FOCS.2016.12"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Goyal, V., Lee, C.-K., Ostrovsky, R., Visconti, I.: Constructing non-malleable commitments: a black-box approach, pp. 51\u201360 (2012)","DOI":"10.1109\/FOCS.2012.47"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Goyal, V.: Constant round non-malleable protocols using one way functions, pp. 695\u2013704 (2011)","DOI":"10.1145\/1993636.1993729"},{"key":"19_CR20","unstructured":"Goyal, V., Pandey, O., Richelson, S.: Textbook non-malleable commitments. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 1128\u20131141 (2016)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Goyal, V., Richelson, S.: Non-malleable commitments using Goldreich-Levin list decoding. In: 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, 9\u201312 November 2019, pp. 686\u2013699 (2019)","DOI":"10.1109\/FOCS.2019.00047"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Hallgren, S., Smith, A., Song, F.: Classical cryptographic protocols in a quantum world. Int. J. Quant. Inf. 13(04), 1550028 (2015). Preliminary version appeared in IACR Crypto 2011","DOI":"10.1142\/S0219749915500288"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-70503-3_5","volume-title":"Theory of Cryptography","author":"D Khurana","year":"2017","unstructured":"Khurana, D.: Round optimal concurrent non-malleability from polynomial hardness. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part II. LNCS, vol. 10678, pp. 139\u2013171. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_5"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-030-26954-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"YT Kalai","year":"2019","unstructured":"Kalai, Y.T., Khurana, D.: Non-interactive non-malleability from quantum supremacy. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 552\u2013582. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_18"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Khurana, D., Sahai, A.: How to achieve non-malleability in one or two rounds. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, 15\u201317 October 2017, pp. 564\u2013575 (2017)","DOI":"10.1109\/FOCS.2017.58"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Lombardi, A., Ma, F., Spooner, N.: Post-quantum zero knowledge, revisited (or: How to do quantum rewinding undetectably). arXiv preprint arXiv:2111.12257 (2021)","DOI":"10.1109\/FOCS54457.2022.00086"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-21969-6_2","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"C Lunemann","year":"2011","unstructured":"Lunemann, C., Nielsen, J.B.: Fully simulatable quantum-secure coin-flipping and applications. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol. 6737, pp. 21\u201340. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21969-6_2"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R.: Non-malleability amplification, pp. 189\u2013198 (2009)","DOI":"10.1145\/1536414.1536442"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R.: Constant-round non-malleable commitments from any one-way function, pp. 705\u2013714 (2011)","DOI":"10.1145\/1993636.1993730"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-32009-5_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"H Lin","year":"2012","unstructured":"Lin, H., Pass, R.: Black-box constructions of composable protocols without set-up. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 461\u2013478. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_27"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R., Soni, P.: Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles, pp. 576\u2013587 (2017)","DOI":"10.1109\/FOCS.2017.59"},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-540-78524-8_31","volume-title":"Theory of Cryptography","author":"H Lin","year":"2008","unstructured":"Lin, H., Pass, R., Venkitasubramaniam, M.: Concurrent non-malleable commitments from any one-way function. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 571\u2013588. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_31"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R., Venkitasubramaniam, M.: A unified framework for concurrent security: universal composability from stand-alone non-malleability. In: Mitzenmacher, M. (ed.) Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31\u2013June 2 2009, pp. 179\u2013188. ACM (2009)","DOI":"10.1145\/1536414.1536441"},{"issue":"2","key":"19_CR34","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991). https:\/\/doi.org\/10.1007\/BF00196774","journal-title":"J. Cryptol."},{"key":"19_CR35","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 \u2013 CRYPTO 2008","author":"O Pandey","year":"2008","unstructured":"Pandey, O., Pass, R., Vaikuntanathan, V.: Adaptive one-way functions and applications. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 57\u201374. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_4"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments, pp. 563\u2013572 (2005)","DOI":"10.1109\/SFCS.2005.27"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols, pp. 533\u2013542 (2005)","DOI":"10.1145\/1060590.1060670"},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-642-13190-5_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"R Pass","year":"2010","unstructured":"Pass, R., Wee, H.: Constant-round non-malleable commitments from sub-exponential one-way functions. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 638\u2013655. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_32"},{"key":"19_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-24638-1_11","volume-title":"Theory of Cryptography","author":"A Rosen","year":"2004","unstructured":"Rosen, A.: A note on constant-round zero-knowledge proofs for NP. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 191\u2013202. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_11"},{"key":"19_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-29011-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Unruh","year":"2012","unstructured":"Unruh, D.: Quantum proofs of knowledge. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 135\u2013152. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_10"},{"issue":"1","key":"19_CR41","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/060670997","volume":"39","author":"J Watrous","year":"2009","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. SIAM J. Comput. 39(1), 25\u201358 (2009)","journal-title":"SIAM J. Comput."},{"key":"19_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-14623-7_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"H Wee","year":"2010","unstructured":"Wee, H.: Efficient chosen-ciphertext security via extractable hash proofs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 314\u2013332. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_17"},{"key":"19_CR43","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299, 802\u2013803 (1982)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07082-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:02:45Z","timestamp":1748383365000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07082-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031070815","9783031070822"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07082-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trondheim","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2022\/","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":"372","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":"3","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":"18","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":"Peer review was double-blind with rebuttal.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}