{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:43:00Z","timestamp":1768920180430,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1526952, 1412958"],"award-info":[{"award-number":["1526952, 1412958"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055483","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"1171-1184","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Non-malleable codes and extractors for small-depth circuits, and affine functions"],"prefix":"10.1145","author":[{"given":"Eshan","family":"Chattopadhyay","sequence":"first","affiliation":[{"name":"IAS, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Li","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"D. Aggarwal Y. Dodis T. Kazana and M. Obremski. 2015. Non-malleable Reductions and Applications. (2015).  D. Aggarwal Y. Dodis T. Kazana and M. Obremski. 2015. Non-malleable Reductions and Applications. (2015).","DOI":"10.1145\/2746539.2746544"},{"key":"e_1_3_2_2_2_1","unstructured":"To appear in STOC.  To appear in STOC."},{"key":"e_1_3_2_2_3_1","unstructured":"Divesh Aggarwal Yevgeniy Dodis and Shachar Lovett. 2014.  Divesh Aggarwal Yevgeniy Dodis and Shachar Lovett. 2014."},{"key":"e_1_3_2_2_4_1","unstructured":"Non-malleable Codes from Additive Combinatorics. In STOC.  Non-malleable Codes from Additive Combinatorics. In STOC."},{"key":"e_1_3_2_2_5_1","unstructured":"Shashank Agrawal Divya Gupta Hemanta K. Maji Omkant Pandey and Manoj Prabhakaran. 2015.  Shashank Agrawal Divya Gupta Hemanta K. Maji Omkant Pandey and Manoj Prabhakaran. 2015."},{"key":"e_1_3_2_2_6_1","volume-title":"TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I. 375\u2013397","author":"le Codes Against A Rate-Optimizing"},{"key":"e_1_3_2_2_7_1","unstructured":"Noga Alon Jehoshua Bruck Joseph Naor Moni Naor and Ron M. Roth. 1992.  Noga Alon Jehoshua Bruck Joseph Naor Moni Naor and Ron M. Roth. 1992."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.119713"},{"key":"e_1_3_2_2_9_1","unstructured":"Marshall Ball Dana Dachman-Soled Mukul Kulkarni and Tal Malkin. 2016.  Marshall Ball Dana Dachman-Soled Mukul Kulkarni and Tal Malkin. 2016."},{"key":"e_1_3_2_2_10_1","unstructured":"Non-Malleable Codes for Bounded Depth Bounded Fan-in Circuits. In TCC.  Non-Malleable Codes for Bounded Depth Bounded Fan-in Circuits. In TCC."},{"key":"e_1_3_2_2_11_1","unstructured":"Jean Bourgain. 2007.  Jean Bourgain. 2007."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-006-0585-4"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897547"},{"key":"e_1_3_2_2_14_1","unstructured":"Eshan Chattopadhyay and Xin Li. 2016.  Eshan Chattopadhyay and Xin Li. 2016."},{"key":"e_1_3_2_2_15_1","unstructured":"Explicit Non-Malleable Extractors Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols. Electronic Colloquium on Computational Complexity (ECCC) (2016). http:\/\/eccc. hpiweb.de\/report\/2016\/036  Explicit Non-Malleable Extractors Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols. Electronic Colloquium on Computational Complexity (ECCC) (2016). http:\/\/eccc. hpiweb.de\/report\/2016\/036"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897643"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.40"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897528"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554814"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Mahdi Cheraghchi and Venkatesan Guruswami. 2014. Non-malleable Coding against Bit-Wise and Split-State Tampering. In TCC. 440\u2013464.  Mahdi Cheraghchi and Venkatesan Guruswami. 2014. Non-malleable Coding against Bit-Wise and Split-State Tampering. In TCC. 440\u2013464.","DOI":"10.1007\/978-3-642-54242-8_19"},{"key":"e_1_3_2_2_21_1","unstructured":"Benny Chor and Oded Goldreich. 1988.  Benny Chor and Oded Goldreich. 1988."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217015"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.57"},{"key":"e_1_3_2_2_24_1","unstructured":"Gil Cohen. 2016.  Gil Cohen. 2016."},{"key":"e_1_3_2_2_25_1","unstructured":"Making the Most of Advice: New Correlation Breakers and Their Applications. Electronic Colloquium on Computational Complexity (ECCC) (2016). http:\/\/eccc.hpiweb.de\/report\/2016\/052  Making the Most of Advice: New Correlation Breakers and Their Applications. Electronic Colloquium on Computational Complexity (ECCC) (2016). http:\/\/eccc.hpiweb.de\/report\/2016\/052"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2982445.2982453"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","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 EUROCRYPT. 471\u2013488.   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 EUROCRYPT. 471\u2013488.","DOI":"10.1007\/978-3-540-78967-3_27"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536496"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Stefan Dziembowski Tomasz Kazana and Maciej Obremski. 2013. Non-malleable Codes from Two-Source Extractors. In CRYPTO (2). 239\u2013257.  Stefan Dziembowski Tomasz Kazana and Maciej Obremski. 2013. Non-malleable Codes from Two-Source Extractors. In CRYPTO (2). 239\u2013257.","DOI":"10.1007\/978-3-642-40084-1_14"},{"key":"e_1_3_2_2_30_1","unstructured":"Stefan Dziembowski and Krzysztof Pietrzak. 2007.  Stefan Dziembowski and Krzysztof Pietrzak. 2007."},{"key":"e_1_3_2_2_31_1","volume-title":"Secret Sharing. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS \u201907)","author":"Intrusion-Resilient"},{"key":"e_1_3_2_2_32_1","unstructured":"Stefan Dziembowski Krzysztof Pietrzak and Daniel Wichs. 2010. Non-Malleable Codes. In ICS. 434\u2013452.  Stefan Dziembowski Krzysztof Pietrzak and Daniel Wichs. 2010. Non-Malleable Codes. In ICS. 434\u2013452."},{"key":"e_1_3_2_2_33_1","unstructured":"Sebastian Faust Pratyay Mukherjee Daniele Venturi and Daniel Wichs. 2014.  Sebastian Faust Pratyay Mukherjee Daniele Venturi and Daniel Wichs. 2014."},{"key":"e_1_3_2_2_34_1","unstructured":"Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits. Springer Berlin Heidelberg Berlin Heidelberg 111\u2013128. DOI:https:\/\/  Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits. Springer Berlin Heidelberg Berlin Heidelberg 111\u2013128. DOI:https:\/\/"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"e_1_3_2_2_36_1","unstructured":"Johan Hastad. 1987.  Johan Hastad. 1987."},{"key":"e_1_3_2_2_37_1","unstructured":"Computational Limitations of Small-depth Circuits. MIT Press Cambridge MA USA.   Computational Limitations of Small-depth Circuits. MIT Press Cambridge MA USA."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.19"},{"key":"e_1_3_2_2_39_1","unstructured":"Xin Li. 2015.  Xin Li. 2015."},{"key":"e_1_3_2_2_40_1","unstructured":"Improved Two-Source Extractors and Affine Extractors for Polylogarithmic Entropy. Technical Report TR15-125. ECCC.  Improved Two-Source Extractors and Affine Extractors for Polylogarithmic Entropy. Technical Report TR15-125. ECCC."},{"key":"e_1_3_2_2_41_1","unstructured":"Xin Li. 2015.  Xin Li. 2015."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.58"},{"key":"e_1_3_2_2_43_1","unstructured":"Xin Li. 2016.  Xin Li. 2016."},{"key":"e_1_3_2_2_44_1","unstructured":"Improved non-malleable extractors non-malleable codes and independent source extractors. arXiv preprint arXiv:1608.00127 (2016).  Improved non-malleable extractors non-malleable codes and independent source extractors. arXiv preprint arXiv:1608.00127 (2016)."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.36"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1824"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Luca Trevisan. 2001. Extractors and Pseudorandom Generators. (2001) 860\u2013879.  Luca Trevisan. 2001. Extractors and Pseudorandom Generators. (2001) 860\u2013879.","DOI":"10.1145\/502090.502099"},{"key":"e_1_3_2_2_48_1","unstructured":"Emanuele Viola. 2011.  Emanuele Viola. 2011."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.20"},{"key":"e_1_3_2_2_50_1","unstructured":"Emanuele Viola. 2014.  Emanuele Viola. 2014."},{"key":"e_1_3_2_2_51_1","first-page":"2","volume":"43","author":"Extractors","year":"2014","journal-title":"Circuit Sources. SIAM J. Comput."},{"key":"e_1_3_2_2_52_1","unstructured":"D. Zuckerman. 1990.  D. Zuckerman. 1990."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89574"},{"key":"e_1_3_2_2_54_1","unstructured":"David Zuckerman. 1997.  David Zuckerman. 1997."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199712)11:4%3C345::AID-RSA4%3E3.0.CO;2-Z"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055483","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055483","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:19Z","timestamp":1750217779000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":55,"alternative-id":["10.1145\/3055399.3055483","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055483","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}