{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:16:40Z","timestamp":1743085000529,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030176525"},{"type":"electronic","value":"9783030176532"}],"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-17653-2_19","type":"book-chapter","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T04:42:13Z","timestamp":1557808933000},"page":"562-592","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Correlated-Source Extractors and Cryptography with Correlated-Random Tapes"],"prefix":"10.1007","author":[{"given":"Vipul","family":"Goyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifan","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,18]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-662-47989-6_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"M Abdalla","year":"2015","unstructured":"Abdalla, M., Benhamouda, F., Passel\u00e8gue, A.: An algebraic framework for pseudorandom functions and applications to related-key security. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 388\u2013409. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_19"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-662-44371-2_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"P Austrin","year":"2014","unstructured":"Austrin, P., Chung, K.-M., Mahmoody, M., Pass, R., Seth, K.: On the impossibility of cryptography with tamperable randomness. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 462\u2013479. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_26"},{"key":"19_CR3","unstructured":"Andreev, A.E., Clementi, A.E.F., Rolim, J.D.P., Trevisan, L.: Weak random sources, hitting sets, and BPP simulations. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 264\u2013272, October 1997"},{"key":"19_CR4","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, CCC 2018, Germany, pp. 3:1\u20133:19. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-sound zero-knowledge and its applications. In: Proceedings 2001 IEEE International Conference on Cluster Computing, pp. 116\u2013125, October 2001","DOI":"10.1109\/SFCS.2001.959886"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Paneth, O.: On the impossibility of approximate obfuscation and applications to resettable cryptography. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 241\u2013250. ACM, New York (2013)","DOI":"10.1145\/2488608.2488639"},{"issue":"2","key":"19_CR7","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_CR8","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":"19_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC 2000, pp. 235\u2013244. ACM, New York (2000)","DOI":"10.1145\/335305.335334"},{"key":"19_CR10","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, STOC 2016, pp. 285\u2013298. ACM, New York (2016)","DOI":"10.1145\/2897518.2897547"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Li, X.: Explicit non-malleable extractors, multi-source extractors, and almost optimal privacy amplification protocols. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 158\u2013167, October 2016","DOI":"10.1109\/FOCS.2016.25"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, G.: Local correlation breakers and applications to three-source extractors and mergers. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 845\u2013862, October 2015","DOI":"10.1109\/FOCS.2015.57"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, G.: Making the most of advice: new correlation breakers and their applications. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 188\u2013196, October 2016","DOI":"10.1109\/FOCS.2016.28"},{"key":"19_CR14","unstructured":"Cohen, G.: Non-malleable extractors - new tools and improved constructions. In: Raz, R. (ed.) 31st Conference on Computational Complexity (CCC 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 50, pp. 8:1\u20138:29. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2016)"},{"key":"19_CR15","first-page":"30","volume":"23","author":"G Cohen","year":"2016","unstructured":"Cohen, G.: Non-malleable extractors with logarithmic seeds. Electron. Colloquium Comput. Complex. (ECCC) 23, 30 (2016)","journal-title":"Electron. Colloquium Comput. Complex. (ECCC)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-54242-8_9","volume-title":"Theory of Cryptography","author":"K-M Chung","year":"2014","unstructured":"Chung, K.-M., Ostrovsky, R., Pass, R., Venkitasubramaniam, M., Visconti, I.: 4-round resettably-sound zero knowledge. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 192\u2013216. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_9"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Chung, K.M., Ostrovsky, R., Pass, R., Visconti, I.: Simultaneous resettability from one-way functions. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 60\u201369, October 2013","DOI":"10.1109\/FOCS.2013.15"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1137\/130946083","volume":"45","author":"K-M Chung","year":"2016","unstructured":"Chung, K.-M., Pass, R., Seth, K.: Non-black-box simulation from one-way functions and applications to resettable security. SIAM J. Comput. 45(2), 415\u2013458 (2016)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"19_CR19","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_CR20","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Zuckerman, D.: Explicit two-source extractors and resilient functions. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2016, pp. 670\u2013683. ACM, New York (2016)","DOI":"10.1145\/2897518.2897528"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Deng, Y., Goyal, V., Sahai, A.: Resolving the simultaneous resettability conjecture and a new non-black-box simulation strategy. In: 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 251\u2013260, October 2009","DOI":"10.1109\/FOCS.2009.59"},{"issue":"2","key":"19_CR22","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":"19_CR23","unstructured":"Dodis, Y., Ong, S.J., Prabhakaran, M., Sahai, A.: On the (im)possibility of cryptography with imperfect randomness. In: Annual Symposium on Foundations of Computer Science, pp. 196\u2013205 (2004)"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-540-24676-3_31","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y Dodis","year":"2004","unstructured":"Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 523\u2013540. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_31"},{"key":"19_CR25","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, STOC 2009, pp. 601\u2013610. ACM, New York (2009)","DOI":"10.1145\/1536414.1536496"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Goyal, V., Maji, H.K.: Stateless cryptographic protocols. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 678\u2013687, October 2011","DOI":"10.1109\/FOCS.2011.74"},{"issue":"1","key":"19_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7(1), 1\u201332 (1994)","journal-title":"J. Cryptol."},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-01001-9_3","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"V Goyal","year":"2009","unstructured":"Goyal, V., Sahai, A.: Resettably secure computation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 54\u201371. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_3"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Goyal, V., Song, Y.: Correlated-source extractors and cryptography with correlated-random tapes. Cryptology ePrint Archive (2019)","DOI":"10.1007\/978-3-030-17653-2_19"},{"issue":"4","key":"19_CR30","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1145\/1538902.1538904","volume":"56","author":"V Guruswami","year":"2009","unstructured":"Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. J. ACM 56(4), 20:1\u201320:34 (2009)","journal-title":"J. ACM"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Li, X., Rao, A., Zuckerman, D.: Network extractor protocols. In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 654\u2013663, October 2008","DOI":"10.1109\/FOCS.2008.73"},{"key":"19_CR32","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, October 2012","DOI":"10.1109\/FOCS.2012.26"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Li, X.: Design extractors, non-malleable condensers and privacy amplification. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, STOC 2012, pp. 837\u2013854. ACM, New York (2012)","DOI":"10.1145\/2213977.2214052"},{"key":"19_CR34","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. LNCS, vol. 9014, pp. 502\u2013531. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_21"},{"key":"19_CR35","doi-asserted-by":"crossref","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, October 2016","DOI":"10.1109\/FOCS.2016.26"},{"key":"19_CR36","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, pp. 1144\u20131156. ACM, New York (2017)","DOI":"10.1145\/3055399.3055486"},{"key":"19_CR37","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_CR38","doi-asserted-by":"crossref","unstructured":"Saks, M., Srinivasan, A., Zhou, S.: Explicit dispersers with polylog degree. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC 1995, pp. 479\u2013488. ACM, New York (1995)","DOI":"10.1145\/225058.225188"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Vazirani, U.V., Vazirani, V.V.: Random polynomial time is equal to slightly-random polynomial time. In: 26th Annual Symposium on Foundations of Computer Science (SFCS 1985), pp. 417\u2013428, October 1985","DOI":"10.1109\/SFCS.1985.45"},{"issue":"4","key":"19_CR40","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01940870","volume":"16","author":"D Zuckerman","year":"1996","unstructured":"Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica 16(4), 367\u2013391 (1996)","journal-title":"Algorithmica"}],"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-17653-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:51:14Z","timestamp":1709833874000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17653-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030176525","9783030176532"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17653-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 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)"}}]}}