{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T09:29:57Z","timestamp":1768901397340,"version":"3.49.0"},"publisher-location":"Cham","reference-count":66,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018540","type":"print"},{"value":"9783032018557","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01855-7_22","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:41:31Z","timestamp":1755373291000},"page":"679-713","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Randomized Strong 2-Source Non-malleable Extractor for\u00a0Any Linear Min-Entropy"],"prefix":"10.1007","author":[{"given":"Divesh","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"Pranjal","family":"Dutta","sequence":"additional","affiliation":[]},{"given":"Saswata","family":"Mukherjee","sequence":"additional","affiliation":[]},{"given":"Satyajeet","family":"Nagargoje","sequence":"additional","affiliation":[]},{"given":"Maciej","family":"Obremski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-17656-3_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"D Aggarwal","year":"2019","unstructured":"Aggarwal, D., Chung, K.-M., Lin, H.-H., Vidick, T.: A quantum-proof non-malleable extractor. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 442\u2013469. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_16"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Chung, E., Obremski, M.: Extractors: low entropy requirements colliding with non-malleability. In: Annual International Cryptology Conference, pp. 580\u2013610. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_19","DOI":"10.1007\/978-3-031-38545-2_19"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dziembowski, S., Kazana, T., Obremski, M.: Leakage-resilient non-malleable codes. In: Theory of Cryptography Conference, TCC (2015)","DOI":"10.1007\/978-3-662-46494-6_17"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. In: Proceedings of the 46th annual ACM Symposium on Theory of Computing, STOC (2014)","DOI":"10.1145\/2591796.2591804"},{"key":"22_CR5","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":"22_CR6","unstructured":"Alrabiah, O., Goodman, J., Mosheiff, J., Ribeiro, J.: Low-degree polynomials are good extractors. arXiv preprint arXiv:2405.10297 (2024)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Theory of Cryptography Conference, TCC (2009)","DOI":"10.1007\/978-3-642-00457-5_28"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Hosseini, K., Lovett, S.: Affine-malleable extractors, spectrum doubling, and application to privacy amplification. In: International Symposium on Information Theory, ISIT (2016)","DOI":"10.1109\/ISIT.2016.7541832"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Kanukurthi, B., Obbattu, S.L.B., Obremski, M., Sekar, S.: Rate one-third non-malleable codes. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1364\u20131377 (2022)","DOI":"10.1145\/3519935.3519972"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., and Maciej Obremski. A constant rate non-malleable code in the split-state model. In: FOCS (2020)","DOI":"10.1109\/FOCS46700.2020.00122"},{"issue":"8","key":"22_CR11","doi-asserted-by":"publisher","first-page":"5475","DOI":"10.1109\/TIT.2022.3167404","volume":"68","author":"D Aggarwal","year":"2022","unstructured":"Aggarwal, D., Obremski, M., Ribeiro, J., Simkin, M., Siniscalchi, L.: Privacy amplification with tamperable memory via nonmalleable two-source extractors. IEEE Trans. Inform. Theory 68(8), 5475\u20135495 (2022)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"22_CR12","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, STOC (2017)","DOI":"10.1145\/3055399.3055423"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., et al.: Factoring rsa keys from certified smart cards: Coppersmith in the wild. In: Advances in Cryptology-ASIACRYPT 2013 (2013)","DOI":"10.1007\/978-3-642-42045-0_18"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Biham, E., Dunkelman, O., Keller, N.: A unified approach to related-key attacks. In: Fast Software Encryption: FSE 2008 (2008)","DOI":"10.1007\/978-3-540-71039-4_5"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Bhowmick, A., Gabizon, A., L\u00ea, T.H., Zuckerman, D.: Deterministic extractors for additive sources. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS (2015)","DOI":"10.1145\/2688073.2688090"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Breitnerm J., Heninger, N.: Biased nonce sense: Lattice attacks against weak ecdsa signatures in cryptocurrencies. In: Financial Cryptography and Data Security: 23rd International Conference, FC (2019)","DOI":"10.1007\/978-3-030-32101-7_1"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Blum, M.: Independent unbiased coin flips from a correlated biased source\u2014a finite state markov chain. Combinatorica (1986)","DOI":"10.1007\/BF02579167"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. Inter. J. Number Theory (2005)","DOI":"10.1142\/S1793042105000108"},{"issue":"1","key":"22_CR19","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 Geometric Funct. Analy. 17(1), 33\u201357 (2007)","journal-title":"GAFA Geometric Funct. Analy."},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-030-17653-2_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Badrinarayanan","year":"2019","unstructured":"Badrinarayanan, S., Srinivasan, A.: Revisiting non-malleable secret sharing. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 593\u2013622. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_20"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Lovett, S., Ron-Zewi, N.: An additive combinatorics approach relating rank to communication complexity. J. ACM 61(4) (2014)","DOI":"10.1145\/2629598"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-resilient functions and all-or-nothing transforms. In: Advances in Cryptology \u2013 EUROCRYPT (2000)","DOI":"10.1007\/3-540-45539-6_33"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. (1988)","DOI":"10.1137\/0217015"},{"key":"22_CR24","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"},{"issue":"1","key":"22_CR25","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."},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Goodman, J., Goyal, V., Li, X.: Extractors for adversarial sources via extremal hypergraphs. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC (2019)","DOI":"10.1145\/3357713.3384339"},{"key":"22_CR27","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 34th annual ACM Symposium on Theory of Computing, STOC (2016)","DOI":"10.1145\/2897518.2897547"},{"key":"22_CR28","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":"22_CR29","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Li, X.: Explicit non-malleable extractors, multi-source extractors, and almost optimal privacy amplification protocols. In: FOCS (2016)","DOI":"10.1109\/FOCS.2016.25"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 364\u2013369. Association for Computing Machinery, New York (1986)","DOI":"10.1145\/12130.12168"},{"key":"22_CR31","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, STOC (2017)","DOI":"10.1145\/3055399.3055429"},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Zuckerman, D.: Explicit two-source extractors and resilient functions. In: Proceedings of the 48th annual ACM Symposium on Theory of Computing, STOC (2019)","DOI":"10.4007\/annals.2019.189.3.1"},{"key":"22_CR33","doi-asserted-by":"publisher","unstructured":"Di Crescenzo, G., Lipton, R., Walfish, S.: Perfectly secure password protocols in the bounded retrieval model. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 225\u2013244. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_12","DOI":"10.1007\/11681878_12"},{"key":"22_CR34","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-642-15317-4_9"},{"key":"22_CR35","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\u201358 (2009)","journal-title":"Comput. Complex."},{"key":"22_CR36","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":"22_CR37","unstructured":"Dodis, Y., Ong, S.J., Prabhakaran, M., Sahai, A.: On the (im) possibility of cryptography with imperfect randomness. In: FOCS (2004)"},{"issue":"4","key":"22_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3178432","volume":"65","author":"S Dziembowski","year":"2018","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. J. ACM (JACM) 65(4), 1\u201332 (2018)","journal-title":"J. ACM (JACM)"},{"key":"22_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-44987-6_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"Y Dodis","year":"2001","unstructured":"Dodis, Y., Sahai, A., Smith, A.: On perfect and adaptive security in exposure-resilient cryptography. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 301\u2013324. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_19"},{"key":"22_CR40","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s00037-011-0023-3","volume":"21","author":"Z Dvir","year":"2012","unstructured":"Dvir, Z.: Extractors for varieties. Comput. Complexity 21, 515\u2013572 (2012)","journal-title":"Comput. Complexity"},{"key":"22_CR41","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: Proceedings of the 31st annual ACM Symposium on Theory of Computing, STOC (2009)","DOI":"10.1145\/1536414.1536496"},{"key":"22_CR42","doi-asserted-by":"crossref","unstructured":"Dziembowskim S.: Intrusion-resilience via the bounded-storage model. In: Theory of Cryptography Conference, TCC (2006)","DOI":"10.1007\/11681878_11"},{"key":"22_CR43","doi-asserted-by":"crossref","unstructured":"Faust, S., Kr\u00e4mer, J., Orlt, M., Struck, P.: On the related-key attack security of authenticated encryption schemes. In: International Conference on Security and Cryptography for Networks (2022)","DOI":"10.1007\/978-3-031-14791-3_16"},{"key":"22_CR44","doi-asserted-by":"crossref","unstructured":"Gowers, W.T., Green, B., Manners, F., Tao, T.: On a conjecture of marton. Annals of Mathematics (2025). To appear","DOI":"10.4007\/annals.2025.201.2.5"},{"key":"22_CR45","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, STOC (2018)","DOI":"10.1145\/3188745.3188872"},{"key":"22_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-319-96884-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"V Goyal","year":"2018","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing for general access structures. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 501\u2013530. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_17"},{"key":"22_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-030-45721-1_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Garg","year":"2020","unstructured":"Garg, A., Kalai, Y.T., Khurana, D.: Low error efficient computational extractors in the CRS model. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 373\u2013402. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_14"},{"key":"22_CR48","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Lysyanskaya, A., Malkin, T., Micali, S., Rabin, T.: Algorithmic tamper-proof (atp) security: Theoretical foundations for security against hardware tampering. In: TCC (2004)","DOI":"10.1007\/978-3-540-24638-1_15"},{"key":"22_CR49","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":"22_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-030-77886-6_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Srinivasan, A., Zhu, C.: Multi-source non-malleable extractors and applications. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 468\u2013497. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_16"},{"key":"22_CR51","unstructured":"Heninger, N., Durumeric, Z., Wustrow, E., Halderman, J.A.: Mining your ps and qs: Detection of widespread weak keys in network devices. In: 21st USENIX Security Symposium (USENIX Security 12), pp. 205\u2013220 (2012)"},{"key":"22_CR52","doi-asserted-by":"crossref","unstructured":"Kamp, J., Rao, A., Vadhan, S., Zuckerman, D.: Deterministic extractors for small-space sources. In: Proceedings of the 38th annual ACM Symposium on Theory of Computing, STOC (2006)","DOI":"10.1145\/1132516.1132613"},{"issue":"4","key":"22_CR53","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. Mathematika 65(4), 950\u2013957 (2019)","journal-title":"Mathematika"},{"key":"22_CR54","doi-asserted-by":"crossref","unstructured":"Li, X.: Improved two-source extractors, and affine extractors for polylogarithmic entropy. In: FOCS (2016)","DOI":"10.1109\/FOCS.2016.26"},{"key":"22_CR55","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)","DOI":"10.1145\/3055399.3055486"},{"key":"22_CR56","unstructured":"Li, X.: Non-malleable extractors and non-malleable codes: partially optimal constructions. In: CCC (2019)"},{"key":"22_CR57","doi-asserted-by":"crossref","unstructured":"Li, X.: Two source extractors for asymptotically optimal entropy, and (many) more. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1271\u20131281. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00075"},{"key":"22_CR58","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":"22_CR59","unstructured":"Rao, A.: An exposition of bourgain\u2019s 2-source extractor. Electronic Colloquium on Computational Complexity (2007)"},{"key":"22_CR60","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak frandom seeds. In: Proceedings of the 37th annual ACM Symposium on Theory of Computing, STOC (2005)","DOI":"10.1145\/1060590.1060593"},{"key":"22_CR61","doi-asserted-by":"crossref","unstructured":"Santha, M., Vazirani, U.V.: Generating quasi-random sequences from semi-random sources. J. Comput. Syst. Sci. (1986)","DOI":"10.1016\/0022-0000(86)90044-9"},{"key":"22_CR62","unstructured":"Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: FOCS (2000)"},{"key":"22_CR63","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: Pseudorandomness. Foundations and Trends\u00aein Theoretical Computer Science (2012)","DOI":"10.1561\/9781601985958"},{"key":"22_CR64","unstructured":"Vazirani, U.V.: Randomness, adversaries and computation (random polynomial time). PhD thesis (1986). AAI8718194"},{"key":"22_CR65","unstructured":"Von Neumann, J.: Various techniques used in connection with random digits. Applied Math Ser 12(36-38) (1951)"},{"key":"22_CR66","doi-asserted-by":"crossref","unstructured":"Zewi, N., Ben-Sasson, E.: From affine to two-source extractors via approximate duality. In: Proceedings of the 43rd annual ACM Symposium on Theory of Computing, STOC (2011)","DOI":"10.1145\/1993636.1993661"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01855-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T19:21:41Z","timestamp":1768850501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01855-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018540","9783032018557"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01855-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}