{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:45:51Z","timestamp":1742913951392,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030053772"},{"type":"electronic","value":"9783030053789"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05378-9_17","type":"book-chapter","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T01:03:38Z","timestamp":1543971818000},"page":"307-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Non-malleable Codes Against Lookahead Tampering"],"prefix":"10.1007","author":[{"given":"Divya","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hemanta K.","family":"Maji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,5]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-662-49099-0_15","volume-title":"Theory of Cryptography","author":"D Aggarwal","year":"2016","unstructured":"Aggarwal, D., Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: Optimal computational split-state non-malleable codes. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 393\u2013417. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_15"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dodis, Y., Kazana, T., Obremski, M.: Non-malleable reductions and applications. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th Annual ACM Symposium on Theory of Computing, Portland, OR, USA, 14\u201317 June 2015, pp. 459\u2013468. ACM Press (2015)","DOI":"10.1145\/2746539.2746544"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. In: Shmoys, D.B. (ed.) 46th Annual ACM Symposium on Theory of Computing, New York, NY, USA, 31 May\u20133 June 2014, pp. 774\u2013783. ACM Press (2014)","DOI":"10.1145\/2591796.2591804"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-662-46494-6_16","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2015","unstructured":"Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 375\u2013397. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_16"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/978-3-662-49896-5_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Ball","year":"2016","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Non-malleable codes for bounded depth, bounded fan-in circuits. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 881\u2013908. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_31"},{"key":"17_CR6","unstructured":"Chandran, N., Goyal, V., Mukherjee, P., Pandey, O., Upadhyay, J.: Block-wise non-malleable codes. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages and Programming, ICALP 2016. LIPIcs, Rome, Italy, 11\u201315 July 2016, vol. 55, pp. 31:1\u201331:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Li, X.: Explicit non-malleable extractors, multi-source extractors, and almost optimal privacy amplification protocols. In: Dinur, I. (ed.) 57th Annual Symposium on Foundations of Computer Science, New Brunswick, NJ, USA, 9\u201311 October 2016, pp. 158\u2013167. IEEE Computer Society Press (2016)","DOI":"10.1109\/FOCS.2016.25"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Zuckerman, D.: Non-malleable codes against constant split-state tampering. In: 55th Annual Symposium on Foundations of Computer Science, Philadelphia, PA, USA, 18\u201321 October 2014, pp. 306\u2013315. IEEE Computer Society Press (2014)","DOI":"10.1109\/FOCS.2014.40"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Guruswami, V.: Capacity of non-malleable codes. CoRR, abs\/1309.0458 (2013)","DOI":"10.1145\/2554797.2554814"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Guruswami, V.: Capacity of non-malleable codes. In: Naor, M. (ed.) 5th Innovations in Theoretical Computer Science, ITCS 2014, Princeton, NJ, USA, 12\u201314 January 2014, pp. 155\u2013168. Association for Computing Machinery (2014)","DOI":"10.1145\/2554797.2554814"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-642-54242-8_19","volume-title":"Theory of Cryptography","author":"M Cheraghchi","year":"2014","unstructured":"Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 440\u2013464. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_19"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R Cramer","year":"2008","unstructured":"Cramer, R., Dodis, Y., Fehr, S., Padr\u00f3, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471\u2013488. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_27"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-40084-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Dziembowski","year":"2013","unstructured":"Dziembowski, S., Kazana, T., Obremski, M.: Non-malleable codes from two-source extractors. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 239\u2013257. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_14"},{"key":"17_CR15","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: Yao, A.-C.-C. (ed.) 1st Innovations in Computer Science, ICS 2010, Tsinghua University, Beijing, China, 5\u20137 January 2010, pp. 434\u2013452. Tsinghua University Press (2010)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-55220-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Faust","year":"2014","unstructured":"Faust, S., Mukherjee, P., Venturi, D., Wichs, D.: Efficient non-malleable codes and key-derivation for poly-size tampering circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 111\u2013128. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_7"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, 25\u201329 June 2018 (2018)","DOI":"10.1145\/3188745.3188872"},{"key":"17_CR18","unstructured":"Gupta, D., Maji, H.K., Wang, M.: Non-malleable codes against lookahead tampering. Cryptology ePrint Archive, report 2017\/1048 (2017). https:\/\/eprint.iacr.org\/2017\/1048"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Umans, C., Vadhan, S.P.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13\u201316 June 2007, San Diego, California, USA, pp. 96\u2013108 (2007)","DOI":"10.1109\/CCC.2007.38"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-319-70503-3_11","volume-title":"Theory of Cryptography","author":"B Kanukurthi","year":"2017","unstructured":"Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Four-state non-malleable codes with explicit constant rate. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 344\u2013375. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_11"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-319-78372-7_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Kanukurthi","year":"2018","unstructured":"Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Non-malleable randomness encoders and\u00a0their applications. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 589\u2013617. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_19"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Li, X.: Improved non-malleable extractors, non-malleable codes and independent source extractors. In: Hatami, H., McKenzie, P., King, V. (eds.) 49th Annual ACM Symposium on Theory of Computing, Montreal, QC, Canada, 19\u201323 June 2017, pp. 1144\u20131156. ACM Press (2017)","DOI":"10.1145\/3055399.3055486"},{"key":"17_CR23","unstructured":"Li, X.: Pseudorandom correlation breakers, independence preserving mergers and their applications. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 25, p. 28 (2018)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: Pseudorandomness. Foundations and Trends in Theoretical Computer Science. Now Publishers (2012)","DOI":"10.1561\/9781601985958"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05378-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:49:31Z","timestamp":1709822971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05378-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030053772","9783030053789"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05378-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"5 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Delhi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isical.ac.in\/~indocrypt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}