{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:54Z","timestamp":1766281014056,"version":"3.40.3"},"publisher-location":"Cham","reference-count":73,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030457204"},{"type":"electronic","value":"9783030457211"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45721-1_13","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T04:17:18Z","timestamp":1588306638000},"page":"343-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["How to Extract Useful Randomness from Unreliable Sources"],"prefix":"10.1007","author":[{"given":"Divesh","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"Maciej","family":"Obremski","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o","family":"Ribeiro","sequence":"additional","affiliation":[]},{"given":"Luisa","family":"Siniscalchi","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,1]]},"reference":[{"key":"13_CR1","unstructured":"Aggarwal, D., Obremski, M., Ribeiro, J., Siniscalchi, L., Visconti, I.: How to extract useful randomness from unreliable sources. Cryptology ePrint Archive, Report 2019\/1156 (2019). https:\/\/eprint.iacr.org\/2019\/1156"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., Wigderson, A.: Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors. J. ACM 57(4) (2010). https:\/\/doi.org\/10.1145\/1734213.1734214","DOI":"10.1145\/1734213.1734214"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.4007\/annals.2012.176.3.3","volume":"176","author":"B Barak","year":"2012","unstructured":"Barak, B., Rao, A., Shaltiel, R., Wigderson, A.: 2-source dispersers for $$n^{o(1)}$$ entropy, and Ramsey graphs beating the Frankl-Wilson construction. Ann. Math. 176(3), 1483\u20131543 (2012)","journal-title":"Ann. Math."},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Beigi, S., Bogdanov, A., Etesami, O., Guo, S.: Optimal deterministic extractors for generalized Santha-Vazirani sources. In: APPROX\/RANDOM 2018. LIPIcs, vol. 116, pp. 30:1\u201330:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2018.30","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2018.30"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/15M1027206","volume":"46","author":"S Beigi","year":"2017","unstructured":"Beigi, S., Etesami, O., Gohari, A.: Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources. SIAM J. Comput. 46(1), 1\u201336 (2017). https:\/\/doi.org\/10.1137\/15M1027206","journal-title":"SIAM J. Comput."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/978-3-662-53890-6_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"M Bellare","year":"2016","unstructured":"Bellare, M., Fuchsbauer, G., Scafuro, A.: NIZKs with an untrusted CRS: security in the face of parameter subversion. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 777\u2013804. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_26"},{"key":"13_CR7","unstructured":"Ben-Aroya, A., Chattopadhyay, E., Doron, D., Li, X., Ta-Shma, A.: A new approach for constructing low-error, two-source extractors. In: CCC 2018, pp. 3:1\u20133:19. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Germany (2018)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-39799-X_37","volume-title":"Advances in Cryptology \u2014 CRYPTO 1985 Proceedings","author":"CH Bennett","year":"1986","unstructured":"Bennett, C.H., Brassard, G., Robert, J.-M.: How to reduce your enemy\u2019s information (extended abstract). In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 468\u2013476. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_37"},{"key":"13_CR9","unstructured":"Bentov, I., Gabizon, A., Zuckerman, D.: Bitcoin beacon. arXiv e-prints arXiv:1605.04559, May 2016"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-28914-9_11","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2012","unstructured":"Bitansky, N., Paneth, O.: Point obfuscation and 3-round zero-knowledge. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 190\u2013208. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_11"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF02579167","volume":"6","author":"M Blum","year":"1986","unstructured":"Blum, M.: Independent unbiased coin flips from a correlated biased source\u2014a finite state Markov chain. Combinatorica 6(2), 97\u2013108 (1986). https:\/\/doi.org\/10.1007\/BF02579167","journal-title":"Combinatorica"},{"issue":"01","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793042105000108","volume":"01","author":"J Bourgain","year":"2005","unstructured":"Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. Int. J. Number Theory 01(01), 1\u201332 (2005)","journal-title":"Int. J. Number Theory"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00039-007-0593-z","volume":"17","author":"J Bourgain","year":"2007","unstructured":"Bourgain, J.: On the construction of affine extractors. GAFA Geom. Funct. Anal. 17(1), 33\u201357 (2007)","journal-title":"GAFA Geom. Funct. Anal."},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/s00037-015-0108-5","volume":"25","author":"J Bourgain","year":"2016","unstructured":"Bourgain, J., Dvir, Z., Leeman, E.: Affine extractors over large fields with exponential error. Comput. Complex. 25(4), 921\u2013931 (2016). https:\/\/doi.org\/10.1007\/s00037-015-0108-5","journal-title":"Comput. Complex."},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Canetti, R., Pass, R., Shelat, A.: Cryptography from sunspots: how to use an imperfect reference string. In: FOCS 2007, pp. 249\u2013259, October 2007. https:\/\/doi.org\/10.1109\/FOCS.2007.70","DOI":"10.1109\/FOCS.2007.70"},{"key":"13_CR16","unstructured":"Chattopadhyay, E., Goodman, J., Goyal, V., Li, X.: Extractors for adversarial sources via extremal hypergraphs. Cryptology ePrint Archive, Report 2019\/1450 (2019, to appear in STOC 2020). https:\/\/eprint.iacr.org\/2019\/1450"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, E., Goyal, V., Li, X.: Non-malleable extractors and codes, with their many tampered extensions. In: STOC 2016, pp. 285\u2013298. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2897518.2897547","DOI":"10.1145\/2897518.2897547"},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"653","DOI":"10.4007\/annals.2019.189.3.1","volume":"189","author":"E Chattopadhyay","year":"2019","unstructured":"Chattopadhyay, E., Zuckerman, D.: Explicit two-source extractors and resilient functions. Ann. Math. 189(3), 653\u2013705 (2019)","journal-title":"Ann. Math."},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldreich, O., Hasted, J., Freidmann, J., Rudich, S., Smolensky, R.: The bit extraction problem or t-resilient functions. In: FOCS 1985, pp. 396\u2013407, October 1985. https:\/\/doi.org\/10.1109\/SFCS.1985.55","DOI":"10.1109\/SFCS.1985.55"},{"issue":"2","key":"13_CR20","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). https:\/\/doi.org\/10.1137\/0217015","journal-title":"SIAM J. Comput."},{"key":"13_CR21","unstructured":"Clark, J., Hengartner, U.: On the use of financial data as a random beacon. In: EVT\/WOTE 2010, pp. 1\u20138. USENIX Association, Berkeley (2010)"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Cohen, G., Schulman, L.J.: Extractors for near logarithmic min-entropy. In: FOCS 2016, pp. 178\u2013187, October 2016. https:\/\/doi.org\/10.1109\/FOCS.2016.27","DOI":"10.1109\/FOCS.2016.27"},{"issue":"4","key":"13_CR23","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1137\/15M1029837","volume":"45","author":"G Cohen","year":"2016","unstructured":"Cohen, G.: Local correlation breakers and applications to three-source extractors and mergers. SIAM J. Comput. 45(4), 1297\u20131338 (2016). https:\/\/doi.org\/10.1137\/15M1029837","journal-title":"SIAM J. Comput."},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-662-47672-7_28","volume-title":"Automata, Languages, and Programming","author":"G Cohen","year":"2015","unstructured":"Cohen, G., Shinkar, I.: Zero-fixing extractors for sub-logarithmic entropy. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 343\u2013354. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_28"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-22935-0_41","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A De","year":"2011","unstructured":"De, A., Watson, T.: Extractors and lower bounds for locally samplable sources. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX\/RANDOM 2011. LNCS, vol. 6845, pp. 483\u2013494. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22935-0_41"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"DeVos, M., Gabizon, A.: Simple affine extractors using dimension expansion. In: CCC 2010, pp. 50\u201357. IEEE Computer Society, USA (2010). https:\/\/doi.org\/10.1109\/CCC.2010.14","DOI":"10.1109\/CCC.2010.14"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-48224-5_25","volume-title":"Automata, Languages and Programming","author":"Y Dodis","year":"2001","unstructured":"Dodis, Y.: New imperfect random source with applications to coin-flipping. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 297\u2013309. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_25"},{"key":"13_CR28","unstructured":"Dodis, Y., Vaikuntanathan, V., Wichs, D.: Extracting randomness from extractor-dependent sources. Cryptology ePrint Archive, Report 2019\/1339 (2019). https:\/\/eprint.iacr.org\/2019\/1339"},{"issue":"6","key":"13_CR29","doi-asserted-by":"publisher","first-page":"2305","DOI":"10.1137\/100783704","volume":"42","author":"Z Dvir","year":"2013","unstructured":"Dvir, Z., Kopparty, S., Saraf, S., Sudan, M.: Extensions to the method of multiplicities, with applications to Kakeya sets and mergers. SIAM J. Comput. 42(6), 2305\u20132328 (2013)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"13_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-009-0258-4","volume":"18","author":"Z Dvir","year":"2009","unstructured":"Dvir, Z., Gabizon, A., Wigderson, A.: Extractors and rank extractors for polynomial sources. Comput. Complex. 18(1), 1\u201358 (2009). https:\/\/doi.org\/10.1007\/s00037-009-0258-4","journal-title":"Comput. Complex."},{"issue":"3","key":"13_CR31","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1002\/rsa.20193","volume":"32","author":"Z Dvir","year":"2008","unstructured":"Dvir, Z., Raz, R.: Analyzing linear mergers. Random Struct. Algorithms 32(3), 334\u2013345 (2008)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"13_CR32","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00037-007-0223-z","volume":"16","author":"Z Dvir","year":"2007","unstructured":"Dvir, Z., Shpilka, A.: An improved analysis of linear mergers. Comput. Complex. 16(1), 34\u201359 (2007). https:\/\/doi.org\/10.1007\/s00037-007-0223-z","journal-title":"Comput. Complex."},{"issue":"3","key":"13_CR33","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1137\/090748731","volume":"40","author":"Z Dvir","year":"2011","unstructured":"Dvir, Z., Wigderson, A.: Kakeya sets, new mergers, and old extractors. SIAM J. Comput. 40(3), 778\u2013792 (2011). https:\/\/doi.org\/10.1137\/090748731","journal-title":"SIAM J. Comput."},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"Dwork, C., Naor, M.: Zaps and their applications. In: FOCS 2000, pp. 283\u2013293, November 2000. https:\/\/doi.org\/10.1109\/SFCS.2000.892117","DOI":"10.1109\/SFCS.2000.892117"},{"issue":"3","key":"13_CR35","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1214\/aoms\/1177692552","volume":"43","author":"P Elias","year":"1972","unstructured":"Elias, P.: The efficient construction of an unbiased random sequence. Ann. Math. Stat. 43(3), 865\u2013870 (1972)","journal-title":"Ann. Math. Stat."},{"issue":"1","key":"13_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U Feige","year":"1999","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J. Comput. 29(1), 1\u201328 (1999)","journal-title":"SIAM J. Comput."},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-93387-0_3","volume-title":"Applied Cryptography and Network Security","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Orr\u00f9, M.: Non-interactive zaps of knowledge. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 44\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_3"},{"key":"13_CR38","doi-asserted-by":"publisher","unstructured":"Gabizon, A., Raz, R.: Deterministic extractors for affine sources over large fields. In: FOCS 2005, pp. 407\u2013416, October 2005. https:\/\/doi.org\/10.1109\/SFCS.2005.31","DOI":"10.1109\/SFCS.2005.31"},{"issue":"4","key":"13_CR39","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1137\/S0097539705447049","volume":"36","author":"A Gabizon","year":"2006","unstructured":"Gabizon, A., Raz, R., Shaltiel, R.: Deterministic extractors for bit-fixing sources by obtaining an independent seed. SIAM J. Comput. 36(4), 1072\u20131094 (2006)","journal-title":"SIAM J. Comput."},{"key":"13_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"13_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-319-70500-2_18","volume-title":"Theory of Cryptography","author":"R Goyal","year":"2017","unstructured":"Goyal, R., Goyal, V.: Overcoming cryptographic impossibility results using blockchains. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 529\u2013561. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_18"},{"key":"13_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11818175_6","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Non-interactive zaps and new techniques for NIZK. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 97\u2013111. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_6"},{"issue":"4","key":"13_CR43","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"},{"issue":"1","key":"13_CR44","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.jcss.2010.06.014","volume":"77","author":"J Kamp","year":"2011","unstructured":"Kamp, J., Rao, A., Vadhan, S., Zuckerman, D.: Deterministic extractors for small-space sources. J. Comput. Syst. Sci. 77(1), 191\u2013220 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"13_CR45","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1137\/S0097539705446846","volume":"36","author":"J Kamp","year":"2007","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. SIAM J. Comput. 36(5), 1231\u20131247 (2007)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"13_CR46","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)","journal-title":"Mathematika"},{"key":"13_CR47","unstructured":"Li, F., Zuckerman, D.: Improved extractors for recognizable and algebraic sources. Electronic Colloquium on Computational Complexity (ECCC) 25, 110 (2018)"},{"key":"13_CR48","doi-asserted-by":"publisher","unstructured":"Li, X.: Improved constructions of three source extractors. In: CCC 2011, pp. 126\u2013136, June 2011. https:\/\/doi.org\/10.1109\/CCC.2011.26","DOI":"10.1109\/CCC.2011.26"},{"key":"13_CR49","doi-asserted-by":"publisher","unstructured":"Li, X.: A new approach to affine extractors and dispersers. In: CCC 2011, pp. 137\u2013147, June 2011. https:\/\/doi.org\/10.1109\/CCC.2011.27","DOI":"10.1109\/CCC.2011.27"},{"key":"13_CR50","doi-asserted-by":"publisher","unstructured":"Li, X.: Extractors for a constant number of independent sources with polylogarithmic min-entropy. In: FOCS 2013, pp. 100\u2013109, October 2013. https:\/\/doi.org\/10.1109\/FOCS.2013.19","DOI":"10.1109\/FOCS.2013.19"},{"key":"13_CR51","doi-asserted-by":"publisher","unstructured":"Li, X.: Improved two-source extractors, and affine extractors for polylogarithmic entropy. In: FOCS 2016, pp. 168\u2013177, October 2016. https:\/\/doi.org\/10.1109\/FOCS.2016.26","DOI":"10.1109\/FOCS.2016.26"},{"key":"13_CR52","doi-asserted-by":"crossref","unstructured":"Li, X.: New independent source extractors with exponential improvement. In: STOC 2013, pp. 783\u2013792. ACM, New York, June 2013","DOI":"10.1145\/2488608.2488708"},{"key":"13_CR53","doi-asserted-by":"publisher","unstructured":"Li, X.: Three-source extractors for polylogarithmic min-entropy. In: FOCS 2015, pp. 863\u2013882, October 2015. https:\/\/doi.org\/10.1109\/FOCS.2015.58","DOI":"10.1109\/FOCS.2015.58"},{"issue":"3","key":"13_CR54","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02125896","volume":"9","author":"D Lichtenstein","year":"1989","unstructured":"Lichtenstein, D., Linial, N., Saks, M.: Some extremal problems arising from discrete control processes. Combinatorica 9(3), 269\u2013287 (1989). https:\/\/doi.org\/10.1007\/BF02125896","journal-title":"Combinatorica"},{"key":"13_CR55","doi-asserted-by":"crossref","unstructured":"Lu, C.J., Reingold, O., Vadhan, S., Wigderson, A.: Extractors: optimal up to constant factors. In: STOC 2003, pp. 602\u2013611. ACM, New York (2003)","DOI":"10.1145\/780542.780630"},{"issue":"2","key":"13_CR56","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991). https:\/\/doi.org\/10.1007\/BF00196774","journal-title":"J. Cryptol."},{"key":"13_CR57","unstructured":"von Neumann, J.: Various techniques used in connection with random digits. In: Monte Carlo Method, National Bureau of Standards Applied Mathematics Series, vol. 12, chap. 13, pp. 36\u201338. US Government Printing Office, Washington, DC (1951)"},{"issue":"1","key":"13_CR58","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\u201352 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-319-56614-6_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Pass","year":"2017","unstructured":"Pass, R., Seeman, L., Shelat, A.: Analysis of the blockchain protocol in asynchronous networks. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 643\u2013673. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_22"},{"key":"13_CR60","unstructured":"Pudlak, P., Rodl, V.: Extractors for small zero-fixing sources. arXiv e-prints arXiv:1904.07949, April 2019"},{"issue":"1","key":"13_CR61","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discrete Math. 13(1), 2\u201324 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR62","doi-asserted-by":"publisher","unstructured":"Rao, A.: Extractors for low-weight affine sources. In: CCC 2009, pp. 95\u2013101, July 2009. https:\/\/doi.org\/10.1109\/CCC.2009.36","DOI":"10.1109\/CCC.2009.36"},{"issue":"1","key":"13_CR63","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/060671218","volume":"39","author":"A Rao","year":"2009","unstructured":"Rao, A.: Extractors for a constant number of polynomially small min-entropy independent sources. SIAM J. Comput. 39(1), 168\u2013194 (2009)","journal-title":"SIAM J. Comput."},{"key":"13_CR64","doi-asserted-by":"publisher","unstructured":"Raz, R.: Extractors with weak random seeds. In: STOC 2005, pp. 11\u201320. ACM, New York (2005). https:\/\/doi.org\/10.1145\/1060590.1060593","DOI":"10.1145\/1060590.1060593"},{"key":"13_CR65","doi-asserted-by":"publisher","unstructured":"Santha, M., Vazirani, U.V.: Generating quasi-random sequences from slightly-random sources. In: FOCS 1984, pp. 434\u2013440, October 1984. https:\/\/doi.org\/10.1109\/SFCS.1984.715945","DOI":"10.1109\/SFCS.1984.715945"},{"key":"13_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-030-17253-4_13","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"A Scafuro","year":"2019","unstructured":"Scafuro, A., Siniscalchi, L., Visconti, I.: Publicly verifiable proofs from blockchains. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11442, pp. 374\u2013401. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17253-4_13"},{"key":"13_CR67","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A.: On extracting randomness from weak random sources (extended abstract). In: STOC 1996, pp. 276\u2013285. ACM, New York (1996)","DOI":"10.1145\/237814.237877"},{"key":"13_CR68","unstructured":"Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: FOCS 2000, pp. 32\u201342. IEEE Computer Society, Washington, DC (2000)"},{"key":"13_CR69","doi-asserted-by":"crossref","unstructured":"Vazirani, U.V.: Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources. In: STOC 1985, pp. 366\u2013378. ACM, New York (1985)","DOI":"10.1145\/22145.22186"},{"key":"13_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-642-32512-0_56","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"E Viola","year":"2012","unstructured":"Viola, E.: Extractors for turing-machine sources. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX\/RANDOM 2012. LNCS, vol. 7408, pp. 663\u2013671. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32512-0_56"},{"issue":"2","key":"13_CR71","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/11085983X","volume":"43","author":"E Viola","year":"2014","unstructured":"Viola, E.: Extractors for circuit sources. SIAM J. Comput. 43(2), 655\u2013672 (2014)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"13_CR72","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00493-011-2604-9","volume":"31","author":"A Yehudayoff","year":"2011","unstructured":"Yehudayoff, A.: Affine extractors over prime fields. Combinatorica 31(2), 245 (2011). https:\/\/doi.org\/10.1007\/s00493-011-2604-9","journal-title":"Combinatorica"},{"key":"13_CR73","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: STOC 2006. pp. 681\u2013690. ACM, New York, NY, USA (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45721-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:03:35Z","timestamp":1682899415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45721-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457204","9783030457211"],"references-count":73,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45721-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 May 2020","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":"Zagreb","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2020\/","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":"375","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":"81","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":"22% - 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":"20","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}