{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:06:55Z","timestamp":1768918015226,"version":"3.49.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385445","type":"print"},{"value":"9783031385452","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38545-2_19","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:02:27Z","timestamp":1691521347000},"page":"580-610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extractors: Low Entropy Requirements Colliding with\u00a0Non-malleability"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3841-0262","authenticated-orcid":false,"given":"Divesh","family":"Aggarwal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0048-4610","authenticated-orcid":false,"given":"Eldon","family":"Chung","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4174-0438","authenticated-orcid":false,"given":"Maciej","family":"Obremski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-030-26951-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Aggarwal","year":"2019","unstructured":"Aggarwal, D., et al.: Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 510\u2013539. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_18"},{"key":"19_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 Symposium on Theory of Computing, pp. 459\u2013468. STOC 2015, Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2746539.2746544","DOI":"10.1145\/2746539.2746544"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/140985251","volume":"47","author":"D Aggarwal","year":"2018","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. SIAM J. Comput. 47(2), 524\u2013546 (2018)","journal-title":"SIAM J. Comput."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Hosseini, K., Lovett, S.: Affine-malleable extractors, spectrum doubling, and application to privacy amplification. In: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 2913\u20132917. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541832"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Kanukurthi, B., Obbattu, S.L.B., Obremski, M., Sekar, S.: Rate one-third non-malleable codes. Cryptology ePrint Archive, Report 2021\/1042 (2021)","DOI":"10.1145\/3519935.3519972"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Obremski, M.: A constant rate non-malleable code in the split-state model. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1285\u20131294. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00122"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Obremski, M., Ribeiro, J., Simkin, M., Siniscalchi, L.: Privacy amplification with tamperable memory via non-malleable two-source extractors. IEEE Transactions on Information Theory (2022)","DOI":"10.1109\/TIT.2022.3167404"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Alon, N., Goldreich, O., Hastad, J., Peralta, R.: Simple construction of almost k-wise independent random variables. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, vol. 2, pp. 544\u2013553 (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89575","DOI":"10.1109\/FSCS.1990.89575"},{"key":"19_CR9","unstructured":"Ben-Aroya, A., Chattopadhyay, E., Doron, D., Li, X., Ta-Shma, A.: A new approach for constructing low-error, two-source extractors. In: Proceedings of the 33rd Computational Complexity Conference, pp. 1\u201319. CCC 2018, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Germany (2018)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Aroya, A., Doron, D., Ta-Shma, A.: An efficient reduction from two-source to non-malleable extractors: Achieving near-logarithmic min-entropy. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1185\u20131194. STOC 2017, Association for Computing Machinery, New York, NY, USA (2017)","DOI":"10.1145\/3055399.3055423"},{"issue":"01","key":"19_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793042105000108","volume":"1","author":"J Bourgain","year":"2005","unstructured":"Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. Int. J. Number Theory 1(01), 1\u201332 (2005)","journal-title":"Int. J. Number Theory"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Goyal, V., Li, X.: Non-malleable extractors and codes, with their many tampered extensions. In: Proceedings of the Forty-Eighth annual ACM symposium on Theory of Computing, pp. 285\u2013298. ACM (2016)","DOI":"10.1145\/2897518.2897547"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-030-35423-7_16","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2019","author":"E Chattopadhyay","year":"2019","unstructured":"Chattopadhyay, E., Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Privacy amplification from non-malleable codes. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 318\u2013337. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_16"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Zuckerman, D.: Explicit two-source extractors and resilient functions. Annal. Math. 189(3), 653\u2013705 (2019). https:\/\/www.jstor.org\/stable\/10.4007\/annals.2019.189.3.1","DOI":"10.4007\/annals.2019.189.3.1"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00145-015-9219-z","volume":"30","author":"M Cheraghchi","year":"2017","unstructured":"Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. J. Cryptol. 30(1), 191\u2013241 (2017)","journal-title":"J. Cryptol."},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2), 230\u2013261 (1988)","journal-title":"SIAM J. Comput."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Cohen, G.: Towards optimal two-source extractors and Ramsey graphs. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1157\u20131170. STOC 2017, ACM, New York, NY, USA (2017)","DOI":"10.1145\/3055399.3055429"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/130908634","volume":"43","author":"G Cohen","year":"2014","unstructured":"Cohen, G., Raz, R., Segev, G.: Nonmalleable extractors with short seeds and applications to privacy amplification. SIAM J. Comput. 43(2), 450\u2013476 (2014)","journal-title":"SIAM J. Comput."},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-15317-4_9","volume-title":"Security and Cryptography for Networks","author":"F Dav\u00ec","year":"2010","unstructured":"Dav\u00ec, F., Dziembowski, S., Venturi, D.: Leakage-resilient storage. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 121\u2013137. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_9"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Li, X., Wooley, T.D., Zuckerman, D.: Privacy amplification and nonmalleable extractors via character sums. SIAM J. Comput. 43(2), 800\u2013830 (2014). https:\/\/doi.org\/10.1137\/120868414","DOI":"10.1137\/120868414"},{"issue":"1","key":"19_CR21","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":"19_CR22","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. STOC 2009, ACM, New York, NY, USA (2009)","DOI":"10.1145\/1536414.1536496"},{"key":"19_CR23","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":"19_CR24","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. J. ACM 65(4), 1\u201332 (2018)","DOI":"10.1145\/3178432"},{"key":"19_CR25","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, pp. 685\u2013698. STOC 2018, Association for Computing Machinery, New York, NY, USA (2018)","DOI":"10.1145\/3188745.3188872"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Richelson, S.: Textbook non-malleable commitments. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 1128\u20131141 (2016)","DOI":"10.1145\/2897518.2897657"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Goyal, V., Srinivasan, A., Zhu, C.: Multi-source non-malleable extractors and applications. In: Eurocrypt (2021)","DOI":"10.1007\/978-3-030-77886-6_16"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. J. ACM 56(4), 1\u201334 (2009)","DOI":"10.1145\/1538902.1538904"},{"issue":"4","key":"19_CR29","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1112\/S0025579319000238","volume":"65","author":"M Lewko","year":"2019","unstructured":"Lewko, M.: An explicit two-source extractor with min-entropy rate near $$4\/9$$. Mathematika 65(4), 950\u2013957 (2019). https:\/\/doi.org\/10.1112\/S0025579319000238","journal-title":"Mathematika"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Li, X.: Non-malleable extractors, two-source extractors and privacy amplification. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 688\u2013697. IEEE (2012)","DOI":"10.1109\/FOCS.2012.26"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Li, X.: Improved two-source extractors, and affine extractors for polylogarithmic entropy. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 168\u2013177 (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.26","DOI":"10.1109\/FOCS.2016.26"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Li, X.: Improved non-malleable extractors, non-malleable codes and independent source extractors. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1144\u20131156. ACM (2017)","DOI":"10.1145\/3055399.3055486"},{"key":"19_CR33","doi-asserted-by":"publisher","unstructured":"Li, X.: Non-malleable extractors and non-malleable codes: partially optimal constructions. In: Proceedings of the 34th Computational Complexity Conference. CCC 2019, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, DEU (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2019.28","DOI":"10.4230\/LIPIcs.CCC.2019.28"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Li, X.: Two source extractors for asymptotically optimal entropy, and (many) more (2023)","DOI":"10.1109\/FOCS57990.2023.00075"},{"key":"19_CR35","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"},{"key":"19_CR36","doi-asserted-by":"publisher","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167 (1994). https:\/\/doi.org\/10.1016\/S0022-0000(05)80043-1. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000005800431","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Obremski, M., Sk\u00f3rski, M.: Inverted leftover hash lemma. ISIT (2018)","DOI":"10.1109\/ISIT.2018.8437654"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak random seeds. In: Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, pp. 11\u201320. STOC 2005, ACM, New York, NY, USA (2005)","DOI":"10.1145\/1060590.1060593"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Raz, R., Reingold, O., Vadhan, S.: Extracting all the randomness and reducing the error in Trevisan\u2019s extractors. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 149\u2013158. STOC 1999, Association for Computing Machinery, New York, NY, USA (1999)","DOI":"10.1145\/301250.301292"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38545-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:03:11Z","timestamp":1753567391000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38545-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385445","9783031385452"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38545-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"479","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":"124","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":"26% - 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","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":"15","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)"}}]}}