{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T16:20:22Z","timestamp":1768926022426,"version":"3.49.0"},"reference-count":88,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T00:00:00Z","timestamp":1595548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T00:00:00Z","timestamp":1595548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e0 degli Studi di Roma La Sapienza"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2020,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Non-malleable codes (Dziembowski et al., ICS\u201910 and J. ACM\u201918) are a natural relaxation of error correcting\/detecting codes with useful applications in cryptography. Informally, a code is non-malleable if an adversary trying to tamper with an encoding of a message can only leave it unchanged or modify it to the encoding of an unrelated value. This paper introduces <jats:italic>continuous<\/jats:italic> non-malleability, a generalization of standard non-malleability where the adversary is allowed to tamper <jats:italic>continuously<\/jats:italic> with the same encoding. This is in contrast to the standard definition of non-malleable codes, where the adversary can only tamper a <jats:italic>single<\/jats:italic> time. The only restriction is that after the first invalid codeword is ever generated, a special self-destruct mechanism is triggered and no further tampering is allowed; this restriction can easily be shown to be necessary. We focus on the split-state model, where an encoding consists of two parts and the tampering functions can be arbitrary as long as they act independently on each part. Our main contributions are outlined below.<jats:list list-type=\"bullet\">\n<jats:list-item>\n<jats:p>We show that continuous non-malleability in the split-state model is impossible without relying on computational assumptions.<\/jats:p>\n<\/jats:list-item>\n<jats:list-item>\n<jats:p>We construct a computationally secure split-state code satisfying continuous non-malleability in the common reference string (CRS) model. Our scheme can be instantiated assuming the existence of collision-resistant hash functions and (doubly enhanced) trapdoor permutations, but we also give concrete instantiations based on standard number-theoretic assumptions.<\/jats:p>\n<\/jats:list-item>\n<jats:list-item>\n<jats:p>We revisit the application of non-malleable codes to protecting arbitrary cryptographic primitives against related-key attacks. Previous applications of non-malleable codes in this setting required <jats:italic>perfect erasures<\/jats:italic> and the adversary to be restricted in memory. We show that continuously non-malleable codes allow to avoid these restrictions.<\/jats:p>\n<\/jats:list-item>\n<\/jats:list><\/jats:p>","DOI":"10.1007\/s00145-020-09362-z","type":"journal-article","created":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T21:02:28Z","timestamp":1595624548000},"page":"2034-2077","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Continuously Non-malleable Codes in the Split-State Model"],"prefix":"10.1007","volume":"33","author":[{"given":"Sebastian","family":"Faust","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratyay","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Venturi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,24]]},"reference":[{"issue":"2","key":"9362_CR1","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.ipl.2014.10.015","volume":"115","author":"D Aggarwal","year":"2015","unstructured":"D. Aggarwal, Affine-evasive sets modulo a prime. Inf. Process. Lett. 115(2), 382\u2013385 (2015).","journal-title":"Inf. Process. Lett."},{"key":"9362_CR2","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, S. Agrawal, D. Gupta, H.\u00a0K. Maji, O. Pandey, M. Prabhakaran, Optimal computational split-state non-malleable codes, in TCC (2016), pp. 393\u2013417.","DOI":"10.1007\/978-3-662-49099-0_15"},{"key":"9362_CR3","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, Y. Dodis, T. Kazana, M. Obremski, Non-malleable reductions and applications, in STOC (2015), pp. 459\u2013468.","DOI":"10.1145\/2746539.2746544"},{"key":"9362_CR4","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, Y. Dodis, S. Lovett, Non-malleable codes from additive combinatorics, in STOC (2014), pp. 774\u2013783.","DOI":"10.1145\/2591796.2591804"},{"issue":"2","key":"9362_CR5","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/140985251","volume":"47","author":"Divesh Aggarwal","year":"2018","unstructured":"D. Aggarwal, Y. Dodis, S. Lovett, Non-malleable codes from additive combinatorics. SIAM J. Comput. 47(2), 524\u2013546 (2018).","journal-title":"SIAM J. Comput."},{"key":"9362_CR6","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, N. D\u00f6ttling, J,\u00a0B. Nielsen, M. Obremski, E. Purwanto, Continuous non-malleable codes in the 8-split-state model, in EUROCRYPT (2019), pp. 531\u2013561.","DOI":"10.1007\/978-3-030-17653-2_18"},{"key":"9362_CR7","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, S. Dziembowski, T. Kazana, M. Obremski, Leakage-resilient non-malleable codes, in TCC (2015), pp. 398\u2013426.","DOI":"10.1007\/978-3-662-46494-6_17"},{"key":"9362_CR8","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, T. Kazana, M. Obremski, Inception makes non-malleable codes stronger, in TCC (2017), pp. 319\u2013343.","DOI":"10.1007\/978-3-319-70503-3_10"},{"key":"9362_CR9","doi-asserted-by":"crossref","unstructured":"S. Agrawal, D. Gupta, H.\u00a0K. Maji, O. Pandey, M. Prabhakaran, Explicit non-malleable codes against bit-wise tampering and permutations, in CRYPTO (2015), pp. 538\u2013557.","DOI":"10.1007\/978-3-662-47989-6_26"},{"key":"9362_CR10","doi-asserted-by":"crossref","unstructured":"S. Agrawal, D. Gupta, H.\u00a0K. Maji, O. Pandey, M. Prabhakaran, A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations, in TCC (2015), pp. 375\u2013397.","DOI":"10.1007\/978-3-662-46494-6_16"},{"key":"9362_CR11","doi-asserted-by":"crossref","unstructured":"P. Austrin, K.-M. Chung, M. Mahmoody, R. Pass, K. Seth, On the impossibility of cryptography with tamperable randomness, in CRYPTO (2014), pp. 462\u2013479.","DOI":"10.1007\/978-3-662-44371-2_26"},{"key":"9362_CR12","doi-asserted-by":"crossref","unstructured":"M. Ball, D. Dachman-Soled, S. Guo, T. Malkin, L.-Y. Tan, Non-malleable codes for small-depth circuits, in FOCS (2018), pp. 826\u2013837.","DOI":"10.1109\/FOCS.2018.00083"},{"key":"9362_CR13","doi-asserted-by":"crossref","unstructured":"M. Ball, D. Dachman-Soled, M. Kulkarni, H. Lin, T. Malkin, Non-malleable codes against bounded polynomial time tampering, in EUROCRYPT (2019), pp. 501\u2013530.","DOI":"10.1007\/978-3-030-17653-2_17"},{"key":"9362_CR14","doi-asserted-by":"crossref","unstructured":"M. Ball, D. Dachman-Soled, M. Kulkarni, T. Malkin, Non-malleable codes for bounded depth, bounded fan-in circuits, in EUROCRYPT (2016), pp. 881\u2013908.","DOI":"10.1007\/978-3-662-49896-5_31"},{"key":"9362_CR15","doi-asserted-by":"crossref","unstructured":"M. Ball, D. Dachman-Soled, M. Kulkarni, T. Malkin. Non-malleable codes from average-case hardness: $${{\\sf AC}}^{0}$$, decision trees, and streaming space-bounded tampering, in EUROCRYPT (2018), pp. 618\u2013650.","DOI":"10.1007\/978-3-319-78372-7_20"},{"key":"9362_CR16","unstructured":"M. Ball, D. Dachman-Soled, M. Kulkarni, T. Malkin, Limits to non-malleability, in ITCS (2020), pp. 80:1\u201380:32."},{"key":"9362_CR17","doi-asserted-by":"crossref","unstructured":"M. Ball, S. Guo, D. Wichs, Non-malleable codes for decision trees, in CRYPTO (2019), pp. 413\u2013434.","DOI":"10.1007\/978-3-030-26948-7_15"},{"key":"9362_CR18","doi-asserted-by":"crossref","unstructured":"M. Bellare, D. Cash, R. Miller, Cryptography secure against related-key attacks and tampering, in ASIACRYPT (2011), pp. 486\u2013503.","DOI":"10.1007\/978-3-642-25385-0_26"},{"key":"9362_CR19","doi-asserted-by":"crossref","unstructured":"M. Bellare, M. Fischlin, S. Goldwasser, S. Micali, Identification protocols secure against reset attacks, in EUROCRYPT (2001), pp. 495\u2013511.","DOI":"10.1007\/3-540-44987-6_30"},{"key":"9362_CR20","doi-asserted-by":"crossref","unstructured":"M. Bellare, T. Kohno, A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications, in EUROCRYPT (2003), pp. 491\u2013506.","DOI":"10.1007\/3-540-39200-9_31"},{"key":"9362_CR21","doi-asserted-by":"crossref","unstructured":"M. Bellare, K.\u00a0G. Paterson, S. Thomson, RKA security beyond the linear barrier: IBE, encryption and signatures, in ASIACRYPT (2012), pp. 331\u2013348.","DOI":"10.1007\/978-3-642-34961-4_21"},{"issue":"2","key":"9362_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s001450010016","volume":"14","author":"D Boneh","year":"2001","unstructured":"D. Boneh, R.\u00a0A. DeMillo, R.\u00a0J, Lipton. On the importance of eliminating errors in cryptographic computations, J. Cryptol. 14(2), 101\u2013119 (2001).","journal-title":"J. Cryptol."},{"key":"9362_CR23","doi-asserted-by":"crossref","unstructured":"G. Brian, A. Faonio, D. Venturi, Continuously non-malleable secret sharing for general access structures, in TCC (2019), pp. 211\u2013232.","DOI":"10.1007\/978-3-030-36033-7_8"},{"key":"9362_CR24","unstructured":"N. Chandran, V. Goyal, P. Mukherjee, O. Pandey, J. Upadhyay, Block-wise non-malleable codes, in ICALP (2016), pp. 31:1\u201331:14."},{"key":"9362_CR25","doi-asserted-by":"crossref","unstructured":"N. Chandran, B. Kanukurthi, S. Raghuraman Information-theoretic local non-malleable codes and their applications, in TCC (2016), pp. 367\u2013392.","DOI":"10.1007\/978-3-662-49099-0_14"},{"key":"9362_CR26","doi-asserted-by":"crossref","unstructured":"E. Chattopadhyay, V. Goyal, X. Li, Non-malleable extractors and codes, with their many tampered extensions, in STOC (2016), pp. 285\u2013298.","DOI":"10.1145\/2897518.2897547"},{"key":"9362_CR27","doi-asserted-by":"crossref","unstructured":"E. Chattopadhyay, X. Li, Non-malleable codes and extractors for small-depth circuits, and affine functions, in STOC (2017), pp. 1171\u20131184.","DOI":"10.1145\/3055399.3055483"},{"key":"9362_CR28","doi-asserted-by":"crossref","unstructured":"E. Chattopadhyay, D. Zuckerman, Non-malleable codes against constant split-state tampering, in FOCS (2014), pp. 306\u2013315.","DOI":"10.1109\/FOCS.2014.40"},{"key":"9362_CR29","doi-asserted-by":"crossref","unstructured":"B. Chen, Y. Chen, K. Host\u00e1kov\u00e1, P. Mukherjee, Continuous space-bounded non-malleable codes from stronger proofs-of-space, in CRYPTO (2019), pp. 467\u2013495.","DOI":"10.1007\/978-3-030-26948-7_17"},{"key":"9362_CR30","doi-asserted-by":"crossref","unstructured":"M. Cheraghchi, V. Guruswami, Non-malleable coding against bit-wise and split-state tampering, in TCC (2014), pp. 440\u2013464.","DOI":"10.1007\/978-3-642-54242-8_19"},{"issue":"3","key":"9362_CR31","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/TIT.2015.2511784","volume":"62","author":"M Cheraghchi","year":"2016","unstructured":"M. Cheraghchi, V. Guruswami, Capacity of non-malleable codes. IEEE Trans. Inf. Theory, 62(3), 1097\u20131118 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9362_CR32","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00145-015-9219-z","volume":"30","author":"M Cheraghchi","year":"2017","unstructured":"M. Cheraghchi, V. Guruswami, Non-malleable coding against bit-wise and split-state tampering, J. Cryptol. 30(1), 191\u2013241 (2017).","journal-title":"J. Cryptol."},{"key":"9362_CR33","doi-asserted-by":"crossref","unstructured":"S. G. Choi, A. Kiayias, T. Malkin, BiTR: Built-in tamper resilience, in ASIACRYPT (2011), pp. 740\u2013758.","DOI":"10.1007\/978-3-642-25385-0_40"},{"key":"9362_CR34","doi-asserted-by":"crossref","unstructured":"S. Coretti, Y. Dodis, B. Tackmann, D. Venturi. Non-malleable encryption: simpler, shorter, stronger, in TCC (2016), pp. 306\u2013335.","DOI":"10.1007\/978-3-662-49096-9_13"},{"key":"9362_CR35","doi-asserted-by":"crossref","unstructured":"S. Coretti, A. Faonio, D. Venturi, Rate-optimizing compilers for continuously non-malleable codes, in ACNS (2019), pp. 3\u201323.","DOI":"10.1007\/978-3-030-21568-2_1"},{"key":"9362_CR36","doi-asserted-by":"crossref","unstructured":"S. Coretti, U. Maurer, B. Tackmann, D. Venturi, From single-bit to multi-bit public-key encryption via non-malleable codes, in TCC (2015), pp. 532\u2013560.","DOI":"10.1007\/978-3-662-46494-6_22"},{"key":"9362_CR37","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, N. D\u00f6ttling, I. Giacomelli, C. Xing, Linear-time non-malleable codes in the bit-wise independent tampering model, in ICITS (2017), pp. 1\u201325.","DOI":"10.1007\/978-3-319-72089-0_1"},{"key":"9362_CR38","doi-asserted-by":"crossref","unstructured":"R. Cramer, V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, in CRYPTO (1998), pp. 13\u201325.","DOI":"10.1007\/BFb0055717"},{"key":"9362_CR39","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, Y.\u00a0T. Kalai, Securing circuits against constant-rate tampering, in CRYPTO (2012), pp. 533\u2013551.","DOI":"10.1007\/978-3-642-32009-5_31"},{"key":"9362_CR40","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, Y.\u00a0T. Kalai, Securing circuits and protocols against 1\/poly(k) tampering rate, in TCC (2014), pp. 540\u2013565.","DOI":"10.1007\/978-3-642-54242-8_23"},{"key":"9362_CR41","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, M. Kulkarni, Upper and lower bounds for continuous non-malleable codes, in PKC (2019), pp. 519\u2013548.","DOI":"10.1007\/978-3-030-17253-4_18"},{"key":"9362_CR42","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, M. Kulkarni, A. Shahverdi, Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes, in PKC (2017), pp. 310\u2013332.","DOI":"10.1007\/978-3-662-54365-8_13"},{"key":"9362_CR43","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, M. Kulkarni, A. Shahverdi, Local non-malleable codes in the bounded retrieval model, in PKC (2018), pp. 281\u2013311.","DOI":"10.1007\/978-3-319-76581-5_10"},{"key":"9362_CR44","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, M. Kulkarni, A. Shahverdi, Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes, Inf. Comput. p. 268 (2019)","DOI":"10.1016\/j.ic.2019.05.001"},{"key":"9362_CR45","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, F.-H. Liu, E. Shi, H.-S. Zhou, Locally decodable and updatable non-malleable codes and their applications, in TCC (2015), pp. 427\u2013450.","DOI":"10.1007\/978-3-662-46494-6_18"},{"issue":"1","key":"9362_CR46","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00145-018-9306-z","volume":"33","author":"D Dachman-Soled","year":"2020","unstructured":"D. Dachman-Soled, F.-H. Liu, E. Shi, H.-S. Zhou, Locally decodable and updatable non-malleable codes and their applications. J. Cryptol. 33(1), 319\u2013355 (2020).","journal-title":"J. Cryptol."},{"key":"9362_CR47","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, S. Faust, P. Mukherjee, D. Venturi, Bounded tamper resilience: How to go beyond the algebraic barrier, in ASIACRYPT (2013), pp. 140\u2013160.","DOI":"10.1007\/978-3-642-42045-0_8"},{"key":"9362_CR48","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, S. Faust, P. Mukherjee, D. Venturi, The chaining lemma and its application, in ICITS (2015), pp. 181\u2013196.","DOI":"10.1007\/978-3-319-17470-9_11"},{"key":"9362_CR49","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, T. Kazana, M. Obremski, V. Raj, L. Siniscalchi, Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments, in TCC (2018), pp. 225\u2013254.","DOI":"10.1007\/978-3-030-03810-6_9"},{"key":"9362_CR50","doi-asserted-by":"crossref","unstructured":"F. Dav\u00ec, S. Dziembowski, D. Venturi, Leakage-resilient storage, in SCN (2010), pp. 121\u2013137.","DOI":"10.1007\/978-3-642-15317-4_9"},{"key":"9362_CR51","doi-asserted-by":"crossref","unstructured":"Y. Dodis, K. Haralambiev, A. L\u00f3pez-Alt, D. Wichs, Efficient public-key cryptography in the presence of key leakage, in ASIACRYPT (2010), pp. 613\u2013631.","DOI":"10.1007\/978-3-642-17373-8_35"},{"key":"9362_CR52","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, S. Faust, Leakage-resilient cryptography from the inner-product extractor, in ASIACRYPT (2011), pp. 702\u2013721.","DOI":"10.1007\/978-3-642-25385-0_38"},{"key":"9362_CR53","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, T. Kazana, M. Obremski, Non-malleable codes from two-source extractors, in CRYPTO (2013), pp. 239\u2013257.","DOI":"10.1007\/978-3-642-40084-1_14"},{"key":"9362_CR54","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, K. Pietrzak, Leakage-resilient cryptography. In FOCS (2008), pp. 293\u2013302.","DOI":"10.1109\/FOCS.2008.56"},{"key":"9362_CR55","unstructured":"S. Dziembowski, K. Pietrzak, D. Wichs, Non-malleable codes, in ICS (2010), pp. 434\u2013452."},{"key":"9362_CR56","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, K. Pietrzak, D. Wichs, Non-malleable codes. J. ACM, 65(4), 20:1\u201320:32 (2018).","DOI":"10.1145\/3178432"},{"key":"9362_CR57","doi-asserted-by":"crossref","unstructured":"A. Faonio, J.\u00a0B. Nielsen, Non-malleable codes with split-state refresh, in PKC (2017), pp. 279\u2013309.","DOI":"10.1007\/978-3-662-54365-8_12"},{"key":"9362_CR58","doi-asserted-by":"crossref","unstructured":"A. Faonio, J.\u00a0B. Nielsen, M. Simkin, D. Venturi, Continuously non-malleable codes with split-state refresh, in ACNS (2018), pp. 121\u2013139.","DOI":"10.1007\/978-3-319-93387-0_7"},{"key":"9362_CR59","doi-asserted-by":"crossref","unstructured":"A. Faonio, J.\u00a0B. Nielsen, M. Simkin, D. Venturi, Continuously non-malleable codes with split-state refresh. Theor. Comput. Sci. 759, 98\u2013132 (2019).","DOI":"10.1016\/j.tcs.2018.12.028"},{"key":"9362_CR60","doi-asserted-by":"crossref","unstructured":"A. Faonio, D. Venturi, Non-malleable secret sharing in the computational setting: adaptive tampering, noisy-leakage resilience, and improved rate, in CRYPTO (2019), pp. 448\u2013479.","DOI":"10.1007\/978-3-030-26951-7_16"},{"key":"9362_CR61","doi-asserted-by":"crossref","unstructured":"S. Faust, K. Host\u00e1kov\u00e1, P. Mukherjee, D. Venturi, Non-malleable codes for space-bounded tampering, in CRYPTO (2017), pp. 95\u2013126.","DOI":"10.1007\/978-3-319-63715-0_4"},{"key":"9362_CR62","doi-asserted-by":"crossref","unstructured":"S. Faust, P. Mukherjee, J.\u00a0B. Nielsen, D. Venturi, Continuous non-malleable codes, in TCC (2014), pp. 465\u2013488.","DOI":"10.1007\/978-3-642-54242-8_20"},{"key":"9362_CR63","doi-asserted-by":"crossref","unstructured":"S. Faust, P. Mukherjee, J.\u00a0B. Nielsen, D. Venturi, A tamper and leakage resilient von Neumann architecture, in PKC (2015), pp. 579\u2013603.","DOI":"10.1007\/978-3-662-46447-2_26"},{"key":"9362_CR64","doi-asserted-by":"crossref","unstructured":"S. Faust, P. Mukherjee, D. Venturi, D. Wichs, Efficient non-malleable codes and key-derivation for poly-size tampering circuits, in EUROCRYPT (2014), pp. 111\u2013128.","DOI":"10.1007\/978-3-642-55220-5_7"},{"issue":"12","key":"9362_CR65","doi-asserted-by":"publisher","first-page":"7179","DOI":"10.1109\/TIT.2016.2613919","volume":"62","author":"S Faust","year":"2016","unstructured":"S. Faust, P. Mukherjee, D. Venturi, D. Wichs, 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":"9362_CR66","doi-asserted-by":"crossref","unstructured":"S. Faust, K. Pietrzak, D. Venturi, Tamper-proof circuits: How to trade leakage for tamper-resilience, in ICALP (2011), pp. 391\u2013402.","DOI":"10.1007\/978-3-642-22006-7_33"},{"issue":"1","key":"9362_CR67","doi-asserted-by":"crossref","first-page":"336","DOI":"10.46586\/tosc.v2018.i1.336-352","volume":"2018","author":"S Fehr","year":"2018","unstructured":"S. Fehr, P. Karpman, B. Mennink, Short non-malleable codes from related-key secure block ciphers. IACR Trans. Symmetr. Cryptol. 2018(1), 336\u2013352 (2018).","journal-title":"IACR Trans. Symmetr. Cryptol."},{"key":"9362_CR68","unstructured":"U. Feige, D. Lapidot, A. Shamir, Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract), in FOCS (1990), pp. 308\u2013317."},{"key":"9362_CR69","doi-asserted-by":"crossref","unstructured":"D. Genkin, Y. Ishai, M. Prabhakaran, A. Sahai, E. Tromer, Circuits resilient to additive attacks with applications to secure computation, in STOC (2014), pp. 495\u2013504.","DOI":"10.1145\/2591796.2591861"},{"key":"9362_CR70","doi-asserted-by":"crossref","unstructured":"R. Gennaro, A. Lysyanskaya, T. Malkin, S. Micali, T. Rabin, Algorithmic tamper-proof (ATP) security: theoretical foundations for security against hardware tampering, in TCC (2004), pp. 258\u2013277.","DOI":"10.1007\/978-3-540-24638-1_15"},{"key":"9362_CR71","doi-asserted-by":"crossref","unstructured":"V. Goyal, A. Kumar, Non-malleable secret sharing, in STOC (2018), pp. 685\u2013698.","DOI":"10.1145\/3188745.3188872"},{"key":"9362_CR72","doi-asserted-by":"crossref","unstructured":"V. Goyal, A. Sahai, Resettably secure computation, in EUROCRYPT (2009), pp. 54\u201371.","DOI":"10.1007\/978-3-642-01001-9_3"},{"key":"9362_CR73","doi-asserted-by":"crossref","unstructured":"J. Groth, Simulation-sound NIZK proofs for a practical language and constant size group signatures, in ASIACRYPT (2006), pp. 444\u2013459.","DOI":"10.1007\/11935230_29"},{"key":"9362_CR74","doi-asserted-by":"crossref","unstructured":"J. Groth, A. Sahai, Efficient non-interactive proof systems for bilinear groups, in EUROCRYPT (2008), pp. 415\u2013432.","DOI":"10.1007\/978-3-540-78967-3_24"},{"issue":"5","key":"9362_CR75","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1137\/080725386","volume":"41","author":"Jens Groth","year":"2012","unstructured":"Jens Groth and Amit Sahai. Efficient noninteractive proof systems for bilinear groups. SIAM J. Comput., 41(5):1193\u20131232, 2012.","journal-title":"SIAM J. Comput."},{"key":"9362_CR76","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, D. Wagner, Private circuits II: Keeping secrets in tamperable circuits, in EUROCRYPT (2006), pp. 308\u2013327.","DOI":"10.1007\/11761679_19"},{"key":"9362_CR77","doi-asserted-by":"crossref","unstructured":"Z. Jafargholi, D. Wichs, Tamper detection and continuous non-malleable codes, in TCC (2015), pp. 451\u2013480.","DOI":"10.1007\/978-3-662-46494-6_19"},{"key":"9362_CR78","doi-asserted-by":"crossref","unstructured":"Y.\u00a0T. Kalai, B. Kanukurthi, A. Sahai, Cryptography with tamperable and leaky memory, in CRYPTO (2015), pp. 373\u2013390.","DOI":"10.1007\/978-3-642-22792-9_21"},{"key":"9362_CR79","doi-asserted-by":"crossref","unstructured":"B. Kanukurthi, S. L.\u00a0B. Obbattu, S. Sekar, Four-state non-malleable codes with explicit constant rate, in TCC (2017), pp. 344\u2013375.","DOI":"10.1007\/978-3-319-70503-3_11"},{"issue":"3","key":"9362_CR80","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1007\/s00145-019-09339-7","volume":"33","author":"B Kanukurthi","year":"2020","unstructured":"B. Kanukurthi, S. L.\u00a0B. Obbattu, S. Sekar, Four-state non-malleable codes with explicit constant rate. J. Cryptol. 33(3), 1044\u20131079 (2020).","journal-title":"J. Cryptol."},{"key":"9362_CR81","doi-asserted-by":"crossref","unstructured":"A. Kiayias, F.-H. Liu, Y. Tselekounis, Practical non-malleable codes from $$l$$-more extractable hash functions, in CCS (2016), pp. 1317\u20131328.","DOI":"10.1145\/2976749.2978352"},{"key":"9362_CR82","doi-asserted-by":"crossref","unstructured":"A. Kiayias, F.-H. Liu, Y. Tselekounis, Non-malleable codes for partial functions with manipulation detection, in CRYPTO (2018), pp. 577\u2013607.","DOI":"10.1007\/978-3-319-96878-0_20"},{"key":"9362_CR83","doi-asserted-by":"crossref","unstructured":"A. Kiayias, Y. Tselekounis, Tamper resilient circuits: The adversary at the gates, in ASIACRYPT (2013), pp. 161\u2013180.","DOI":"10.1007\/978-3-642-42045-0_9"},{"key":"9362_CR84","doi-asserted-by":"crossref","unstructured":"F.-H. Liu, A. Lysyanskaya, Tamper and leakage resilience in the split-state model, in CRYPTO (2012), pp. 517\u2013532.","DOI":"10.1007\/978-3-642-32009-5_30"},{"key":"9362_CR85","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, G. Persiano, D. Venturi, I. Visconti. Continuously non-malleable codes in the split-state model from minimal assumptions, in CRYPTO (2018), pp. 608\u2013639.","DOI":"10.1007\/978-3-319-96878-0_21"},{"key":"9362_CR86","doi-asserted-by":"crossref","unstructured":"K. Pietrzak, Subspace LWE, in TCC (2012), pp. 548\u2013563.","DOI":"10.1007\/978-3-642-28914-9_31"},{"key":"9362_CR87","doi-asserted-by":"crossref","unstructured":"A. D. Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, A. Sahai, Robust non-interactive zero knowledge, in CRYPTO (2001), pp. 566\u2013598.","DOI":"10.1007\/3-540-44647-8_33"},{"key":"9362_CR88","doi-asserted-by":"crossref","unstructured":"S. Yilek, Resettable public-key encryption: How to encrypt on a virtual machine, in CT-RSA (2010), pp. 41\u201356.","DOI":"10.1007\/978-3-642-11925-5_4"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09362-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-020-09362-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09362-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T23:14:15Z","timestamp":1627082055000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-020-09362-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,24]]},"references-count":88,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9362"],"URL":"https:\/\/doi.org\/10.1007\/s00145-020-09362-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,24]]},"assertion":[{"value":"13 March 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}