{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:59:58Z","timestamp":1769299198969,"version":"3.49.0"},"publisher-location":"Cham","reference-count":80,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030842512","type":"print"},{"value":"9783030842529","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-84252-9_18","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:04:26Z","timestamp":1628636666000},"page":"535-565","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Non-malleable Codes for Bounded Parallel-Time Tampering"],"prefix":"10.1007","author":[{"given":"Dana","family":"Dachman-Soled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilan","family":"Komargodski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: Optimal computational split-state non-malleable codes. In: TCC, pp. 393\u2013417 (2016)","DOI":"10.1007\/978-3-662-49099-0_15"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dodis, Y., Kazana, T., Obremski, M.: Non-malleable reductions and applications. In: STOC, pp. 459\u2013468 (2015)","DOI":"10.1145\/2746539.2746544"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/140985251","volume":"47","author":"D Aggarwal","year":"2018","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. SIAM J. Comput. 47(2), 524\u2013546 (2018)","journal-title":"SIAM J. Comput."},{"key":"18_CR4","unstructured":"Ball, M.: On Resilience to Computable Tampering. Ph.D. thesis, Columbia University (2021). https:\/\/academiccommons.columbia.edu\/doi\/10.7916\/d8-debr-bw49"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Ball, M., Dachman-Soled, D., Guo, S., Malkin, T., Tan, L.: Non-malleable codes for small-depth circuits. In: FOCS, pp. 826\u2013837 (2018)","DOI":"10.1109\/FOCS.2018.00083"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-030-17653-2_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"M Ball","year":"2019","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Lin, H., Malkin, T.: Non-malleable codes against bounded polynomial time tampering. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 501\u2013530. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_17"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/978-3-662-49896-5_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Ball","year":"2016","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Non-malleable codes for bounded depth, bounded fan-in circuits. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 881\u2013908. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_31"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-319-78372-7_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Ball","year":"2018","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Non-malleable codes from average-case hardness: $${\\sf A\\mathit{}{\\sf C}}^0$$, decision trees, and streaming space-bounded tampering. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 618\u2013650. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_20"},{"key":"18_CR9","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Limits to non-malleability. In: ITCS, pp. 80:1\u201380:32 (2020)"},{"key":"18_CR10","unstructured":"Ball, M., Dachman-Soled, D., Loss, J.: Explicit non-malleable codes for polynomial size circuit tampering. (unpublished manuscript)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-030-26948-7_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"M Ball","year":"2019","unstructured":"Ball, M., Guo, S., Wichs, D.: Non-malleable codes for decision trees. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 413\u2013434. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_15"},{"key":"18_CR12","unstructured":"Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: FOCS, pp. 345\u2013355 (2002)"},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/050641958","volume":"37","author":"B Barak","year":"2007","unstructured":"Barak, B., Ong, S.J., Vadhan, S.P.: Derandomization in cryptography. SIAM J. Comput. 37(2), 380\u2013400 (2007)","journal-title":"SIAM J. Comput."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Barak, B., Pass, R.: On the possibility of one-message weak zero-knowledge. In: TCC, pp. 121\u2013132 (2004)","DOI":"10.1007\/978-3-540-24638-1_7"},{"key":"18_CR15","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: Craft: composable randomness and almost fairness from time. Cryptology ePrint Archive, Report 2020\/784 (2020)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-030-77883-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: TARDIS: a foundation of time-lock puzzles in UC. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 429\u2013459. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_15"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-78375-8_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"I Berman","year":"2018","unstructured":"Berman, I., Degwekar, A., Rothblum, R.D., Vasudevan, P.N.: Multi-collision resistant hash functions and their applications. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 133\u2013161. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_5"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Goldwasser, S., Jain, A., Paneth, O., Vaikuntanathan, V., Waters, B.: Time-lock puzzles from randomized encodings. In: ITCS, pp. 345\u2013356 (2016)","DOI":"10.1145\/2840728.2840745"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Kalai, Y.T., Paneth, O.: Multi-collision resistance: a paradigm for keyless hash functions. In: STOC, pp. 671\u2013684 (2018)","DOI":"10.1145\/3188745.3188870"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Lin, H.: One-message zero knowledge and non-malleable commitments. In: TCC, pp. 209\u2013234 (2018)","DOI":"10.1007\/978-3-030-03807-6_8"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Paneth, O.: Zaps and non-interactive witness indistinguishability from indistinguishability obfuscation. In: TCC, pp. 401\u2013427 (2015)","DOI":"10.1007\/978-3-662-46497-7_16"},{"key":"18_CR22","unstructured":"Chandran, N., Goyal, V., Mukherjee, P., Pandey, O., Upadhyay, J.: Block-wise non-malleable codes. In: ICALP, pp. 31:1\u201331:14 (2016)"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Goyal, V., Li, X.: Non-malleable extractors and codes, with their many tampered extensions. Electron. Colloq. Comput. Complex. (ECCC) 22, 75 (2015)","DOI":"10.1145\/2897518.2897547"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Goyal, V., Li, X.: Non-malleable extractors and codes, with their many tampered extensions. In: STOC, pp. 285\u2013298 (2016)","DOI":"10.1145\/2897518.2897547"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Li, X.: Non-malleable codes and extractors for small-depth circuits, and affine functions. In: STOC, pp. 1171\u20131184 (2017)","DOI":"10.1145\/3055399.3055483"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Zuckerman, D.: Explicit two-source extractors and resilient functions. In: STOC, pp. 670\u2013683 (2016)","DOI":"10.1145\/2897518.2897528"},{"issue":"3","key":"18_CR27","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/TIT.2015.2511784","volume":"62","author":"M Cheraghchi","year":"2016","unstructured":"Cheraghchi, M., Guruswami, V.: Capacity of non-malleable codes. IEEE Trans. Inf. Theory 62(3), 1097\u20131118 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Chung, K., Lin, H., Pass, R.: Constant-round concurrent zero knowledge from P-certificates. In: FOCS, pp. 50\u201359 (2013)","DOI":"10.1109\/FOCS.2013.14"},{"key":"18_CR29","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":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-63715-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"M Ciampi","year":"2017","unstructured":"Ciampi, M., Ostrovsky, R., Siniscalchi, L., Visconti, I.: Four-round concurrent non-malleable commitments from one-way functions. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 127\u2013157. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_5"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Coretti, S., Dodis, Y., Tackmann, B., Venturi, D.: Non-malleable encryption: simpler, shorter, stronger. In: TCC, pp. 306\u2013335 (2016)","DOI":"10.1007\/978-3-662-49096-9_13"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Coretti, S., Maurer, U., Tackmann, B., Venturi, D.: From single-bit to multi-bit public-key encryption via non-malleable codes. In: TCC, pp. 532\u2013560 (2015)","DOI":"10.1007\/978-3-662-46494-6_22"},{"key":"18_CR33","first-page":"776","volume":"2020","author":"D Dachman-Soled","year":"2020","unstructured":"Dachman-Soled, D., Komargodski, I., Pass, R.: Non-malleable codes for bounded polynomial depth tampering. IACR Cryptol. ePrint Arch. 2020, 776 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Dachman-Soled, D., Liu, F., Shi, E., Zhou, H.: Locally decodable and updatable non-malleable codes and their applications. In: TCC, pp. 427\u2013450 (2015)","DOI":"10.1007\/978-3-662-46494-6_18"},{"issue":"153","key":"18_CR35","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1090\/S0025-5718-1981-0595059-1","volume":"36","author":"JD Dixon","year":"1981","unstructured":"Dixon, J.D.: Asymptotically fast factorization of integers. Math. Comput. 36(153), 255\u2013260 (1981)","journal-title":"Math. Comput."},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: STOC, pp. 542\u2013552 (1991)","DOI":"10.1145\/103418.103474"},{"key":"18_CR37","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: ICS, pp. 434\u2013452 (2010)"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. J. ACM 65(4), 20:1\u201320:32 (2018)","DOI":"10.1145\/3178432"},{"key":"18_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-030-45727-3_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"N Ephraim","year":"2020","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: Continuous verifiable delay functions. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 125\u2013154. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_5"},{"key":"18_CR40","first-page":"779","volume":"2020","author":"N Ephraim","year":"2020","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: Non-malleable time-lock puzzles and applications. IACR Cryptol. ePrint Arch. 2020, 779 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"18_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-63715-0_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Faust","year":"2017","unstructured":"Faust, S., Host\u00e1kov\u00e1, K., Mukherjee, P., Venturi, D.: Non-malleable codes for space-bounded tampering. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 95\u2013126. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_4"},{"issue":"12","key":"18_CR42","doi-asserted-by":"publisher","first-page":"7179","DOI":"10.1109\/TIT.2016.2613919","volume":"62","author":"S Faust","year":"2016","unstructured":"Faust, S., Mukherjee, P., Venturi, D., Wichs, D.: Efficient non-malleable codes and key derivation for poly-size tampering circuits. IEEE Trans. Inf. Theory 62(12), 7179\u20137194 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR43","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract). In: FOCS, pp. 308\u2013317 (1990)"},{"key":"18_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"18_CR45","doi-asserted-by":"crossref","unstructured":"Goyal, V.: Constant round non-malleable protocols using one way functions. In: Fortnow, L., Vadhan, S.P. (eds.) STOC, pp. 695\u2013704 (2011)","DOI":"10.1145\/1993636.1993729"},{"key":"18_CR46","doi-asserted-by":"crossref","unstructured":"Goyal, V., Lee, C., Ostrovsky, R., Visconti, I.: Constructing non-malleable commitments: a black-box approach. In: FOCS, pp. 51\u201360 (2012)","DOI":"10.1109\/FOCS.2012.47"},{"key":"18_CR47","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Richelson, S.: Textbook non-malleable commitments. In: STOC, pp. 1128\u20131141 (2016)","DOI":"10.1145\/2897518.2897657"},{"key":"18_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11818175_6","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Non-interactive zaps and new techniques for NIZK. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 97\u2013111. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_6"},{"key":"18_CR49","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":"18_CR50","doi-asserted-by":"crossref","unstructured":"Katz, J., Loss, J., Xu, J.: On the security of time-lock puzzles and timed commitments. In: TCC, pp. 390\u2013413 (2020)","DOI":"10.1007\/978-3-030-64381-2_14"},{"key":"18_CR51","doi-asserted-by":"crossref","unstructured":"Khurana, D.: Round optimal concurrent non-malleability from polynomial hardness. In: TCC, pp. 139\u2013171 (2017)","DOI":"10.1007\/978-3-319-70503-3_5"},{"key":"18_CR52","doi-asserted-by":"crossref","unstructured":"Khurana, D., Sahai, A.: How to achieve non-malleability in one or two rounds. In: FOCS, pp. 564\u2013575 (2017)","DOI":"10.1109\/FOCS.2017.58"},{"key":"18_CR53","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Liu, F., Tselekounis, Y.: Practical non-malleable codes from l-more extractable hash functions. In: CCS, pp. 1317\u20131328 (2016)","DOI":"10.1145\/2976749.2978352"},{"key":"18_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-319-78375-8_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"I Komargodski","year":"2018","unstructured":"Komargodski, I., Naor, M., Yogev, E.: Collision resistant hashing for paranoids: dealing with multiple collisions. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 162\u2013194. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_6"},{"key":"18_CR55","doi-asserted-by":"crossref","unstructured":"Komargodski, I., Naor, M., Yogev, E.: White-box vs. black-box complexity of search problems: ramsey and graph property testing. J. ACM 66(5), 34:1\u201334:28 (2019)","DOI":"10.1145\/3341106"},{"key":"18_CR56","unstructured":"Kulkarni, M.R.: Extending the Applicability of Non-Malleable Codes. Ph.D. thesis, The University of Maryland (2019). https:\/\/drum.lib.umd.edu\/bitstream\/handle\/1903\/25179\/Kulkarni_umd_0117E_20306.pdf?sequence=2"},{"key":"18_CR57","doi-asserted-by":"crossref","unstructured":"Li, X.: Non-malleable extractors, two-source extractors and privacy amplification. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 688\u2013697 (2012)","DOI":"10.1109\/FOCS.2012.26"},{"key":"18_CR58","doi-asserted-by":"crossref","unstructured":"Li, X.: New independent source extractors with exponential improvement. In: STOC, pp. 783\u2013792 (2013)","DOI":"10.1145\/2488608.2488708"},{"key":"18_CR59","doi-asserted-by":"crossref","unstructured":"Li, X.: Improved non-malleable extractors, non-malleable codes and independent source extractors. In: STOC, pp. 1144\u20131156. ACM (2017)","DOI":"10.1145\/3055399.3055486"},{"key":"18_CR60","unstructured":"Li, X.: Non-malleable extractors and non-malleable codes: partially optimal constructions. arXiv preprint arXiv:1804.04005 (2018)"},{"key":"18_CR61","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R.: Non-malleability amplification. In: STOC, pp. 189\u2013198 (2009)","DOI":"10.1145\/1536414.1536442"},{"key":"18_CR62","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R.: Constant-round non-malleable commitments from any one-way function. In: STOC, pp. 705\u2013714 (2011)","DOI":"10.1145\/1993636.1993730"},{"key":"18_CR63","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R., Soni, P.: Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles. In: FOCS, pp. 576\u2013587 (2017)","DOI":"10.1109\/FOCS.2017.59"},{"key":"18_CR64","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R., Venkitasubramaniam, M.: Concurrent non-malleable commitments from any one-way function. In: TCC, pp. 571\u2013588 (2008)","DOI":"10.1007\/978-3-540-78524-8_31"},{"key":"18_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-642-32009-5_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"F-H Liu","year":"2012","unstructured":"Liu, F.-H., Lysyanskaya, A.: Tamper and leakage resilience in the split-state model. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 517\u2013532. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_30"},{"key":"18_CR66","unstructured":"May, T.: Timed-release crypto (1992)"},{"issue":"4","key":"18_CR67","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253\u20131298 (2000)","journal-title":"SIAM J. Comput."},{"key":"18_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-45146-4_6","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"M Naor","year":"2003","unstructured":"Naor, M.: On cryptographic assumptions and challenges. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 96\u2013109. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_6"},{"key":"18_CR69","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC, pp. 427\u2013437 (1990)","DOI":"10.1145\/100216.100273"},{"key":"18_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-319-96878-0_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"R Ostrovsky","year":"2018","unstructured":"Ostrovsky, R., Persiano, G., Venturi, D., Visconti, I.: Continuously non-malleable codes in the split-state model from minimal assumptions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 608\u2013639. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_21"},{"key":"18_CR71","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":"18_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Pass","year":"2003","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 160\u2013176. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_10"},{"key":"18_CR73","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: FOCS, pp. 563\u2013572 (2005)"},{"key":"18_CR74","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: STOC, pp. 533\u2013542 (2005)","DOI":"10.1145\/1060590.1060670"},{"key":"18_CR75","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":"18_CR76","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: ITCS, pp. 60:1\u201360:15 (2019)"},{"key":"18_CR77","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical Report. Massachusetts Institute of Technology, Cambridge, MA, USA (1996)"},{"key":"18_CR78","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V Shoup","year":"2006","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2006)"},{"key":"18_CR79","doi-asserted-by":"crossref","unstructured":"Wee, H.: Black-box, round-efficient secure computation via non-malleability amplification. In: FOCS, pp. 531\u2013540 (2010)","DOI":"10.1109\/FOCS.2010.87"},{"key":"18_CR80","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17659-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Wesolowski","year":"2019","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 379\u2013407. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84252-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:09:55Z","timestamp":1723334995000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84252-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030842512","9783030842529"],"references-count":80,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84252-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 August 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","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":"crypto2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2021\/","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":"426","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":"103","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":"24% - 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":"20.9","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":"1 invited paper is also included.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}