{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:15:11Z","timestamp":1768918511691,"version":"3.49.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030354220","type":"print"},{"value":"9783030354237","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35423-7_16","type":"book-chapter","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:02:46Z","timestamp":1575849766000},"page":"318-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Privacy Amplification from Non-malleable Codes"],"prefix":"10.1007","author":[{"given":"Eshan","family":"Chattopadhyay","sequence":"first","affiliation":[]},{"given":"Bhavana","family":"Kanukurthi","sequence":"additional","affiliation":[]},{"given":"Sai Lakshmi Bhavana","family":"Obbattu","sequence":"additional","affiliation":[]},{"given":"Sruthi","family":"Sekar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,19]]},"reference":[{"key":"16_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, Part II. LNCS, vol. 9563, pp. 393\u2013417. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_15"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Dodis, Y., Kazana, T., Obremski, M.: Non-malleable reductions and applications. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14\u201317 June 2015, pp. 459\u2013468 (2015). https:\/\/doi.org\/10.1145\/2746539.2746544","DOI":"10.1145\/2746539.2746544"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. In: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, 31 May\u201303 June 2014, pp. 774\u2013783 (2014). https:\/\/doi.org\/10.1145\/2591796.2591804","DOI":"10.1145\/2591796.2591804"},{"key":"16_CR4","unstructured":"Aggarwal, D., Obremski, M.: Inception makes non-malleable codes shorter as well! IACR Cryptology ePrint Archive 2019\/399 (2019). https:\/\/eprint.iacr.org\/2019\/399"},{"key":"16_CR5","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, Part I. LNCS, vol. 9014, pp. 375\u2013397. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_16"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C Bennett","year":"1988","unstructured":"Bennett, C., Brassard, G., Robert, J.M.: Privacy amplification by public discussion. SIAM J. Comput. 17(2), 210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"CH Bennett","year":"1995","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Maurer, U.M.: Generalized privacy amplification. IEEE Trans. Inf. Theory 41(6), 1915\u20131923 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Chandran, N., Kanukurthi, B., Ostrovsky, R., Reyzin, L.: Privacy amplification with asymptotically optimal entropy loss. In: Schulman, L.J. (ed.) Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5\u20138 June 2010, pp. 785\u2013794. ACM (2010). https:\/\/doi.org\/10.1145\/1806689.1806796","DOI":"10.1145\/1806689.1806796"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, E., Goyal, V., Li, X.: Non-malleable extractors and codes, with their many tampered extensions. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 285\u2013298 (2016). https:\/\/doi.org\/10.1145\/2897518.2897547","DOI":"10.1145\/2897518.2897547"},{"key":"16_CR10","unstructured":"Chattopadhyay, E., Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Privacy amplification from non-malleable codes. Cryptology ePrint Archive, Report 2018\/293 (2018). https:\/\/eprint.iacr.org\/2018\/293"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, E., Li, X.: Explicit non-malleable extractors, multi-source extractors, and almost optimal privacy amplification protocols. In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9\u201311 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pp. 158\u2013167 (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.25","DOI":"10.1109\/FOCS.2016.25"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, E., Zuckerman, D.: Non-malleable codes against constant split-state tampering. In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, 18\u201321 October 2014, pp. 306\u2013315 (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.40","DOI":"10.1109\/FOCS.2014.40"},{"key":"16_CR13","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":"16_CR14","doi-asserted-by":"publisher","unstructured":"Cohen, G.: Making the most of advice: new correlation breakers and their applications. In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9\u201311 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pp. 188\u2013196 (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.28","DOI":"10.1109\/FOCS.2016.28"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Cohen, G., Raz, R., Segev, G.: Non-malleable extractors with short seeds and applications to privacy amplification. In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, 26\u201329 June 2012, pp. 298\u2013308 (2012). https:\/\/doi.org\/10.1109\/CCC.2012.21","DOI":"10.1109\/CCC.2012.21"},{"key":"16_CR16","unstructured":"Dodis, Y., Spencer, J.: On the (non-)universality of the one-time pad. In: 43rd Annual Symposium on Foundations of Computer Science, pp. 376\u2013385. IEEE (2002)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11818175_14","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"Y Dodis","year":"2006","unstructured":"Dodis, Y., Katz, J., Reyzin, L., Smith, A.: Robust fuzzy extractors and authenticated key agreement from close secrets. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 232\u2013250. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_14"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Li, X., Wooley, T.D., Zuckerman, D.: Privacy amplification and non-malleable extractors via character sums. In: Ostrovsky, R. (ed.) IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, 22\u201325 October 2011, pp. 668\u2013677. IEEE (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.67","DOI":"10.1109\/FOCS.2011.67"},{"key":"16_CR19","doi-asserted-by":"crossref","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). arXiv:cs\/0602007","DOI":"10.1137\/060651380"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 601\u2013610, Bethesda, Maryland, 31 May\u20132 Jun 2009 (2009)","DOI":"10.1145\/1536414.1536496"},{"key":"16_CR21","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: Innovations in Computer Science - ICS 2010, Proceedings, Tsinghua University, Beijing, China, 5\u20137 January 2010, pp. 434\u2013452 (2010). http:\/\/conference.itcs.tsinghua.edu.cn\/ICS2010\/content\/papers\/34.html"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. IACR Cryptology ePrint Archive 2018\/316 (2018). https:\/\/eprint.iacr.org\/2018\/316","DOI":"10.1145\/3188745.3188872"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Goyal, V., Pandey, O., Richelson, S.: Textbook non-malleable commitments. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 1128\u20131141 (2016). https:\/\/doi.org\/10.1145\/2897518.2897657","DOI":"10.1145\/2897518.2897657"},{"key":"16_CR24","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, Part II. LNCS, vol. 10678, pp. 344\u2013375. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_11"},{"key":"16_CR25","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, Part III. LNCS, vol. 10822, pp. 589\u2013617. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_19"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-01001-9_12","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"B Kanukurthi","year":"2009","unstructured":"Kanukurthi, B., Reyzin, L.: Key agreement from close secrets over unsecured channels. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 206\u2013223. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_12"},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"Li, X.: Design extractors, non-malleable condensers and privacy amplification. In: Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19\u201322, 2012. pp. 837\u2013854 (2012). https:\/\/doi.org\/10.1145\/2213977.2214052, https:\/\/doi.org\/10.1145\/2213977.2214052","DOI":"10.1145\/2213977.2214052 10.1145\/2213977.2214052"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"Li, X.: Non-malleable extractors, two-source extractors and privacy amplification. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, 20\u201323 October 2012, pp. 688\u2013697 (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.26","DOI":"10.1109\/FOCS.2012.26"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-662-46494-6_21","volume-title":"Theory of Cryptography","author":"X Li","year":"2015","unstructured":"Li, X.: Non-malleable Condensers for arbitrary min-entropy, and almost optimal protocols for privacy amplification. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part I. LNCS, vol. 9014, pp. 502\u2013531. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_21"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Li, X.: Improved non-malleable extractors, non-malleable codes and independent source extractors. In: Symposium on Theory of Computing, STOC 2017, Montreal, Canada, 19\u201323 June 2017 (2017)","DOI":"10.1145\/3055399.3055486"},{"key":"16_CR31","unstructured":"Li, X.: Non-malleable extractors and non-malleable codes: partially optimal constructions. In: Computational Complexity Conference, CCC 2019, New Brunswick, 18\u201320 June 2019 (2019)"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/3-540-48071-4_32","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"UM Maurer","year":"1993","unstructured":"Maurer, U.M.: Protocols for secret key agreement by public discussion based on common information. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 461\u2013470. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_32"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BFb0052244","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"U Maurer","year":"1997","unstructured":"Maurer, U., Wolf, S.: Privacy amplification secure against active adversaries. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 307\u2013321. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052244"},{"issue":"1","key":"16_CR34","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci. 52(1), 43\u201353 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-45146-4_5","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Renner","year":"2003","unstructured":"Renner, R., Wolf, S.: Unconditional authenticity and privacy from an arbitrarily weak secret. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 78\u201395. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_5"},{"key":"16_CR36","unstructured":"Srinivasan, A.: Personal communication"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35423-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:46:26Z","timestamp":1709833586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35423-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030354220","9783030354237"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35423-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 November 2019","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":"Hyderabad","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isical.ac.in\/~indocrypt2019\/#\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.67","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Please note that there were 110 submissions, but 20 were not peer-reviewed because they were withdrawn before the deadline or they violated the submission policy.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}