{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T12:15:16Z","timestamp":1768911316926,"version":"3.49.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030176556","type":"print"},{"value":"9783030176563","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":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17656-3_16","type":"book-chapter","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:42:13Z","timestamp":1557794533000},"page":"442-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Quantum-Proof Non-malleable Extractor"],"prefix":"10.1007","author":[{"given":"Divesh","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"Kai-Min","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Han-Hsuan","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Vidick","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"key":"16_CR1","unstructured":"Aggarwal, D., Chung, K.-M., Lin, H.-H., Vidick, T.: A quantum-proof non-malleable extractor, with application to privacy amplification against active quantum adversaries. arXiv preprint arXiv:1710.00557 (2017)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-662-44381-1_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Aggarwal","year":"2014","unstructured":"Aggarwal, D., Dodis, Y., Jafargholi, Z., Miles, E., Reyzin, L.: Amplifying privacy in privacy amplification. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. Part II. LNCS, vol. 8617, pp. 183\u2013198. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_11"},{"key":"16_CR3","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"},{"issue":"6","key":"16_CR4","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"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"CH Bennett","year":"1988","unstructured":"Bennett, C.H., Brassard, G., Robert, J.-M.: Privacy amplification by public discussion. SIAM J. Comput. 17(2), 210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"key":"16_CR6","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R Bhatia","year":"1997","unstructured":"Bhatia, R.: Matrix Analysis. Graduate Texts in Mathematics. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-1-4612-0653-8"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-20465-4_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"NJ Bouman","year":"2011","unstructured":"Bouman, N.J., Fehr, S.: Secure authentication from a weak key, without leaking information. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 246\u2013265. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_15"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Chandran, N., Kanukurthi, B., Ostrovsky, R., Reyzin, L.: Privacy amplification with asymptotically optimal entropy loss. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5\u20138 June 2010, pp. 785\u2013794 (2010)","DOI":"10.1145\/1806689.1806796"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Goyal, V., Li, X.: Non-malleable extractors and codes, with their many tampered extensions. arXiv preprint arXiv:1505.00107 (2015)","DOI":"10.1145\/2897518.2897547"},{"key":"16_CR10","unstructured":"Chung, K.-M., Li, X., Wu, X.: Multi-source randomness extractors against quantum side information, and their applications (2014)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-49208-9_4","volume-title":"Quantum Computing and Quantum Communications","author":"R Cleve","year":"1999","unstructured":"Cleve, R., van Dam, W., Nielsen, M., Tapp, A.: Quantum entanglement and the communication complexity of the inner product function. In: Williams, C.P. (ed.) QCQC 1998. LNCS, vol. 1509, pp. 61\u201374. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49208-9_4"},{"key":"16_CR12","first-page":"183","volume":"22","author":"G Cohen","year":"2015","unstructured":"Cohen, G.: Non-malleable extractors - new tools and improved constructions. Electron. Colloq. Comput. Complex. (ECCC) 22, 183 (2015)","journal-title":"Electron. Colloq. Comput. Complex. (ECCC)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, G., Raz, R., Segev, G.: Non-malleable extractors with short seeds and applications to privacy amplification. In: 2012 IEEE 27th Annual Conference on Computational Complexity (CCC), pp. 298\u2013308. IEEE (2012)","DOI":"10.1109\/CCC.2012.21"},{"key":"16_CR14","unstructured":"Cohen, G., Vidick, T.: Privacy amplification against active quantum adversaries (2016)"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1137\/100813683","volume":"41","author":"A De","year":"2012","unstructured":"De, A., Portmann, C., Vidick, T., Renner, R.: Trevisan\u2019s extractor in the presence of quantum side information. SIAM J. Comput. 41(4), 915\u2013940 (2012)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"16_CR16","doi-asserted-by":"publisher","first-page":"6207","DOI":"10.1109\/TIT.2012.2200290","volume":"58","author":"Y Dodis","year":"2012","unstructured":"Dodis, Y., Kanukurthi, B., Katz, J., Reyzin, L., Smith, A.: Robust fuzzy extractors and authenticated key agreement from close secrets. IEEE Trans. Inf. Theory 58(9), 6207\u20136222 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1137\/120868414","volume":"43","author":"Y Dodis","year":"2014","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)","journal-title":"SIAM J. Comput."},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 293\u2013302. IEEE (2008)","DOI":"10.1109\/FOCS.2008.56"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: Mitzenmacher, M (ed.) Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, MD, USA, pp. 601\u2013610. ACM (2009)","DOI":"10.1145\/1536414.1536496"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36594-2_1","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2013","unstructured":"Dodis, Y., Yu, Y.: Overcoming weak expectations. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 1\u201322. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_1"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., De Wolf, R.: Exponential separations for one-way quantum communication complexity, with applications to cryptography. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 516\u2013525. ACM (2007)","DOI":"10.1145\/1250790.1250866"},{"issue":"1","key":"16_CR22","doi-asserted-by":"publisher","first-page":"461","DOI":"10.4086\/toc.2012.v008a021","volume":"8","author":"R Kasher","year":"2012","unstructured":"Kasher, R., Kempe, J.: Two-source extractors secure against quantum adversaries. Theory Comput. 8(1), 461\u2013486 (2012)","journal-title":"Theory Comput."},{"issue":"9","key":"16_CR23","doi-asserted-by":"publisher","first-page":"4337","DOI":"10.1109\/TIT.2009.2025545","volume":"55","author":"R Koenig","year":"2009","unstructured":"Koenig, R., Renner, R., Schaffner, C.: The operational meaning of min-and max-entropy. IEEE Trans. Inf. Theory 55(9), 4337\u20134347 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"16_CR24","doi-asserted-by":"publisher","first-page":"2224","DOI":"10.1109\/TIT.2005.847746","volume":"51","author":"C-J Lee","year":"2005","unstructured":"Lee, C.-J., Lu, C.-J., Tsai, S.-C., Tzeng, W.-G.: Extracting randomness from multiple independent sources. IEEE Trans. Inf. Theory 51(6), 2224\u20132227 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR25","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, 19\u201322 May 2012, pp. 837\u2013854 (2012)"},{"key":"16_CR26","unstructured":"Li, X.: Non-malleable condensers for arbitrary min-entropy, and almost optimal protocols for privacy amplification. CoRR, abs\/1211.0651 (2012)"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Li, X.: Non-malleable extractors, two-source extractors and privacy amplification. In: FOCS, pp. 688\u2013697 (2012)","DOI":"10.1109\/FOCS.2012.26"},{"key":"16_CR28","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_CR29","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, STOC 2017, Montreal, QC, Canada, 19\u201323 June 2017, pp. 1144\u20131156 (2017)","DOI":"10.1145\/3055399.3055486"},{"issue":"1","key":"16_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U Maurer","year":"1992","unstructured":"Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptol. 5(1), 53\u201366 (1992)","journal-title":"J. Cryptol."},{"key":"16_CR31","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 Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 307\u2013321. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052244"},{"issue":"1","key":"16_CR32","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/1120582.1120587","volume":"53","author":"A Nayak","year":"2006","unstructured":"Nayak, A., Salzman, J.: Limits on the ability of quantum states to convey classical messages. J. ACM (JACM) 53(1), 184\u2013206 (2006)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"16_CR33","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_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-30576-7_22","volume-title":"Theory of Cryptography","author":"R Renner","year":"2005","unstructured":"Renner, R., K\u00f6nig, R.: Universally composable privacy amplification against quantum adversaries. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 407\u2013425. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_22"},{"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"},{"issue":"8","key":"16_CR36","doi-asserted-by":"publisher","first-page":"5524","DOI":"10.1109\/TIT.2011.2158473","volume":"57","author":"M Tomamichel","year":"2011","unstructured":"Tomamichel, M., Schaffner, C., Smith, A.D., Renner, R.: Leftover hashing against quantum side information. IEEE Trans. Inf. Theory 57(8), 5524\u20135535 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"16_CR37","doi-asserted-by":"publisher","first-page":"2603","DOI":"10.1109\/TIT.2013.2238656","volume":"59","author":"A Vitanov","year":"2013","unstructured":"Vitanov, A., Dupuis, F., Tomamichel, M., Renner, R.: Chain rules for smooth min-and max-entropies. IEEE Trans. Inf. Theory 59(5), 2603\u20132612 (2013)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17656-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:41:16Z","timestamp":1710232876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17656-3_16"}},"subtitle":["With Application to Privacy Amplification Against Active Quantum Adversaries"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030176556","9783030176563"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17656-3_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":"24 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Darmstadt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"19 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2019\/","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":"IACR websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"327","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":"76","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":"23% - 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":"19","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)"}}]}}