{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:23:08Z","timestamp":1714090988638},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T00:00:00Z","timestamp":1712102400000},"content-version":"vor","delay-in-days":2,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Non-malleable codes were introduced by Dziembowski et al. (in: Yao (ed) ICS2010, Tsinghua University Press, 2010), and its main application is the protection of cryptographic devices against tampering attacks on memory. In this work, we initiate a comprehensive study on non-malleable codes for the class of partial functions, that read\/write on an arbitrary subset of codeword bits with specific cardinality. We present two constructions: the first one is in the CRS model and allows the adversary to selectively choose the subset of codeword bits, while the latter is in the standard model and adaptively secure. Our constructions are efficient in terms of information rate, while allowing the attacker to access asymptotically almost the entire codeword. In addition, they satisfy a notion which is stronger than non-malleability, that we call non-malleability with manipulation detection, guaranteeing that any modified codeword decodes to either the original message or to <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\bot $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u22a5<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We show that our primitive implies All-Or-Nothing Transforms (AONTs), and as a result our constructions yield efficient AONTs under standard assumptions (only one-way functions), which, to the best of our knowledge, was an open question until now. Furthermore, we construct a notion of continuous non-malleable codes (CNMC), namely CNMC with light updates, that avoids the full re-encoding process and only uses shuffling and refreshing operations. Finally, we present a number of additional applications of our primitive in tamper resilience.<\/jats:p>","DOI":"10.1007\/s00145-024-09498-2","type":"journal-article","created":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T23:03:11Z","timestamp":1712185391000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["(Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates"],"prefix":"10.1007","volume":"37","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng-Hao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiannis","family":"Tselekounis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,3]]},"reference":[{"key":"9498_CR1","doi-asserted-by":"crossref","unstructured":"D.\u00a0Aggarwal, S.\u00a0Agrawal, D.\u00a0Gupta, H.K. Maji, O.\u00a0Pandey, M.\u00a0Prabhakaran, Optimal computational split-state non-malleable codes, in E.\u00a0Kushilevitz, T.\u00a0Malkin, editors, TCC\u00a02016-A: 13th Theory of Cryptography Conference, Part\u00a0II. Lecture Notes in Computer Science, vol. 9563 (Springer, Heidelberg, 2016), pp. 393\u2013417, Tel Aviv, Israel, Jan.\u00a010\u201313, 2016","DOI":"10.1007\/978-3-662-49099-0_15"},{"key":"9498_CR2","doi-asserted-by":"crossref","unstructured":"D.\u00a0Aggarwal, Y.\u00a0Dodis, T.\u00a0Kazana, M.\u00a0Obremski, Non-malleable reductions and applications, in R.A. Servedio, R.\u00a0Rubinfeld, editors, 47th Annual ACM Symposium on Theory of Computing (ACM Press, Portland, 2015), pp. 459\u2013468","DOI":"10.1145\/2746539.2746544"},{"key":"9498_CR3","doi-asserted-by":"crossref","unstructured":"D.\u00a0Aggarwal, Y.\u00a0Dodis, S.\u00a0Lovett. Non-malleable codes from additive combinatorics, in D.B. Shmoys, editor, 46th Annual ACM Symposium on Theory of Computing (ACM Press, New York, 2014), pp. 774\u2013783","DOI":"10.1145\/2591796.2591804"},{"key":"9498_CR4","doi-asserted-by":"crossref","unstructured":"S.\u00a0Agrawal, D.\u00a0Gupta, H.K. Maji, O.\u00a0Pandey, M.\u00a0Prabhakaran, Explicit non-malleable codes against bit-wise tampering and permutations, in R.\u00a0Gennaro, M.J.B. Robshaw, editors, Advances in Cryptology\u2014CRYPTO\u00a02015, Part\u00a0I. Lecture Notes in Computer Science, vol. 9215, Santa Barbara, CA, USA, Aug.\u00a016\u201320, 2015 (Springer, Heidelberg, 2015), pp. 538\u2013557","DOI":"10.1007\/978-3-662-47989-6_26"},{"key":"9498_CR5","doi-asserted-by":"crossref","unstructured":"S.\u00a0Agrawal, D.\u00a0Gupta, H.K. Maji, O.\u00a0Pandey, M.\u00a0Prabhakaran, A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations, in Y.\u00a0Dodis, J.B. Nielsen, editors, TCC\u00a02015: 12th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 9014, Warsaw, Poland, Mar.\u00a023\u201325, 2015 (Springer, Heidelberg, 2015), pp. 375\u2013397","DOI":"10.1007\/978-3-662-46494-6_16"},{"key":"9498_CR6","doi-asserted-by":"crossref","unstructured":"J.\u00a0Alwen, S.\u00a0Coretti, Y.\u00a0Dodis, Y.\u00a0Tselekounis, Security analysis and improvements for the IETF MLS standard for group messaging, in D.\u00a0Micciancio, T.\u00a0Ristenpart, editors, Advances in Cryptology\u2014CRYPTO 2020 (Springer, Cham, 2020), pp. 248\u2013277","DOI":"10.1007\/978-3-030-56784-2_9"},{"key":"9498_CR7","doi-asserted-by":"crossref","unstructured":"J.\u00a0Alwen, S.\u00a0Coretti, Y.\u00a0Dodis, Y.\u00a0Tselekounis, Modular design of secure group messaging protocols and the security of MLS, in Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201921 (Association for Computing Machinery, New York, 2021), pp. 1463\u20131483","DOI":"10.1145\/3460120.3484820"},{"key":"9498_CR8","doi-asserted-by":"crossref","unstructured":"J.\u00a0Alwen, M.\u00a0Mularczyk, Y.\u00a0Tselekounis, Fork-resilient continuous group key agreement, in H.\u00a0Handschuh, A.\u00a0Lysyanskaya, editors, Advances in Cryptology\u2014CRYPTO 2023 (Springer, Cham, 2023), pp. 396\u2013429","DOI":"10.1007\/978-3-031-38551-3_13"},{"key":"9498_CR9","unstructured":"G.\u00a0Ateniese, A.\u00a0Kiayias, B.\u00a0Magri, Y.\u00a0Tselekounis, D.\u00a0Venturi, Secure outsourcing of circuit manufacturing. Cryptology ePrint Archive, Paper 2016\/527, 2016. https:\/\/eprint.iacr.org\/2016\/527"},{"key":"9498_CR10","doi-asserted-by":"crossref","unstructured":"G.\u00a0Ateniese, A.\u00a0Kiayias, B.\u00a0Magri, Y.\u00a0Tselekounis, D.\u00a0Venturi, Secure outsourcing of cryptographic circuits manufacturing, in J.\u00a0Baek, W.\u00a0Susilo, J.\u00a0Kim, editors, Provable Security (Springer, Cham, 2018), pp. 75\u201393","DOI":"10.1007\/978-3-030-01446-9_5"},{"key":"9498_CR11","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ball, E.\u00a0Chattopadhyay, J.-J. Liao, T.\u00a0Malkin, L.-Y. Tan, Non-malleability against polynomial tampering, in D.\u00a0Micciancio, T.\u00a0Ristenpart, editors, Advances in Cryptology\u2014CRYPTO\u00a02020, Part\u00a0III. Lecture Notes in Computer Science, vol. 12172, Santa Barbara, CA, USA, Aug.\u00a017\u201321, 2020 (Springer, Heidelberg, 2020), pp. 97\u2013126","DOI":"10.1007\/978-3-030-56877-1_4"},{"key":"9498_CR12","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ball, D.\u00a0Dachman-Soled, S.\u00a0Guo, T.\u00a0Malkin, L.-Y. Tan, Non-malleable codes for small-depth circuits, in M.\u00a0Thorup, editor, 59th Annual Symposium on Foundations of Computer Science, Paris, France, Oct.\u00a07\u20139, 2018 (IEEE Computer Society Press, 2018), pp. 826\u2013837","DOI":"10.1109\/FOCS.2018.00083"},{"key":"9498_CR13","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ball, D.\u00a0Dachman-Soled, M.\u00a0Kulkarni, H.\u00a0Lin, T.\u00a0Malkin, Non-malleable codes against bounded polynomial time tampering, in Y.\u00a0Ishai, V.\u00a0Rijmen, editors, Advances in Cryptology \u2013 EUROCRYPT\u00a02019, Part\u00a0I. Lecture Notes in Computer Science, vol. 11476, Darmstadt, Germany, May\u00a019\u201323, 2019 (Springer, Heidelberg, 2019), pp. 501\u2013530","DOI":"10.1007\/978-3-030-17653-2_17"},{"key":"9498_CR14","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ball, D.\u00a0Dachman-Soled, M.\u00a0Kulkarni, T.\u00a0Malkin, Non-malleable codes for bounded depth, bounded fan-in circuits, in M.\u00a0Fischlin, J.-S. Coron, editors, Advances in Cryptology\u2014EUROCRYPT\u00a02016, Part\u00a0II. Lecture Notes in Computer Science, vol. 9666, Vienna, Austria, May\u00a08\u201312, 2016 (Springer, Heidelberg, 2016), pp. 881\u2013908","DOI":"10.1007\/978-3-662-49896-5_31"},{"key":"9498_CR15","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ball, D.\u00a0Dachman-Soled, M.\u00a0Kulkarni, T.\u00a0Malkin, Non-malleable codes from average-case hardness: $${\\sf AC}^0$$, decision trees, and streaming space-bounded tampering, in J.B. Nielsen, V.\u00a0Rijmen, editors, Advances in Cryptology\u2014EUROCRYPT\u00a02018, Part\u00a0III. Lecture Notes in Computer Science, vol. 10822, Tel Aviv, Israel, Apr.\u00a029\u00a0\u2013\u00a0May\u00a03, 2018 (Springer, Heidelberg, 2018), pp. 618\u2013650","DOI":"10.1007\/978-3-319-78372-7_20"},{"key":"9498_CR16","doi-asserted-by":"crossref","unstructured":"F.\u00a0Bao, R.H. Deng, Y.\u00a0Han, A.\u00a0Jeng, A.D. Narasimhalu, T.\u00a0Ngair, Breaking Public Key Cryptosystems on Tamper Resistant Devices in the Presence of Transient Faults (Springer, Berlin, 1998), pp. 115\u2013124","DOI":"10.1007\/BFb0028164"},{"key":"9498_CR17","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, S.\u00a0Tessaro, A.\u00a0Vardy. Semantic security for the wiretap channel, in R.\u00a0Safavi-Naini, R.\u00a0Canetti, editors, Advances in Cryptology\u2014CRYPTO\u00a02012. Lecture Notes in Computer Science, vol. 7417, Santa Barbara, CA, USA, Aug.\u00a019\u201323, 2012 (Springer, Heidelberg, 2012), pp. 294\u2013311","DOI":"10.1007\/978-3-642-32009-5_18"},{"key":"9498_CR18","doi-asserted-by":"crossref","unstructured":"P.\u00a0Bhatotia, M.\u00a0Kohlweiss, L.\u00a0Martinico, Y.\u00a0Tselekounis, Steel: composable hardware-based stateful and randomised functional encryption, in J.A. Garay, editor, Public-Key Cryptography\u2014PKC 2021 (Springer, Cham, 2021), pp. 709\u2013736","DOI":"10.1007\/978-3-030-75248-4_25"},{"key":"9498_CR19","doi-asserted-by":"crossref","unstructured":"E.\u00a0Biham, A.\u00a0Shamir, Differential fault analysis of secret key cryptosystems, in B.S. Kaliski Jr., editor, Advances in Cryptology\u2014CRYPTO\u201997. Lecture Notes in Computer Science, vol. 1294, Santa Barbara, CA, USA, Aug.\u00a017\u201321, 1997 (Springer, Heidelberg, 1997), pp. 513\u2013525","DOI":"10.1007\/BFb0052259"},{"key":"9498_CR20","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, R.A. DeMillo, R.J. Lipton, On the importance of checking cryptographic protocols for faults (extended abstract), in W.\u00a0Fumy, editor, Advances in Cryptology\u2014EUROCRYPT\u201997. Lecture Notes in Computer Science, vol. 1233, Konstanz, Germany, May\u00a011\u201315, 1997 (Springer, Heidelberg, 1997), pp. 37\u201351","DOI":"10.1007\/3-540-69053-0_4"},{"key":"9498_CR21","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, R.A. DeMillo, R.J. Lipton, On the importance of eliminating errors in cryptographic computations. J. Cryptol. 14(2), 101\u2013119 (2001)","DOI":"10.1007\/s001450010016"},{"key":"9498_CR22","doi-asserted-by":"crossref","unstructured":"V.\u00a0Boyko, On the security properties of OAEP as an all-or-nothing transform, in M.J. Wiener, editor, Advances in Cryptology\u2014CRYPTO\u201999. Lecture Notes in Computer Science, vol. 1666, Santa Barbara, CA, USA, Aug.\u00a015\u201319, 1999 (Springer, Heidelberg, 1999), pp. 503\u2013518","DOI":"10.1007\/3-540-48405-1_32"},{"key":"9498_CR23","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, Y.\u00a0Dodis, S.\u00a0Halevi, E.\u00a0Kushilevitz, A.\u00a0Sahai, Exposure-resilient functions and all-or-nothing transforms, in B.\u00a0Preneel, editor, Advances in Cryptology\u2014EUROCRYPT\u00a02000. Lecture Notes in Computer Science, vol. 1807, Bruges, Belgium, May\u00a014\u201318, 2000 (Springer, Heidelberg, 2000), pp. 453\u2013469","DOI":"10.1007\/3-540-45539-6_33"},{"key":"9498_CR24","unstructured":"N.\u00a0Chandran, V.\u00a0Goyal, P.\u00a0Mukherjee, O.\u00a0Pandey, J.\u00a0Upadhyay, Block-wise non-malleable codes, in I.\u00a0Chatzigiannakis, M.\u00a0Mitzenmacher, Y.\u00a0Rabani, D.\u00a0Sangiorgi, editors, ICALP 2016: 43rd International Colloquium on Automata, Languages and Programming. LIPIcs, vol.\u00a055, Rome, Italy, July\u00a011\u201315, 2016 (Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016), pp. 31:1\u201331:14"},{"key":"9498_CR25","doi-asserted-by":"crossref","unstructured":"N.\u00a0Chandran, B.\u00a0Kanukurthi, S.\u00a0Raghuraman, Information-theoretic local non-malleable codes and their applications, in E.\u00a0Kushilevitz, T.\u00a0Malkin, editors, TCC\u00a02016-A: 13th Theory of Cryptography Conference, Part\u00a0II. Lecture Notes in Computer Science, vol. 9563, Tel Aviv, Israel, Jan.\u00a010\u201313, 2016 (Springer, Heidelberg, 2016), pp. 367\u2013392.","DOI":"10.1007\/978-3-662-49099-0_14"},{"key":"9498_CR26","doi-asserted-by":"crossref","unstructured":"E.\u00a0Chattopadhyay, D.\u00a0Zuckerman, Non-malleable codes against constant split-state tampering, in 55th Annual Symposium on Foundations of Computer Science, Philadelphia, PA, USA, Oct.\u00a018\u201321, 2014 (IEEE Computer Society Press, 2014), pp. 306\u2013315","DOI":"10.1109\/FOCS.2014.40"},{"key":"9498_CR27","doi-asserted-by":"crossref","unstructured":"M.\u00a0Cheraghchi, V.\u00a0Guruswami, Capacity of non-malleable codes, in M.\u00a0Naor, editor, ITCS 2014: 5th Conference on Innovations in Theoretical Computer Science, Princeton, NJ, USA, Jan.\u00a012\u201314, 2014 (Association for Computing Machinery, 2014), pp. 155\u2013168","DOI":"10.1145\/2554797.2554814"},{"key":"9498_CR28","doi-asserted-by":"crossref","unstructured":"S.G. Choi, A.\u00a0Kiayias, T.\u00a0Malkin, BiTR: built-in tamper resilience, in D.H. Lee, X.\u00a0Wang, editors, Advances in Cryptology\u2014ASIACRYPT\u00a02011. Lecture Notes in Computer Science, vol. 7073, Seoul, South Korea, Dec.\u00a04\u20138, 2011 (Springer, Heidelberg, 2011), pp. 740\u2013758","DOI":"10.1007\/978-3-642-25385-0_40"},{"key":"9498_CR29","doi-asserted-by":"crossref","unstructured":"S.\u00a0Coretti, U.\u00a0Maurer, B.\u00a0Tackmann, D.\u00a0Venturi, From single-bit to multi-bit public-key encryption via non-malleable codes, in Y.\u00a0Dodis, J.B. Nielsen, editors, TCC\u00a02015: 12th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 9014, Warsaw, Poland, Mar.\u00a023\u201325, 2015 (Springer, Heidelberg, 2015), pp. 532\u2013560.","DOI":"10.1007\/978-3-662-46494-6_22"},{"key":"9498_CR30","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cramer, Y.\u00a0Dodis, S.\u00a0Fehr, C.\u00a0Padr\u00f3, D.\u00a0Wichs, Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In N.\u00a0P. Smart, editor, Advances in Cryptology\u2014EUROCRYPT\u00a02008. Lecture Notes in Computer Science, vol. 4965, Istanbul, Turkey, Apr.\u00a013\u201317, 2008 (Springer, Heidelberg, 2008), pp. 471\u2013488","DOI":"10.1007\/978-3-540-78967-3_27"},{"key":"9498_CR31","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dachman-Soled, Y.T. Kalai, Securing circuits against constant-rate tampering, in Proceedings of the 32Nd Annual Cryptology Conference on Advances in Cryptology\u2014CRYPTO 2012 vol. 7417 (2012), pp. 533\u2013551","DOI":"10.1007\/978-3-642-32009-5_31"},{"key":"9498_CR32","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dachman-Soled, Y.T. Kalai, Securing circuits and protocols against 1\/poly(k) tampering rate, in Y.\u00a0Lindell, editor, Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24\u201326, 2014. Proceedings (2014)","DOI":"10.1007\/978-3-642-54242-8_23"},{"key":"9498_CR33","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dachman-Soled, I.\u00a0Komargodski, R.\u00a0Pass, Non-malleable codes for bounded parallel-time tampering, in T.\u00a0Malkin, C.\u00a0Peikert, editors, Advances in Cryptology\u2014CRYPTO\u00a02021, Part\u00a0III. Lecture Notes in Computer Science, vol. 12827, Virtual Event, Aug.\u00a016\u201320, 2021 (Springer, Heidelberg, 2021), pp. 535\u2013565","DOI":"10.1007\/978-3-030-84252-9_18"},{"key":"9498_CR34","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dachman-Soled, M.\u00a0Kulkarni, A.\u00a0Shahverdi, Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes, in S.\u00a0Fehr, editor, PKC\u00a02017: 20th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0I. Lecture Notes in Computer Science, vol. 10174, Amsterdam, The Netherlands, Mar.\u00a028\u201331, 2017 (Springer, Heidelberg, 2017), pp. 310\u2013332","DOI":"10.1007\/978-3-662-54365-8_13"},{"key":"9498_CR35","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dachman-Soled, M.\u00a0Kulkarni, A.\u00a0Shahverdi, Local non-malleable codes in the bounded retrieval model, in M.\u00a0Abdalla, R.\u00a0Dahab, editors, PKC\u00a02018: 21st International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II. Lecture Notes in Computer Science, vol. 10770, Rio de Janeiro, Brazil, Mar.\u00a025\u201329, 2018 (Springer, Heidelberg, 2018), pp. 281\u2013311","DOI":"10.1007\/978-3-319-76581-5_10"},{"key":"9498_CR36","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dachman-Soled, F.-H. Liu, E.\u00a0Shi, H.-S. Zhou, Locally decodable and updatable non-malleable codes and their applications, in In Y.\u00a0Dodis, J.B. Nielsen, editors, TCC\u00a02015: 12th Theory of Cryptography Conference, Part\u00a0I, Lecture Notes in Computer Science, vol. 9014, Warsaw, Poland, Mar.\u00a023\u201325, 2015 (Springer, Heidelberg, 2015), pp. 427\u2013450","DOI":"10.1007\/978-3-662-46494-6_18"},{"key":"9498_CR37","unstructured":"N.\u00a0D\u00f6ttling, J.B. Nielsen, M.\u00a0Obremski, Information theoretic continuously non-malleable codes in the constant split-state model. Cryptology ePrint Archive, Report 2017\/357, 2017. https:\/\/eprint.iacr.org\/2017\/357"},{"key":"9498_CR38","doi-asserted-by":"crossref","unstructured":"S.\u00a0Dziembowski, T.\u00a0Kazana, M.\u00a0Obremski, Non-malleable codes from two-source extractors, in R.\u00a0Canetti, J.A. Garay, editors, Advances in Cryptology\u2014CRYPTO\u00a02013, Part\u00a0II. Lecture Notes in Computer Science, vol. 8043, Santa Barbara, CA, USA, Aug.\u00a018\u201322, 2013 (Springer, Heidelberg, 2013), pp. 239\u2013257","DOI":"10.1007\/978-3-642-40084-1_14"},{"key":"9498_CR39","unstructured":"S.\u00a0Dziembowski, K.\u00a0Pietrzak, D.\u00a0Wichs, Non-malleable codes, in A.C.C. Yao, editor, ICS 2010: 1st Innovations in Computer Science, Tsinghua University, Beijing, China, Jan.\u00a05\u20137, 2010 (Tsinghua University Press, 2010), pp. 434\u2013452"},{"key":"9498_CR40","unstructured":"N.\u00a0Ephraim, C.\u00a0Freitag, I.\u00a0Komargodski, R.\u00a0Pass, Non-malleable time-lock puzzles and applications. Cryptology ePrint Archive, Report 2020\/779, 2020. https:\/\/eprint.iacr.org\/2020\/779"},{"key":"9498_CR41","doi-asserted-by":"crossref","unstructured":"A.\u00a0Faonio, J.B. Nielsen, Non-malleable codes with split-state refresh, in S.\u00a0Fehr, editor, PKC\u00a02017: 20th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0I, Lecture Notes in Computer Science, vol. 10174, Amsterdam, The Netherlands, Mar.\u00a028\u201331, 2017 (Springer, Heidelberg, 2017), pp. 279\u2013309","DOI":"10.1007\/978-3-662-54365-8_12"},{"key":"9498_CR42","doi-asserted-by":"crossref","unstructured":"S.\u00a0Faust, K.\u00a0Host\u00e1kov\u00e1, P.\u00a0Mukherjee, D.\u00a0Venturi, Non-malleable codes for space-bounded tampering, J.\u00a0Katz, H.\u00a0Shacham, editors, Advances in Cryptology\u2014CRYPTO\u00a02017, Part\u00a0II. Lecture Notes in Computer Science, vol. 10402, Santa Barbara, CA, USA, Aug.\u00a020\u201324, 2017 (Springer, Heidelberg, 2017), pp. 95\u2013126","DOI":"10.1007\/978-3-319-63715-0_4"},{"key":"9498_CR43","doi-asserted-by":"crossref","unstructured":"S.\u00a0Faust, P.\u00a0Mukherjee, J.B. Nielsen, D.\u00a0Venturi, Continuous non-malleable codes, in Y.\u00a0Lindell, editor, TCC\u00a02014: 11th Theory of Cryptography Conference. Lecture Notes in Computer Science, vol. 8349, San Diego, CA, USA, Feb.\u00a024\u201326, 2014 (Springer, Heidelberg, 2014), pp. 465\u2013488","DOI":"10.1007\/978-3-642-54242-8_20"},{"key":"9498_CR44","doi-asserted-by":"crossref","unstructured":"S.\u00a0Faust, P.\u00a0Mukherjee, J.B. Nielsen, D.\u00a0Venturi, A tamper and leakage resilient von neumann architecture, in J.\u00a0Katz, editor, PKC\u00a02015: 18th International Conference on Theory and Practice of Public Key Cryptography. Lecture Notes in Computer Science, vol. 9020, Gaithersburg, MD, USA, Mar.\u00a030\u00a0\u2013\u00a0Apr.\u00a01, 2015 (Springer, Heidelberg, 2015), pp. 579\u2013603","DOI":"10.1007\/978-3-662-46447-2_26"},{"key":"9498_CR45","doi-asserted-by":"crossref","unstructured":"S.\u00a0Faust, P.\u00a0Mukherjee, D.\u00a0Venturi, D.\u00a0Wichs, Efficient non-malleable codes and key-derivation for poly-size tampering circuits, in P.Q. Nguyen, E.\u00a0Oswald, editors, Advances in Cryptology\u2014EUROCRYPT\u00a02014. Lecture Notes in Computer Science, vol. 8441, Copenhagen, Denmark, May\u00a011\u201315, 2014 (Springer, Heidelberg, 2014), pp. 111\u2013128","DOI":"10.1007\/978-3-642-55220-5_7"},{"key":"9498_CR46","doi-asserted-by":"crossref","unstructured":"S.\u00a0Faust, K.\u00a0Pietrzak, D.\u00a0Venturi, Tamper-proof circuits: How to trade leakage for tamper-resilience, in Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I (2011), pp. 391\u2013402","DOI":"10.1007\/978-3-642-22006-7_33"},{"key":"9498_CR47","doi-asserted-by":"crossref","unstructured":"D.\u00a0Genkin, Y.\u00a0Ishai, M.\u00a0Prabhakaran, A.\u00a0Sahai, E.\u00a0Tromer, Circuits resilient to additive attacks with applications to secure computation, in D.B. Shmoys, editor, 46th Annual ACM Symposium on Theory of Computing, New York, NY, USA, May\u00a031\u2013June\u00a03, 2014 (ACM Press, 2014), pp. 495\u2013504","DOI":"10.1145\/2591796.2591861"},{"key":"9498_CR48","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Ishai, M.\u00a0Prabhakaran, A.\u00a0Sahai, D.\u00a0Wagner, Private circuits ii: keeping secrets in tamperable circuits, in Advances in Cryptology\u2014EUROCRYPT 2006, St. Petersburg, Russia, May 28 - June 1, 2006. Proceedings (Springer, Berlin, 2006), pp. 495\u2013504","DOI":"10.1007\/11761679_19"},{"key":"9498_CR49","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Jafargholi, D.\u00a0Wichs, Tamper detection and continuous non-malleable codes, in Y.\u00a0Dodis, J.B. Nielsen, editors, TCC\u00a02015: 12th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 9014, Warsaw, Poland, Mar.\u00a023\u201325, 2015 (Springer, Heidelberg, 2015), pp. 451\u2013480","DOI":"10.1007\/978-3-662-46494-6_19"},{"key":"9498_CR50","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz, Y.\u00a0Lindell, Introduction to Modern Cryptography, 2nd edition (Chapman & Hall\/CRC, 2014).","DOI":"10.1201\/b17668"},{"key":"9498_CR51","doi-asserted-by":"crossref","unstructured":"A.\u00a0Kiayias, F.-H. Liu, Y.\u00a0Tselekounis, Practical non-malleable codes from l-more extractable hash functions, in E.R. Weippl, S.\u00a0Katzenbeisser, C.\u00a0Kruegel, A.C. Myers, S.\u00a0Halevi, editors, ACM CCS 2016: 23rd Conference on Computer and Communications Security, Vienna, Austria, Oct.\u00a024\u201328, 2016 (ACM Press, 2016), pp. 1317\u20131328","DOI":"10.1145\/2976749.2978352"},{"key":"9498_CR52","doi-asserted-by":"crossref","unstructured":"A.\u00a0Kiayias, F.-H. Liu, Y.\u00a0Tselekounis, Non-malleable codes for partial functions with manipulation detection, in H.\u00a0Shacham, A.\u00a0Boldyreva, editors, Advances in Cryptology\u2014CRYPTO 2018 (Springer, Cham , 2018), pp. 577\u2013607","DOI":"10.1007\/978-3-319-96878-0_20"},{"key":"9498_CR53","unstructured":"A.\u00a0Kiayias, F.-H. Liu, Y.\u00a0Tselekounis, Leakage resilient l-more extractable hash and applications to non-malleable cryptography. Cryptology ePrint Archive (2022)"},{"key":"9498_CR54","doi-asserted-by":"crossref","unstructured":"A.\u00a0Kiayias, Y.\u00a0Tselekounis, Tamper resilient circuits: the adversary at the gates, in K.\u00a0Sako, P.\u00a0Sarkar, editors, Advances in Cryptology\u2014ASIACRYPT 2013 (Springer, Berlin, 2013), pp. 161\u2013180","DOI":"10.1007\/978-3-642-42045-0_9"},{"key":"9498_CR55","doi-asserted-by":"crossref","unstructured":"F.-H. Liu, A.\u00a0Lysyanskaya, Tamper and leakage resilience in the split-state model, in R.\u00a0Safavi-Naini, R.\u00a0Canetti, editors, Advances in Cryptology\u2014CRYPTO\u00a02012. Lecture Notes in Computer Science, vol. 7417, Santa Barbara, CA, USA, Aug.\u00a019\u201323, 2012 (Springer, Heidelberg, 2012), pp. 517\u2013532","DOI":"10.1007\/978-3-642-32009-5_30"},{"key":"9498_CR56","doi-asserted-by":"crossref","unstructured":"S.\u00a0Micali, L.\u00a0Reyzin, Physically observable cryptography (extended abstract), in M.\u00a0Naor, editor, TCC\u00a02004: 1st Theory of Cryptography Conference. Lecture Notes in Computer Science, vol. 2951, Cambridge, MA, USA, Feb.\u00a019\u201321, 2004 (Springer, Heidelberg, 2004), pp. 278\u2013296","DOI":"10.1007\/978-3-540-24638-1_16"},{"key":"9498_CR57","unstructured":"L.H. Ozarow, A.D. Wyner, Wire-tap channel ii. AT T Bell Lab. Tech. J."},{"key":"9498_CR58","doi-asserted-by":"crossref","unstructured":"T.\u00a0Rabin, M.\u00a0Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority (extended abstract), in 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May\u00a015\u201317, 1989 (ACM Press, 1989), pp. 73\u201385","DOI":"10.1145\/73007.73014"},{"key":"9498_CR59","unstructured":"J.K. Resch, J.S. Plank, AONT-RS: blending security and performance in dispersed storage systems, in FAST\u201911 (2011)"},{"key":"9498_CR60","doi-asserted-by":"crossref","unstructured":"R.L. Rivest, All-or-nothing encryption and the package transform, in E.\u00a0Biham, editor, Fast Software Encryption\u2014FSE\u201997. Lecture Notes in Computer Science, vol. 1267, Haifa, Israel, Jan.\u00a020\u201322, 1997 (Springer, Heidelberg, 1997), pp. 210\u2013218","DOI":"10.1007\/BFb0052348"},{"key":"9498_CR61","unstructured":"R.\u00a0Shaltiel, J.\u00a0Silbak, Explicit list-decodable codes with optimal rate for computationally bounded channels, in APPROX\/RANDOM 2016 (2016)"},{"key":"9498_CR62","doi-asserted-by":"crossref","unstructured":"D.R. Stinson, Something about all or nothing (transforms). Designs Codes Cryptogr. 22(2), 133\u2013138 (2001)","DOI":"10.1023\/A:1008304703074"},{"key":"9498_CR63","doi-asserted-by":"crossref","unstructured":"M.\u00a0Tunstall, D.\u00a0Mukhopadhyay, S.\u00a0Ali, Differential Fault Analysis of the Advanced Encryption Standard Using a Single Fault (Springer, Berlin, 2011), pp. 224\u2013233","DOI":"10.1007\/978-3-642-21040-2_15"},{"key":"9498_CR64","doi-asserted-by":"crossref","unstructured":"A.D. Wyner, The wire-tap channel. Bell Syst. Tech. J. (1975)","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09498-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-024-09498-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09498-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T21:03:16Z","timestamp":1714078996000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-024-09498-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["9498"],"URL":"https:\/\/doi.org\/10.1007\/s00145-024-09498-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]},"assertion":[{"value":"4 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"17"}}