{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:32:04Z","timestamp":1768919524982,"version":"3.49.0"},"reference-count":67,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T00:00:00Z","timestamp":1524700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Counci","award":["682815-TOCNeT, 259668-PSPC, 207908-CNTM"],"award-info":[{"award-number":["682815-TOCNeT, 259668-PSPC, 207908-CNTM"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1314722"],"award-info":[{"award-number":["CNS-1314722"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2018,8,31]]},"abstract":"<jats:p>We introduce the notion of \u201cnon-malleable codes\u201d which relaxes the notion of error correction and error detection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In contrast to error correction and error detection, non-malleability can be achieved for very rich classes of modifications.<\/jats:p>\n          <jats:p>\n            We construct an efficient code that is non-malleable with respect to modifications that affect each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set it to either 0 or 1), but independently of the value of the other bits of the codeword. Using the probabilistic method, we also show a very strong and general statement: there exists a non-malleable code for\n            <jats:italic>every<\/jats:italic>\n            \u201csmall enough\u201d family\n            <jats:italic>F<\/jats:italic>\n            of functions via which codewords can be modified. Although this probabilistic method argument does not directly yield efficient constructions, it gives us efficient non-malleable codes in the random-oracle model for very general classes of tampering functions\u2014e.g., functions where every bit in the tampered codeword can depend arbitrarily on any 99% of the bits in the original codeword.\n          <\/jats:p>\n          <jats:p>As an application of non-malleable codes, we show that they provide an elegant algorithmic solution to the task of protecting functionalities implemented in hardware (e.g., signature cards) against \u201ctampering attacks.\u201d In such attacks, the secret state of a physical system is tampered, in the hopes that future interaction with the modified system will reveal some secret information. This problem was previously studied in the work of Gennaro et al. in 2004 under the name \u201calgorithmic tamper proof security\u201d (ATP). We show that non-malleable codes can be used to achieve important improvements over the prior work. In particular, we show that any functionality can be made secure against a large class of tampering attacks, simply by encoding the secret state with a non-malleable code while it is stored in memory.<\/jats:p>","DOI":"10.1145\/3178432","type":"journal-article","created":{"date-parts":[[2018,4,27]],"date-time":"2018-04-27T16:00:21Z","timestamp":1524844821000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Non-Malleable Codes"],"prefix":"10.1145","volume":"65","author":[{"given":"Stefan","family":"Dziembowski","sequence":"first","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[{"name":"Institute of Science and Technology (IST) Austria, Klosterneuburg, Austria"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, Massachusetts"}]}],"member":"320","published-online":{"date-parts":[[2018,4,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.10.015"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746544"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591804"},{"key":"e_1_2_1_4_1","series-title":"Lecture Notes in Computer Science","volume-title":"TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.)","author":"Aggarwal Divesh","unstructured":"Divesh Aggarwal , Stefan Dziembowski , Tomasz Kazana , and Maciej Obremski . 2015b. Leakage-resilient non-malleable codes . In TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.) . Lecture Notes in Computer Science , Vol. 9014 , Springer , Heidelberg , 398--426. Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, and Maciej Obremski. 2015b. Leakage-resilient non-malleable codes. In TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.). Lecture Notes in Computer Science, Vol. 9014, Springer, Heidelberg, 398--426."},{"key":"e_1_2_1_5_1","volume-title":"Advances in Cryptology -- CRYPTO","author":"Agrawal Shashank","year":"2015","unstructured":"Shashank Agrawal , Divya Gupta , Hemanta K. Maji , Omkant Pandey , and Manoj Prabhakaran . 2015a. Explicit non-malleable codes against bit-wise tampering and permutations . In Advances in Cryptology -- CRYPTO 2015 , Part I, Rosario Gennaro and Matthew J. B. Robshaw (Eds.). Lecture Notes in Computer Science, Vol. 9215 , Springer , Heidelberg, 538--557. Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, and Manoj Prabhakaran. 2015a. Explicit non-malleable codes against bit-wise tampering and permutations. In Advances in Cryptology -- CRYPTO 2015, Part I, Rosario Gennaro and Matthew J. B. Robshaw (Eds.). Lecture Notes in Computer Science, Vol. 9215, Springer, Heidelberg, 538--557."},{"key":"e_1_2_1_6_1","series-title":"Lecture Notes in Computer Science","volume-title":"TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.)","author":"Agrawal Shashank","unstructured":"Shashank Agrawal , Divya Gupta , Hemanta K. Maji , Omkant Pandey , and Manoj Prabhakaran . 2015b. A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations . In TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.) . Lecture Notes in Computer Science , Vol. 9014 , Springer , Heidelberg , 375--397. Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, and Manoj Prabhakaran. 2015b. A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations. In TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.). Lecture Notes in Computer Science, Vol. 9014, Springer, Heidelberg, 375--397."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_28"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_3"},{"key":"e_1_2_1_9_1","volume-title":"Advances in Cryptology -- ASIACRYPT","author":"Bellare Mihir","year":"2000","unstructured":"Mihir Bellare and Chanathip Namprempre . 2000. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm . In Advances in Cryptology -- ASIACRYPT 2000 , Tatsuaki Okamoto (Ed.). Lecture Notes in Computer Science, Vol. 1976 , Springer , Heidelberg, 531--545. Mihir Bellare and Chanathip Namprempre. 2000. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In Advances in Cryptology -- ASIACRYPT 2000, Tatsuaki Okamoto (Ed.). Lecture Notes in Computer Science, Vol. 1976, Springer, Heidelberg, 531--545."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365687"},{"key":"e_1_2_1_12_1","volume-title":"Lipton","author":"Boneh Dan","year":"1997","unstructured":"Dan Boneh , Richard A. DeMillo , and Richard J . Lipton . 1997 . On the importance of checking cryptographic protocols for faults (extended abstract). In Advances in Cryptology -- EUROCRYPT\u201997, Walter Fumy (Ed.). Lecture Notes in Computer Science, Vol. 1233 , Springer , Heidelberg, 37--51. Dan Boneh, Richard A. DeMillo, and Richard J. Lipton. 1997. On the importance of checking cryptographic protocols for faults (extended abstract). In Advances in Cryptology -- EUROCRYPT\u201997, Walter Fumy (Ed.). Lecture Notes in Computer Science, Vol. 1233, Springer, Heidelberg, 37--51."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.55"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013856431727"},{"key":"e_1_2_1_15_1","volume-title":"Advances in Cryptology -- CRYPTO","author":"Canetti Ran","year":"2003","unstructured":"Ran Canetti , Hugo Krawczyk , and Jesper Buus Nielsen . 2003. Relaxing chosen-ciphertext security . In Advances in Cryptology -- CRYPTO 2003 , Dan Boneh (Ed.). Lecture Notes in Computer Science, Vol. 2729 , Springer , Heidelberg, 565--582. Ran Canetti, Hugo Krawczyk, and Jesper Buus Nielsen. 2003. Relaxing chosen-ciphertext security. In Advances in Cryptology -- CRYPTO 2003, Dan Boneh (Ed.). Lecture Notes in Computer Science, Vol. 2729, Springer, Heidelberg, 565--582."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089565"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283976"},{"key":"e_1_2_1_18_1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming (ICALP\u201916)","volume":"55","author":"Chandran Nishanth","year":"2016","unstructured":"Nishanth Chandran , Vipul Goyal , Pratyay Mukherjee , Omkant Pandey , and Jalaj Upadhyay . 2016 . Block-wise non-malleable codes. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP\u201916) (LIPIcs), Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (Eds.) , Vol. 55 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 31:1--31:14. Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, and Jalaj Upadhyay. 2016. Block-wise non-malleable codes. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP\u201916) (LIPIcs), Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (Eds.), Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 31:1--31:14."},{"key":"e_1_2_1_19_1","volume-title":"Advances in Cryptology -- CRYPTO\u201999, Michael J","author":"Chari Suresh","unstructured":"Suresh Chari , Charanjit S. Jutla , Josyula R. Rao , and Pankaj Rohatgi . 1999. Towards sound approaches to counteract power-analysis attacks . In Advances in Cryptology -- CRYPTO\u201999, Michael J . Wiener (Ed.). Lecture Notes in Computer Science, Vol. 1666 , Springer , Heidelberg, 398--412. Suresh Chari, Charanjit S. Jutla, Josyula R. Rao, and Pankaj Rohatgi. 1999. Towards sound approaches to counteract power-analysis attacks. In Advances in Cryptology -- CRYPTO\u201999, Michael J. Wiener (Ed.). Lecture Notes in Computer Science, Vol. 1666, Springer, Heidelberg, 398--412."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.40"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_17"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554814"},{"key":"e_1_2_1_23_1","series-title":"Lecture Notes in Computer Science","volume-title":"TCC 2014: 11th Theory of Cryptography Conference, Yehuda Lindell (Ed.)","author":"Cheraghchi Mahdi","unstructured":"Mahdi Cheraghchi and Venkatesan Guruswami . 2014b. Non-malleable coding against bit-wise and split-state tampering . In TCC 2014: 11th Theory of Cryptography Conference, Yehuda Lindell (Ed.) . Lecture Notes in Computer Science , Vol. 8349 , Springer , Heidelberg , 440--464. Mahdi Cheraghchi and Venkatesan Guruswami. 2014b. Non-malleable coding against bit-wise and split-state tampering. In TCC 2014: 11th Theory of Cryptography Conference, Yehuda Lindell (Ed.). Lecture Notes in Computer Science, Vol. 8349, Springer, Heidelberg, 440--464."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_13"},{"key":"e_1_2_1_25_1","series-title":"Lecture Notes in Computer Science","volume-title":"TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.)","author":"Coretti Sandro","unstructured":"Sandro Coretti , Ueli Maurer , Bj\u00f6rn Tackmann , and Daniele Venturi . 2015. From single-bit to multi-bit public-key encryption via non-malleable codes . In TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.) . Lecture Notes in Computer Science , Vol. 9014 , Springer , Heidelberg , 532--560. Sandro Coretti, Ueli Maurer, Bj\u00f6rn Tackmann, and Daniele Venturi. 2015. From single-bit to multi-bit public-key encryption via non-malleable codes. In TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.). Lecture Notes in Computer Science, Vol. 9014, Springer, Heidelberg, 532--560."},{"key":"e_1_2_1_26_1","volume-title":"Cryptographic Hardware and Embedded Systems -- CHES","author":"Coron Jean-S\u00e9bastien","year":"2000","unstructured":"Jean-S\u00e9bastien Coron and Louis Goubin . 2000. On boolean and arithmetic masking against differential power analysis . In Cryptographic Hardware and Embedded Systems -- CHES 2000 , \u00c7etin Kaya Ko\u00e7 and Christof Paar (Eds.). Lecture Notes in Computer Science, Vol. 1965 , Springer , Heidelberg, 231--237. Jean-S\u00e9bastien Coron and Louis Goubin. 2000. On boolean and arithmetic masking against differential power analysis. In Cryptographic Hardware and Embedded Systems -- CHES 2000, \u00c7etin Kaya Ko\u00e7 and Christof Paar (Eds.). Lecture Notes in Computer Science, Vol. 1965, Springer, Heidelberg, 231--237."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9189-6"},{"key":"e_1_2_1_28_1","volume-title":"Advances in Cryptology -- EUROCRYPT","author":"Cramer Ronald","year":"2008","unstructured":"Ronald Cramer , Yevgeniy Dodis , Serge Fehr , Carles Padr\u00f3 , and Daniel Wichs . 2008. Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors . In Advances in Cryptology -- EUROCRYPT 2008 , Nigel P. Smart (Ed.). Lecture Notes in Computer Science, Vol. 4965 , Springer , Heidelberg, 471--488. Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padr\u00f3, and Daniel Wichs. 2008. Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In Advances in Cryptology -- EUROCRYPT 2008, Nigel P. Smart (Ed.). Lecture Notes in Computer Science, Vol. 4965, Springer, Heidelberg, 471--488."},{"key":"e_1_2_1_29_1","series-title":"Lecture Notes in Computer Science","volume-title":"TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.)","author":"Dachman-Soled Dana","unstructured":"Dana Dachman-Soled , Feng-Hao Liu , Elaine Shi , and Hong-Sheng Zhou . 2015. Locally decodable and updatable non-malleable codes and their applications . In TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.) . Lecture Notes in Computer Science , Vol. 9014 , Springer , Heidelberg , 427--450. Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, and Hong-Sheng Zhou. 2015. Locally decodable and updatable non-malleable codes and their applications. In TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.). Lecture Notes in Computer Science, Vol. 9014, Springer, Heidelberg, 427--450."},{"key":"e_1_2_1_30_1","series-title":"Lecture Notes in Computer Science","volume-title":"SCN 10: 7th International Conference on Security in Communication Networks, Juan A. Garay and Roberto De Prisco (Eds.)","author":"Dav\u00ec Francesco","unstructured":"Francesco Dav\u00ec , Stefan Dziembowski , and Daniele Venturi . 2010. Leakage-resilient storage . In SCN 10: 7th International Conference on Security in Communication Networks, Juan A. Garay and Roberto De Prisco (Eds.) . Lecture Notes in Computer Science , Vol. 6280 , Springer , Heidelberg , 121--137. Francesco Dav\u00ec, Stefan Dziembowski, and Daniele Venturi. 2010. Leakage-resilient storage. In SCN 10: 7th International Conference on Security in Communication Networks, Juan A. Garay and Roberto De Prisco (Eds.). Lecture Notes in Computer Science, Vol. 6280, Springer, Heidelberg, 121--137."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.56"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536498"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.35"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795291562"},{"key":"e_1_2_1_35_1","volume-title":"Advances in Cryptology -- EUROCRYPT","author":"Duc Alexandre","year":"2014","unstructured":"Alexandre Duc , Stefan Dziembowski , and Sebastian Faust . 2014. Unifying leakage models: From probing attacks to noisy leakage . In Advances in Cryptology -- EUROCRYPT 2014 , Phong Q. Nguyen and Elisabeth Oswald (Eds.). Lecture Notes in Computer Science, Vol. 8441 , Springer , Heidelberg, 423--440. Alexandre Duc, Stefan Dziembowski, and Sebastian Faust. 2014. Unifying leakage models: From probing attacks to noisy leakage. In Advances in Cryptology -- EUROCRYPT 2014, Phong Q. Nguyen and Elisabeth Oswald (Eds.). Lecture Notes in Computer Science, Vol. 8441, Springer, Heidelberg, 423--440."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_38"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_13"},{"key":"e_1_2_1_38_1","volume-title":"Advances in Cryptology -- CRYPTO","author":"Dziembowski Stefan","year":"2013","unstructured":"Stefan Dziembowski , Tomasz Kazana , and Maciej Obremski . 2013. Non-malleable codes from two-source extractors . In Advances in Cryptology -- CRYPTO 2013 , Part II, Ran Canetti and Juan A. Garay (Eds.). Lecture Notes in Computer Science, Vol. 8043 , Springer , Heidelberg, 239--257. Stefan Dziembowski, Tomasz Kazana, and Maciej Obremski. 2013. Non-malleable codes from two-source extractors. In Advances in Cryptology -- CRYPTO 2013, Part II, Ran Canetti and Juan A. Garay (Eds.). Lecture Notes in Computer Science, Vol. 8043, Springer, Heidelberg, 239--257."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.56"},{"key":"e_1_2_1_40_1","volume-title":"ICS 2010: 1st Innovations in Computer Science, Andrew Chi-Chih Yao (Ed.)","author":"Dziembowski Stefan","year":"2010","unstructured":"Stefan Dziembowski , Krzysztof Pietrzak , and Daniel Wichs . 2010 . Non-malleable codes . In ICS 2010: 1st Innovations in Computer Science, Andrew Chi-Chih Yao (Ed.) . Tsinghua University Press, Tsinghua University, Beijing, China, 434--452. Stefan Dziembowski, Krzysztof Pietrzak, and Daniel Wichs. 2010. Non-malleable codes. In ICS 2010: 1st Innovations in Computer Science, Andrew Chi-Chih Yao (Ed.). Tsinghua University Press, Tsinghua University, Beijing, China, 434--452."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_21"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54242-8_20"},{"key":"e_1_2_1_43_1","volume-title":"Advances in Cryptology -- EUROCRYPT","author":"Faust Sebastian","year":"2014","unstructured":"Sebastian Faust , Pratyay Mukherjee , Daniele Venturi , and Daniel Wichs . 2014b. Efficient non-malleable codes and key-derivation for poly-size tampering circuits . In Advances in Cryptology -- EUROCRYPT 2014 , Phong Q. Nguyen and Elisabeth Oswald (Eds.). Lecture Notes in Computer Science, Vol. 8441 , Springer , Heidelberg, 111--128. Sebastian Faust, Pratyay Mukherjee, Daniele Venturi, and Daniel Wichs. 2014b. Efficient non-malleable codes and key-derivation for poly-size tampering circuits. In Advances in Cryptology -- EUROCRYPT 2014, Phong Q. Nguyen and Elisabeth Oswald (Eds.). Lecture Notes in Computer Science, Vol. 8441, Springer, Heidelberg, 111--128."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_7"},{"key":"e_1_2_1_45_1","series-title":"Lecture Notes in Computer Science","volume-title":"TCC 2004: 1st Theory of Cryptography Conference, Moni Naor (Ed.)","author":"Gennaro Rosario","unstructured":"Rosario Gennaro , Anna Lysyanskaya , Tal Malkin , Silvio Micali , and Tal Rabin . 2004. Algorithmic tamper-proof (ATP) security: Theoretical foundations for security against hardware tampering . In TCC 2004: 1st Theory of Cryptography Conference, Moni Naor (Ed.) . Lecture Notes in Computer Science , Vol. 2951 , Springer , Heidelberg , 258--277. Rosario Gennaro, Anna Lysyanskaya, Tal Malkin, Silvio Micali, and Tal Rabin. 2004. Algorithmic tamper-proof (ATP) security: Theoretical foundations for security against hardware tampering. In TCC 2004: 1st Theory of Cryptography Conference, Moni Naor (Ed.). Lecture Notes in Computer Science, Vol. 2951, Springer, Heidelberg, 258--277."},{"key":"e_1_2_1_46_1","volume-title":"\u201cduplication","author":"Goubin Louis","unstructured":"Louis Goubin and Jacques Patarin . 1999. DES and differential power analysis ( The \u201cduplication \u201d method). In Cryptographic Hardware and Embedded Systems -- CHES\u201999, \u00c7etin Kaya Ko\u00e7 and Christof Paar (Eds.). Lecture Notes in Computer Science, Vol. 1717 , Springer , Heidelberg, 158--172. Louis Goubin and Jacques Patarin. 1999. DES and differential power analysis (The \u201cduplication\u201d method). In Cryptographic Hardware and Embedded Systems -- CHES\u201999, \u00c7etin Kaya Ko\u00e7 and Christof Paar (Eds.). Lecture Notes in Computer Science, Vol. 1717, Springer, Heidelberg, 158--172."},{"key":"e_1_2_1_47_1","series-title":"Lecture Notes in Computer Science","volume-title":"TCC 2011: 8th Theory of Cryptography Conference, Yuval Ishai (Ed.)","author":"Halevi Shai","unstructured":"Shai Halevi and Huijia Lin . 2011. After-the-fact leakage in public-key encryption . In TCC 2011: 8th Theory of Cryptography Conference, Yuval Ishai (Ed.) . Lecture Notes in Computer Science , Vol. 6597 , Springer , Heidelberg , 107--124. Shai Halevi and Huijia Lin. 2011. After-the-fact leakage in public-key encryption. In TCC 2011: 8th Theory of Cryptography Conference, Yuval Ishai (Ed.). Lecture Notes in Computer Science, Vol. 6597, Springer, Heidelberg, 107--124."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"e_1_2_1_49_1","volume-title":"Advances in Cryptology -- EUROCRYPT","author":"Hazay Carmit","year":"2013","unstructured":"Carmit Hazay , Adriana L\u00f3pez-Alt , Hoeteck Wee , and Daniel Wichs . 2013. Leakage-resilient cryptography from minimal assumptions . In Advances in Cryptology -- EUROCRYPT 2013 , Thomas Johansson and Phong Q. Nguyen (Eds.). Lecture Notes in Computer Science, Vol. 7881 , Springer , Heidelberg, 160--176. Carmit Hazay, Adriana L\u00f3pez-Alt, Hoeteck Wee, and Daniel Wichs. 2013. Leakage-resilient cryptography from minimal assumptions. In Advances in Cryptology -- EUROCRYPT 2013, Thomas Johansson and Phong Q. Nguyen (Eds.). Lecture Notes in Computer Science, Vol. 7881, Springer, Heidelberg, 160--176."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_19"},{"key":"e_1_2_1_51_1","volume-title":"Advances in Cryptology -- CRYPTO","author":"Ishai Yuval","year":"2003","unstructured":"Yuval Ishai , Amit Sahai , and David Wagner . 2003. Private circuits: Securing hardware against probing attacks . In Advances in Cryptology -- CRYPTO 2003 , Dan Boneh (Ed.). Lecture Notes in Computer Science, Vol. 2729 , Springer , Heidelberg, 463--481. Yuval Ishai, Amit Sahai, and David Wagner. 2003. Private circuits: Securing hardware against probing attacks. In Advances in Cryptology -- CRYPTO 2003, Dan Boneh (Ed.). Lecture Notes in Computer Science, Vol. 2729, Springer, Heidelberg, 463--481."},{"key":"e_1_2_1_52_1","series-title":"Lecture Notes in Computer Science","volume-title":"TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.)","author":"Jafargholi Zahra","unstructured":"Zahra Jafargholi and Daniel Wichs . 2015. Tamper detection and continuous non-malleable codes . In TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.) . Lecture Notes in Computer Science , Vol. 9014 , Springer , Heidelberg , 451--480. Zahra Jafargholi and Daniel Wichs. 2015. Tamper detection and continuous non-malleable codes. In TCC 2015: 12th Theory of Cryptography Conference, Part I, Yevgeniy Dodis and Jesper Buus Nielsen (Eds.). Lecture Notes in Computer Science, Vol. 9014, Springer, Heidelberg, 451--480."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_41"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_30"},{"key":"e_1_2_1_55_1","series-title":"Lecture Notes in Computer Science","volume-title":"TCC 2004: 1st Theory of Cryptography Conference, Moni Naor (Ed.)","author":"Maurer Ueli M.","unstructured":"Ueli M. Maurer , Renato Renner , and Clemens Holenstein . 2004. Indifferentiability , impossibility results on reductions, and applications to the random oracle methodology . In TCC 2004: 1st Theory of Cryptography Conference, Moni Naor (Ed.) . Lecture Notes in Computer Science , Vol. 2951 , Springer , Heidelberg , 21--39. Ueli M. Maurer, Renato Renner, and Clemens Holenstein. 2004. Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In TCC 2004: 1st Theory of Cryptography Conference, Moni Naor (Ed.). Lecture Notes in Computer Science, Vol. 2951, Springer, Heidelberg, 21--39."},{"key":"e_1_2_1_56_1","volume-title":"Fast Software Encryption -- FSE","author":"Messerges Thomas S.","year":"2000","unstructured":"Thomas S. Messerges . 2001. Securing the AES finalists against power analysis attacks . In Fast Software Encryption -- FSE 2000 , Bruce Schneier (Ed.). Lecture Notes in Computer Science, Vol, 1978, Springer , Heidelberg, 150--164. Thomas S. Messerges. 2001. Securing the AES finalists against power analysis attacks. In Fast Software Encryption -- FSE 2000, Bruce Schneier (Ed.). Lecture Notes in Computer Science, Vol, 1978, Springer, Heidelberg, 150--164."},{"key":"e_1_2_1_57_1","series-title":"Lecture Notes in Computer Science","volume-title":"TCC 2004: 1st Theory of Cryptography Conference, Moni Naor (Ed.)","author":"Micali Silvio","unstructured":"Silvio Micali and Leonid Reyzin . 2004. Physically observable cryptography (extended abstract) . In TCC 2004: 1st Theory of Cryptography Conference, Moni Naor (Ed.) . Lecture Notes in Computer Science , Vol. 2951 , Springer , Heidelberg , 278--296. Silvio Micali and Leonid Reyzin. 2004. Physically observable cryptography (extended abstract). In TCC 2004: 1st Theory of Cryptography Conference, Moni Naor (Ed.). Lecture Notes in Computer Science, Vol. 2951, Springer, Heidelberg, 278--296."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69903-3_1"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_2"},{"key":"e_1_2_1_60_1","volume-title":"Advances in Cryptology -- EUROCRYPT \u201996, Ueli M","author":"Ogata Wakaha","unstructured":"Wakaha Ogata and Kaoru Kurosawa . 1996. Optimum secret sharing scheme secure against cheating . In Advances in Cryptology -- EUROCRYPT \u201996, Ueli M . Maurer (Ed.). Lecture Notes in Computer Science, Vol. 1070 , Springer , Heidelberg, Germany, Saragossa, Spain, 200--211. Wakaha Ogata and Kaoru Kurosawa. 1996. Optimum secret sharing scheme secure against cheating. In Advances in Cryptology -- EUROCRYPT \u201996, Ueli M. Maurer (Ed.). Lecture Notes in Computer Science, Vol. 1070, Springer, Heidelberg, Germany, Saragossa, Spain, 200--211."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00283-8"},{"key":"e_1_2_1_62_1","volume-title":"Wyner","author":"Ozarow Lawrence H.","year":"1985","unstructured":"Lawrence H. Ozarow and Aaron D . Wyner . 1985 . Wire-tap channel II. In Advances in Cryptology (EUROCRYPT\u201984), Thomas Beth, Norbert Cot, and Ingemar Ingemarsson (Eds.). Lecture Notes in Computer Science, Vol. 209 , Springer , Heidelberg, 33--50. Lawrence H. Ozarow and Aaron D. Wyner. 1985. Wire-tap channel II. In Advances in Cryptology (EUROCRYPT\u201984), Thomas Beth, Norbert Cot, and Ingemar Ingemarsson (Eds.). Lecture Notes in Computer Science, Vol. 209, Springer, Heidelberg, 33--50."},{"key":"e_1_2_1_63_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology (EUROCRYPT'09), Antoine Joux (Ed.)","author":"Pietrzak Krzysztof","unstructured":"Krzysztof Pietrzak . 2009. A leakage-resilient mode of operation . In Advances in Cryptology (EUROCRYPT'09), Antoine Joux (Ed.) . Lecture Notes in Computer Science , Vol. 5479 , Springer , Heidelberg , 462--482. Krzysztof Pietrzak. 2009. A leakage-resilient mode of operation. In Advances in Cryptology (EUROCRYPT'09), Antoine Joux (Ed.). Lecture Notes in Computer Science, Vol. 5479, Springer, Heidelberg, 462--482."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_28"},{"key":"e_1_2_1_65_1","volume-title":"The 4h Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201993)","author":"Schmidt Jeanette P.","unstructured":"Jeanette P. Schmidt , Alan Siegel , and Aravind Srinivasan . 1993. Chernoff-Hoeffding bounds for applications with limited independence . In The 4h Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201993) . Society for Industrial and Applied Mathematics , Philadelphia , 331--340. Jeanette P. Schmidt, Alan Siegel, and Aravind Srinivasan. 1993. Chernoff-Hoeffding bounds for applications with limited independence. In The 4h Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201993). Society for Industrial and Applied Mathematics, Philadelphia, 331--340."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178432","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3178432","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3178432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:07Z","timestamp":1750210747000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,26]]},"references-count":67,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8,31]]}},"alternative-id":["10.1145\/3178432"],"URL":"https:\/\/doi.org\/10.1145\/3178432","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,26]]},"assertion":[{"value":"2015-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-04-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}