{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:50:52Z","timestamp":1769316652587,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3519972","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"1364-1377","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Rate one-third non-malleable codes"],"prefix":"10.1145","author":[{"given":"Divesh","family":"Aggarwal","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Bhavana","family":"Kanukurthi","sequence":"additional","affiliation":[{"name":"IISc Bangalore, India"}]},{"given":"Sai Lakshmi Bhavana","family":"Obbattu","sequence":"additional","affiliation":[{"name":"Microsoft Research, India"}]},{"given":"Maciej","family":"Obremski","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Sruthi","family":"Sekar","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.10.015"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_15"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541513"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_18"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746544"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591804"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46494-6_17"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70503-3_10"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00122"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36400-5_4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46494-6_16"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_20"},{"key":"e_1_3_2_1_13_1","volume-title":"Decision Trees, and Streaming Space-Bounded Tampering. In Advances in Cryptology \u2013 EUROCRYPT","author":"Ball Marshall","year":"2018","unstructured":"Marshall Ball , Dana Dachman-Soled , Mukul Kulkarni , and Tal Malkin . 2018. Non-malleable Codes from Average-Case Hardness: AC ^0 , Decision Trees, and Streaming Space-Bounded Tampering. In Advances in Cryptology \u2013 EUROCRYPT 2018 , Jesper Buus Nielsen and Vincent Rijmen (Eds.). Springer International Publishing , Cham. 618\u2013650. Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, and Tal Malkin. 2018. Non-malleable Codes from Average-Case Hardness: AC ^0, Decision Trees, and Streaming Space-Bounded Tampering. In Advances in Cryptology \u2013 EUROCRYPT 2018, Jesper Buus Nielsen and Vincent Rijmen (Eds.). Springer International Publishing, Cham. 618\u2013650."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052259"},{"key":"e_1_3_2_1_15_1","volume-title":"ICALP (LIPIcs","volume":"14","author":"Chandran Nishanth","year":"2016","unstructured":"Nishanth Chandran , Vipul Goyal , Pratyay Mukherjee , Omkant Pandey , and Jalaj Upadhyay . 2016 . Block-Wise Non-Malleable Codes . In ICALP (LIPIcs , Vol. 55). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 31:1\u201331: 14 . Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, and Jalaj Upadhyay. 2016. Block-Wise Non-Malleable Codes. In ICALP (LIPIcs, Vol. 55). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 31:1\u201331:14."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_14"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897547"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35423-7_16"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Eshan Chattopadhyay and Xin Li. 2017. Non-malleable codes and extractors for small-depth circuits and affine functions. In STOC. ACM 1171\u20131184.  Eshan Chattopadhyay and Xin Li. 2017. Non-malleable codes and extractors for small-depth circuits and affine functions. In STOC. ACM 1171\u20131184.","DOI":"10.1145\/3055399.3055483"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.40"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554814"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54242-8_19"},{"key":"e_1_3_2_1_23_1","volume-title":"Shorter, Stronger. In Theory of Cryptography","author":"Coretti Sandro","unstructured":"Sandro Coretti , Yevgeniy Dodis , Bj\u00f6rn Tackmann , and Daniele Venturi . 2016. Non-Malleable Encryption: Simpler , Shorter, Stronger. In Theory of Cryptography , Eyal Kushilevitz and Tal Malkin (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 306\u2013335. isbn:978-3-662-49096-9 Sandro Coretti, Yevgeniy Dodis, Bj\u00f6rn Tackmann, and Daniele Venturi. 2016. Non-Malleable Encryption: Simpler, Shorter, Stronger. In Theory of Cryptography, Eyal Kushilevitz and Tal Malkin (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 306\u2013335. isbn:978-3-662-49096-9"},{"key":"e_1_3_2_1_24_1","first-page":"324","article-title":"From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes","volume":"2014","author":"Coretti Sandro","year":"2014","unstructured":"Sandro Coretti , Ueli Maurer , Bj\u00f6rn Tackmann , and Daniele Venturi . 2014 . From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes . IACR Cryptology ePrint Archive , 2014 (2014), 324 . http:\/\/eprint.iacr.org\/2014\/324 Sandro Coretti, Ueli Maurer, Bj\u00f6rn Tackmann, and Daniele Venturi. 2014. From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes. IACR Cryptology ePrint Archive, 2014 (2014), 324. http:\/\/eprint.iacr.org\/2014\/324","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2019.05.001"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-018-9306-z"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2200290"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"e_1_3_2_1_29_1","first-page":"78","article-title":"Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model","volume":"24","author":"D\u00f6ttling Nico","year":"2017","unstructured":"Nico D\u00f6ttling , Jesper Buus Nielsen , and Maciej Obremski . 2017 . Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model . Electronic Colloquium on Computational Complexity (ECCC) , 24 (2017), 78 . https:\/\/eccc.weizmann.ac.il\/report\/2017\/078 Nico D\u00f6ttling, Jesper Buus Nielsen, and Maciej Obremski. 2017. Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model. Electronic Colloquium on Computational Complexity (ECCC), 24 (2017), 78. https:\/\/eccc.weizmann.ac.il\/report\/2017\/078","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_14"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.35"},{"key":"e_1_3_2_1_32_1","volume-title":"Tsinghua University","author":"Dziembowski Stefan","year":"2010","unstructured":"Stefan Dziembowski , Krzysztof Pietrzak , and Daniel Wichs . 2010 . Non-Malleable Codes. In Innovations in Computer Science - ICS 2010 , Tsinghua University , Beijing, China , January 5-7, 2010. Proceedings. 434\u2013452. http:\/\/conference.itcs.tsinghua.edu.cn\/ICS2010\/content\/papers\/34.html Stefan Dziembowski, Krzysztof Pietrzak, and Daniel Wichs. 2010. Non-Malleable Codes. In Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 5-7, 2010. Proceedings. 434\u2013452. http:\/\/conference.itcs.tsinghua.edu.cn\/ICS2010\/content\/papers\/34.html"},{"key":"e_1_3_2_1_33_1","volume-title":"CRYPTO (2) (Lecture Notes in Computer Science","author":"Faust Sebastian","unstructured":"Sebastian Faust , Kristina Host\u00e1kov\u00e1 , Pratyay Mukherjee , and Daniele Venturi . 2017. Non-Malleable Codes for Space-Bounded Tampering . In CRYPTO (2) (Lecture Notes in Computer Science , Vol. 10402). Springer, 95\u2013 126 . Sebastian Faust, Kristina Host\u00e1kov\u00e1, Pratyay Mukherjee, and Daniele Venturi. 2017. Non-Malleable Codes for Space-Bounded Tampering. In CRYPTO (2) (Lecture Notes in Computer Science, Vol. 10402). Springer, 95\u2013126."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54242-8_20"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188872"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897657"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05378-9_17"},{"key":"e_1_3_2_1_38_1","volume-title":"IEEE Conference on Computational Complexity. 96\u2013108","author":"Guruswami Venkatesan","unstructured":"Venkatesan Guruswami , Christopher Umans , and Salil P. Vadhan . 2007. Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes . In IEEE Conference on Computational Complexity. 96\u2013108 . Venkatesan Guruswami, Christopher Umans, and Salil P. Vadhan. 2007. Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. In IEEE Conference on Computational Complexity. 96\u2013108."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46494-6_19"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48285-7_1"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70503-3_11"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_19"},{"key":"e_1_3_2_1_43_1","volume-title":"Non-Malleable Codes and Independent Source Extractors. In Symposium on Theory of Computing, STOC 2017","author":"Li Xin","year":"2017","unstructured":"Xin Li . 2017 . Improved Non-Malleable Extractors , Non-Malleable Codes and Independent Source Extractors. In Symposium on Theory of Computing, STOC 2017 , Montreal, Canada , June 19-23, 2017. Xin Li. 2017. Improved Non-Malleable Extractors, Non-Malleable Codes and Independent Source Extractors. In Symposium on Theory of Computing, STOC 2017, Montreal, Canada, June 19-23, 2017."},{"key":"e_1_3_2_1_44_1","volume-title":"Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions. In Computational Complexity Conference, CCC 2019","author":"Li Xin","year":"2019","unstructured":"Xin Li . 2019 . Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions. In Computational Complexity Conference, CCC 2019 , New Brunswick , June 18-20, 2019. Xin Li. 2019. Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions. In Computational Complexity Conference, CCC 2019, New Brunswick, June 18-20, 2019."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_8"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_30"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_17"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519972","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3519972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:38Z","timestamp":1750268978000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":47,"alternative-id":["10.1145\/3519935.3519972","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3519972","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}