{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T15:32:59Z","timestamp":1768923179166,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,19]],"date-time":"2016-06-19T00:00:00Z","timestamp":1466294400000},"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":[[2016,6,19]]},"DOI":"10.1145\/2897518.2897657","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:04:07Z","timestamp":1465563847000},"page":"1128-1141","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":58,"title":["Textbook non-malleable commitments"],"prefix":"10.1145","author":[{"given":"Vipul","family":"Goyal","sequence":"first","affiliation":[{"name":"Microsoft Research, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omkant","family":"Pandey","sequence":"additional","affiliation":[{"name":"Drexel University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silas","family":"Richelson","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"TCC","author":"Divesh Aggarwal AAG","year":"2016","unstructured":"{ AAG + 16} Divesh Aggarwal , Shashank Agrawal , Divya Gupta , Hemanta Maji , Omkant Pandey , and Manoj Prabhakaran . Optimal computational split-state non-malleable codes . In TCC , 2016 . {AAG + 16} Divesh Aggarwal, Shashank Agrawal, Divya Gupta, Hemanta Maji, Omkant Pandey, and Manoj Prabhakaran. Optimal computational split-state non-malleable codes. In TCC, 2016."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746544"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591804"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652129"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813721"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the International Congress of Mathematicians","author":"Blum Manuel","year":"1986","unstructured":"{Blu86} Manuel Blum . How to prove a theorem so no one else can claim it . In Proceedings of the International Congress of Mathematicians , Berkeley, CA, pages 1444\u20131451 , 1986 . {Blu86} Manuel Blum. How to prove a theorem so no one else can claim it. In Proceedings of the International Congress of Mathematicians, Berkeley, CA, pages 1444\u20131451, 1986."},{"key":"e_1_3_2_1_7_1","volume-title":"Non-malleable extractors and codes, with their many tampered extensions. CoRR, abs\/1505.00107","author":"Chattopadhyay Eshan","year":"2015","unstructured":"{CGL15} Eshan Chattopadhyay , Vipul Goyal , and Xin Li . Non-malleable extractors and codes, with their many tampered extensions. CoRR, abs\/1505.00107 , 2015 . {CGL15} Eshan Chattopadhyay, Vipul Goyal, and Xin Li. Non-malleable extractors and codes, with their many tampered extensions. CoRR, abs\/1505.00107, 2015."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"{CGMO09} \n      Nishanth\n      Chandran Vipul\n      Goyal Ryan\n      Moriarty and \n      Rafail\n      Ostrovsky\n    .\n  Position based cryptography\n  . In Shai Halevi editor CRYPTO volume \n  5677\n   of \n  Lecture Notes in Computer Science pages 391\u2013\n  407\n  . Springer 2009.  {CGMO09} Nishanth Chandran Vipul Goyal Ryan Moriarty and Rafail Ostrovsky. Position based cryptography. In Shai Halevi editor CRYPTO volume 5677 of Lecture Notes in Computer Science pages 391\u2013407. Springer 2009.","DOI":"10.1007\/978-3-642-03356-8_23"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509980"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.40"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103474"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_14"},{"key":"e_1_3_2_1_13_1","first-page":"452","volume-title":"Tsinghua University","author":"Dziembowski Stefan","year":"2010","unstructured":"{DPW10} Stefan Dziembowski , Krzysztof Pietrzak , and Daniel Wichs . Non-malleable codes. In Innovations in Computer Science - ICS 2010 , Tsinghua University , Beijing, China , January 5-7, 2010 . Proceedings, pages 434\u2013 452 , 2010. {DPW10} Stefan Dziembowski, Krzysztof Pietrzak, and Daniel Wichs. Non-malleable codes. In Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 5-7, 2010. Proceedings, pages 434\u2013452, 2010."},{"key":"e_1_3_2_1_14_1","first-page":"544","volume-title":"9th Annual International Cryptology Conference","author":"Feige Uriel","year":"1989","unstructured":"{FS89} Uriel Feige and Adi Shamir . Zero knowledge proofs of knowledge in two rounds. In Advances in Cryptology - CRYPTO \u201989 , 9th Annual International Cryptology Conference , Santa Barbara, California, USA , August 20-24, 1989 , Proceedings, pages 526\u2013 544 , 1989. {FS89} Uriel Feige and Adi Shamir. Zero knowledge proofs of knowledge in two rounds. In Advances in Cryptology - CRYPTO \u201989, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings, pages 526\u2013544, 1989."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100272"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791220688"},{"key":"e_1_3_2_1_17_1","first-page":"60","volume-title":"FOCS","author":"Goyal Vipul","unstructured":"{GLOV12} Vipul Goyal , Chen-Kuei Lee , Rafail Ostrovsky , and Ivan Visconti . Constructing non-malleable commitments: A black-box approach . In FOCS , pages 51\u2013 60 . IEEE Computer Society, 2012. {GLOV12} Vipul Goyal, Chen-Kuei Lee, Rafail Ostrovsky, and Ivan Visconti. Constructing non-malleable commitments: A black-box approach. In FOCS, pages 51\u201360. IEEE Computer Society, 2012."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993729"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.13"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250794"},{"key":"e_1_3_2_1_23_1","series-title":"Lecture Notes in Computer Science","first-page":"368","volume-title":"Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference","author":"Kiyoshima Susumu","year":"2014","unstructured":"{Kiy14} Susumu Kiyoshima . Round-e\ufb03cient black-box construction of composable multi-party computation . In Juan A. Garay and Rosario Gennaro, editors, Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference , Santa Barbara, CA, USA , August 17-21, 2014 , Proceedings, Part II, volume 8617 of Lecture Notes in Computer Science , pages 351\u2013 368 . Springer, 2014. {Kiy14} Susumu Kiyoshima. Round-e\ufb03cient black-box construction of composable multi-party computation. In Juan A. Garay and Rosario Gennaro, editors, Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II, volume 8617 of Lecture Notes in Computer Science, pages 351\u2013368. Springer, 2014."},{"key":"e_1_3_2_1_24_1","series-title":"Lecture Notes in Computer Science","first-page":"367","volume-title":"Theory of Cryptography - 11th Theory of Cryptography Conference, TCC","author":"Kiyoshima Susumu","year":"2014","unstructured":"{KMO14} Susumu Kiyoshima , Yoshifumi Manabe , and Tatsuaki Okamoto . Constant-round black-box construction of composable multi-party computation protocol . In Yehuda Lindell, editor, Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014 , San Diego, CA , USA, February 24-26, 2014. Proceedings , volume 8349 of Lecture Notes in Computer Science , pages 343\u2013 367 . Springer, 2014. {KMO14} Susumu Kiyoshima, Yoshifumi Manabe, and Tatsuaki Okamoto. Constant-round black-box construction of composable multi-party computation protocol. In Yehuda Lindell, editor, Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings, volume 8349 of Lecture Notes in Computer Science, pages 343\u2013367. Springer, 2014."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536442"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993730"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_27"},{"key":"e_1_3_2_1_28_1","first-page":"588","volume-title":"5th Theory of Cryptography Conference, TCC 2008","author":"Lin Huijia","year":"2008","unstructured":"{LPV08} Huijia Lin , Rafael Pass , and Muthuramakrishnan Venkitasubramaniam . Concurrent Non-malleable Commitments from Any One-Way Function. In Theory of Cryptography , 5th Theory of Cryptography Conference, TCC 2008 , pages 571\u2013 588 , 2008 . {LPV08} Huijia Lin, Rafael Pass, and Muthuramakrishnan Venkitasubramaniam. Concurrent Non-malleable Commitments from Any One-Way Function. In Theory of Cryptography, 5th Theory of Cryptography Conference, TCC 2008, pages 571\u2013588, 2008."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536441"},{"key":"e_1_3_2_1_30_1","first-page":"365","volume-title":"CRYPTO","author":"Lapidot Dror","year":"1990","unstructured":"{LS90} Dror Lapidot and Adi Shamir . Publicly verifiable non-interactive zero-knowledge proofs . In CRYPTO , pages 353\u2013 365 , 1990 . {LS90} Dror Lapidot and Adi Shamir. Publicly verifiable non-interactive zero-knowledge proofs. In CRYPTO, pages 353\u2013365, 1990."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_19"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_4"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.27"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060670"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_32"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.87"}],"event":{"name":"STOC '16: Symposium on Theory of Computing","location":"Cambridge MA USA","acronym":"STOC '16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897657","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:58Z","timestamp":1750222558000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897657"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,19]]},"references-count":37,"alternative-id":["10.1145\/2897518.2897657","10.1145\/2897518"],"URL":"https:\/\/doi.org\/10.1145\/2897518.2897657","relation":{},"subject":[],"published":{"date-parts":[[2016,6,19]]},"assertion":[{"value":"2016-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}