Document Open Access Logo

Two-Source and Affine Non-Malleable Extractors for Small Entropy

Authors Xin Li, Yan Zhong

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.108.pdf
  • Filesize: 0.69 MB
  • 15 pages

Document Identifiers

Author Details

Xin Li
  • Johns Hopkins University, Baltimore, MD, USA
Yan Zhong
  • Johns Hopkins University, Baltimore, MD, USA

Funding

  • Li, Xin: Supported by NSF CAREER Award CCF-1845349 and NSF Award CCF-2127575.
  • Zhong, Yan: Supported by NSF CAREER Award CCF-1845349.

Cite AsGet BibTex

Xin Li and Yan Zhong. Two-Source and Affine Non-Malleable Extractors for Small Entropy. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 108:1-108:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.108

Abstract

Non-malleable extractors are generalizations and strengthening of standard randomness extractors, that are resilient to adversarial tampering. Such extractors have wide applications in cryptography and have become important cornerstones in recent breakthroughs of explicit constructions of two-source extractors and affine extractors for small entropy. However, explicit constructions of non-malleable extractors appear to be much harder than standard extractors. Indeed, in the well-studied models of two-source and affine non-malleable extractors, the previous best constructions only work for entropy rate > 2/3 and 1-γ for some small constant γ > 0 respectively by Li (FOCS' 23). In this paper, we present explicit constructions of two-source and affine non-malleable extractors that match the state-of-the-art constructions of standard ones for small entropy. Our main results include: - Two-source and affine non-malleable extractors (over 𝖥₂) for sources on n bits with min-entropy k ≥ log^C n and polynomially small error, matching the parameters of standard extractors by Chattopadhyay and Zuckerman (STOC' 16, Annals of Mathematics' 19) and Li (FOCS' 16). - Two-source and affine non-malleable extractors (over 𝖥₂) for sources on n bits with min-entropy k = O(log n) and constant error, matching the parameters of standard extractors by Li (FOCS' 23). Our constructions significantly improve previous results, and the parameters (entropy requirement and error) are the best possible without first improving the constructions of standard extractors. In addition, our improved affine non-malleable extractors give strong lower bounds for a certain kind of read-once linear branching programs, recently introduced by Gryaznov, Pudlák, and Talebanfard (CCC' 22) as a generalization of several well studied computational models. These bounds match the previously best-known average-case hardness results given by Chattopadhyay and Liao (CCC' 23) and Li (FOCS' 23), where the branching program size lower bounds are close to optimal, but the explicit functions we use here are different. Our results also suggest a possible deeper connection between non-malleable extractors and standard ones.

Subject Classification

ACM Subject Classification
  • Theory of computation → Pseudorandomness and derandomization
Keywords
  • Randomness Extractors
  • Non-malleable
  • Two-source
  • Affine

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Divesh Aggarwal, Eldon Chung, and Maciej Obremski. Extractors: Low entropy requirements colliding with non-malleability. In Advances in Cryptology – CRYPTO 2023: 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20–24, 2023, Proceedings, Part II, pages 580-610, Berlin, Heidelberg, 2023. Springer-Verlag. Google Scholar
  2. Boaz Barak, R. Impagliazzo, and Avi Wigderson. Extracting randomness using few independent sources. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 384-393, 2004. Google Scholar
  3. Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, and Avi Wigderson. Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 1-10, 2005. Google Scholar
  4. Boaz Barak, Anup Rao, Ronen Shaltiel, and Avi Wigderson. 2 source dispersers for n^o(1) entropy and Ramsey graphs beating the Frankl-Wilson construction. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006. Google Scholar
  5. Avraham Ben-Aroya, Dean Doron, and Amnon Ta-Shma. 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, pages 1185-1194, New York, NY, USA, 2017. Association for Computing Machinery. Google Scholar
  6. Eli Ben-Sasson and Swastik Kopparty. Affine dispersers from subspace polynomials. SIAM J. Comput., 41(4):880-914, 2012. URL: https://doi.org/10.1137/110826254.
  7. Jean Bourgain. More on the sum-product phenomenon in prime fields and its applications. International Journal of Number Theory, 1:1-32, 2005. Google Scholar
  8. Jean Bourgain. On the construction of affine extractors. GAFA Geometric And Functional Analysis, 17:33-57, January 2007. URL: https://doi.org/10.1007/s00039-007-0593-z.
  9. Mark Braverman. Polylogarithmic independence fools ac0 circuits. Journal of the ACM, 57(5), 2010. Google Scholar
  10. Eshan Chattopadhyay, Jesse Goodman, and Jyun-Jie Liao. Affine extractors for almost logarithmic entropy. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pages 622-633. IEEE, 2021. Google Scholar
  11. Eshan Chattopadhyay, Vipul Goyal, and Xin Li. Non-malleable extractors and codes, with their many tampered extensions. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC '16, pages 285-298, New York, NY, USA, 2016. Association for Computing Machinery. Google Scholar
  12. Eshan Chattopadhyay and Xin Li. Explicit non-malleable extractors, multi-source extractors and almost optimal privacy amplification protocols. In Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science, 2016. Google Scholar
  13. Eshan Chattopadhyay and Xin Li. 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), pages 158-167, 2016. URL: https://doi.org/10.1109/FOCS.2016.25.
  14. Eshan Chattopadhyay and Xin Li. Extractors for sumset sources. In Daniel Wichs and Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC, Cambridge, MA, USA, June 18-21, 2016, pages 299-311. ACM, 2016. URL: https://doi.org/10.1145/2897518.2897643.
  15. Eshan Chattopadhyay and Xin Li. Non-malleable codes and extractors for small-depth circuits, and affine functions. In Hamed Hatami, Pierre McKenzie, and Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pages 1171-1184. ACM, 2017. Google Scholar
  16. Eshan Chattopadhyay and Jyun-Jie Liao. Extractors for sum of two sources. In Stefano Leonardi and Anupam Gupta, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pages 1584-1597. ACM, 2022. URL: https://doi.org/10.1145/3519935.3519963.
  17. Eshan Chattopadhyay and Jyun-Jie Liao. Hardness against linear branching programs and more. In Proceedings of the Conference on Proceedings of the 38th Computational Complexity Conference, CCC '23, Dagstuhl, DEU, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Google Scholar
  18. Eshan Chattopadhyay and David Zuckerman. Explicit two-source extractors and resilient functions. Annals of Mathematics, 189(3):653-705, 2019. Google Scholar
  19. Mahdi Cheraghchi and Venkatesan Guruswami. Non-malleable coding against bit-wise and split-state tampering. In TCC, pages 440-464, 2014. Google Scholar
  20. Benny Chor and Oded Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, 17(2):230-261, 1988. Google Scholar
  21. Benny Chor, Oded Goldreich, Johan Hastad, Joel Friedman, Steven Rudich, and Roman Smolensky. The bit extraction problem of t-resilient functions (preliminary version). In 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, USA, 21-23 October 1985, pages 396-407, 1985. Google Scholar
  22. Gil Cohen. Local correlation breakers and applications to three-source extractors and mergers. In Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science, 2015. Google Scholar
  23. Gil Cohen. Making the most of advice: New correlation breakers and their applications. In Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science, 2016. Google Scholar
  24. Gil Cohen. Non-malleable extractors - new tools and improved constructions. In Proceedings of the 31st Annual IEEE Conference on Computational Complexity, 2016. Google Scholar
  25. Gil Cohen. Non-malleable extractors with logarithmic seeds. Technical Report TR16-030, ECCC, 2016. Google Scholar
  26. Gil Cohen. Two-source dispersers for polylogarithmic entropy and improved ramsey graphs. In Daniel Wichs and Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pages 278-284. ACM, 2016. URL: https://doi.org/10.1145/2897518.2897530.
  27. Gil Cohen. Two-source extractors for quasi-logarithmic min-entropy and improved privacy amplification protocols. Technical Report TR16-114, ECCC: Electronic Colloquium on Computational Complexity, 2016. Google Scholar
  28. Gil Cohen. Towards optimal two-source extractors and ramsey graphs. In Hamed Hatami, Pierre McKenzie, and Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pages 1157-1170. ACM, 2017. URL: https://doi.org/10.1145/3055399.3055429.
  29. Gil Cohen, Ran Raz, and Gil Segev. Non-malleable extractors with short seeds and applications to privacy amplification. SIAM Journal on Computing, 43(2):450-476, 2014. Google Scholar
  30. Gil Cohen and Leonard Schulman. Extractors for near logarithmic min-entropy. In Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science, 2016. Google Scholar
  31. Evgeny Demenkov and Alexander Kulikov. An elementary proof of 3n-o(n) lower bound on the circuit complexity of affine dispersers. In Proceedings of the 36th international conference on Mathematical foundations of computer science, pages 256-265, 2011. Google Scholar
  32. Yevgeniy Dodis, Xin Li, Trevor D. Wooley, and David Zuckerman. Privacy amplification and nonmalleable extractors via character sums. SIAM Journal on Computing, 43(2):800-830, 2014. Google Scholar
  33. Yevgeniy Dodis and Daniel Wichs. Non-malleable extractors and symmetric key cryptography from weak secrets. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pages 601-610, 2009. Google Scholar
  34. Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, and Madhu Sudan. Extensions to the method of multiplicities, with applications to kakeya sets and mergers. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009. Google Scholar
  35. Zeev Dvir and Avi Wigderson. Kakeya sets, new mergers and old extractors. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008. Google Scholar
  36. Stefan Dziembowski, Krzysztof Pietrzak, and Daniel Wichs. Non-malleable codes. In ICS, pages 434-452, 2010. Google Scholar
  37. Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, and Alexander S. Kulikov. A better-than-3n lower bound for the circuit complexity of an explicit function. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pages 89-98, 2016. URL: https://doi.org/10.1109/FOCS.2016.19.
  38. Ariel Gabizon and Ran Raz. Deterministic extractors for affine sources over large fields. Combinatorica, 28(4):415-440, 2008. URL: https://doi.org/10.1007/s00493-008-2259-3.
  39. Ariel Gabizon, Ran Raz, and Ronen Shaltiel. Deterministic extractors for bit-fixing sources by obtaining an independent seed. SIAM J. Comput., 36(4):1072-1094, 2006. URL: https://doi.org/10.1137/S0097539705447049.
  40. Parikshit Gopalan, Ryan O'Donnell, Yi Wu, and David Zuckerman. Fooling functions of halfspaces under product distributions. In 2010 IEEE 25th Annual Conference on Computational Complexity, pages 223-234, 2010. URL: https://doi.org/10.1109/CCC.2010.29.
  41. Svyatoslav Gryaznov, Pavel Pudlák, and Navid Talebanfard. Linear Branching Programs and Directional Affine Extractors. In 37th Computational Complexity Conference (CCC 2022), volume 234, pages 4:1-4:16, 2022. Google Scholar
  42. V. Guruswami, C. Umans, and S. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. Journal of the ACM, 56:1-34, 2009. Google Scholar
  43. Yael Kalai, Xin Li, and Anup Rao. 2-source extractors under computational assumptions and cryptography with defective randomness. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pages 617-628, 2009. Google Scholar
  44. Yael Tauman Kalai, Xin Li, Anup Rao, and David Zuckerman. Network extractor protocols. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pages 654-663, 2008. Google Scholar
  45. Jesse Kamp, Anup Rao, Salil P. Vadhan, and David Zuckerman. Deterministic extractors for small-space sources. Journal of Computer and System Sciences, 77:191-220, 2011. URL: https://doi.org/10.1016/j.jcss.2010.06.014.
  46. Jesse Kamp and David Zuckerman. Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. Siam Journal on Computing, 36:1231-1247, 2007. URL: https://doi.org/10.1137/S0097539705446846.
  47. Mark Lewko. An explicit two-source extractor with min-entropy rate near 4/9. Mathematika, 65(4):950-957, 2019. URL: https://doi.org/10.1112/S0025579319000238.
  48. Jiatu Li and Tianqi Yang. 3.1n - o(n) circuit lower bounds for explicit functions. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, pages 1180-1193, New York, NY, USA, 2022. Association for Computing Machinery. Google Scholar
  49. Xin Li. Improved constructions of three source extractors. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, pages 126-136, 2011. Google Scholar
  50. Xin Li. A new approach to affine extractors and dispersers. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC, 2011. Google Scholar
  51. Xin Li. Design extractors, non-malleable condensers and privacy amplification. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing, pages 837-854, 2012. Google Scholar
  52. Xin Li. Non-malleable extractors, two-source extractors and privacy amplification. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 2012. Google Scholar
  53. Xin Li. Extractors for a constant number of independent sources with polylogarithmic min-entropy. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, pages 100-109, 2013. Google Scholar
  54. Xin Li. New independent source extractors with exponential improvement. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing, pages 783-792, 2013. Google Scholar
  55. Xin Li. Three-source extractors for polylogarithmic min-entropy. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), pages 863-882, Los Alamitos, CA, USA, October 2015. IEEE Computer Society. Google Scholar
  56. Xin Li. Improved two-source extractors, and affine extractors for polylogarithmic entropy. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pages 168-177. IEEE Computer Society, 2016. Google Scholar
  57. Xin Li. Improved non-malleable extractors, non-malleable codes and independent source extractors. In Proceedings of the 49th Annual ACM Symposium on Theory of Computing, 2017. Google Scholar
  58. Xin Li. 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, pages 1144-1156, New York, NY, USA, 2017. Association for Computing Machinery. Google Scholar
  59. Xin Li. Non-malleable extractors and non-malleable codes: Partially optimal constructions. In Amir Shpilka, editor, 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA, volume 137 of LIPIcs, pages 28:1-28:49. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.CCC.2019.28.
  60. Xin Li. Two source extractors for asymptotically optimal entropy, and (many) more. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023. Google Scholar
  61. Xin Li and Yan Zhong. Explicit directional affine extractors and improved hardness for linear branching programs. Technical report, Arxiv, 2023. URL: https://arxiv.org/abs/2304.11495.
  62. C. J. Lu, Omer Reingold, Salil Vadhan, and Avi Wigderson. Extractors: Optimal up to constant factors. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 602-611, 2003. Google Scholar
  63. Raghu Meka. Explicit resilient functions matching ajtai-linial. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '17, pages 1132-1148, USA, 2017. Society for Industrial and Applied Mathematics. Google Scholar
  64. Noam Nisan and David Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-52, 1996. Google Scholar
  65. Anup Rao. Extractors for a constant number of polynomially small min-entropy independent sources. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006. Google Scholar
  66. Anup Rao. Extractors for low-weight affine sources. In Proc. of the 24th CCC, 2009. Google Scholar
  67. Ran Raz. Extractors with weak random seeds. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 11-20, 2005. Google Scholar
  68. Ran Raz and Amir Yehudayoff. Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. Journal of Computer and System Sciences, 77:167-190, 2011. URL: https://doi.org/10.1016/j.jcss.2010.06.013.
  69. Ronen Shaltiel. Dispersers for affine sources with sub-polynomial entropy. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science, 2011. Google Scholar
  70. Luca Trevisan and Salil P. Vadhan. Extracting Randomness from Samplable Distributions. In IEEE Symposium on Foundations of Computer Science, pages 32-42, 2000. URL: https://doi.org/10.1109/SFCS.2000.892063.
  71. Emanuele Viola. Extractors for circuit sources. SIAM Journal on Computing, 43(2):655-672, 2014. Google Scholar
  72. Amir Yehudayoff. Affine extractors over prime fields. Combinatorica, 31(2):245-256, 2011. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact