Non-Malleable Extractors - New Tools and Improved Constructions

被引:11
|
作者
Cohen, Gil [1 ]
机构
[1] CALTECH, Pasadena, CA 91125 USA
关键词
extractors; non-malleable; explicit constructions; NONMALLEABLE EXTRACTORS; CONSTANT NUMBER; RANDOMNESS; ENTROPY;
D O I
10.4230/LIPIcs.CCC.2016.8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A non-malleable extractor is a seeded extractor with a very strong guarantee the output of a non-malleable extractor obtained using a typical seed is close to uniform even conditioned on the output obtained using any other seed. The first contribution of this paper consists of two new and improved constructions of non-malleable extractors: We construct a non-malleable extractor with seed-length 0(log n center dot log log n) that works for entropy Omega(log n). This improves upon a recent exciting construction by Chattopadhyay, Goyal, and Li (STOC'16) that has seed length O(log(2) n) and requires entropy Omega(log(2) n). Secondly, we construct a non-malleable extractor with optimal seed length O(log n) for entropy n/polylog n. Prior to this construction, non-malleable extractors with a logarithmic seed length, due to Li (FOCS'12), required entropy 0.49n. Even non-malleable condensers with seed length O(logn), by Li (STOC'12), could only support linear entropy. We further devise several tools for enhancing a given non-malleable extractor in a black-box manner. One such tool is an algorithm that reduces the entropy requirement of a non-malleable extractor at the expense of a slightly longer seed. A second algorithm increases the output length of a non-malleable extractor from constant to linear in the entropy of the source. We also devise an algorithm that transforms a non-malleable extractor to the so-called t-non-malleable extractor for any desired t. Besides being useful building blocks for our constructions, we consider these modular tools to be of independent interest.
引用
收藏
页数:29
相关论文
共 50 条
  • [1] Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions
    Li, Xin
    34TH COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2019), 2019, 137
  • [2] Improved Non-malleable Extractors, Non-malleable Codes and Independent Source Extractors
    Li, Xin
    STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 1144 - 1156
  • [3] Non-malleable Fuzzy Extractors
    Francati, Danilo
    Venturi, Daniele
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, ACNS 2024, PT I, 2024, 14583 : 135 - 155
  • [4] An Entropy Lower Bound for Non-Malleable Extractors
    Gur, Tom
    Shinkar, Igor
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (05) : 2904 - 2911
  • [5] Non-malleable Extractors with Shorter Seeds and Their Applications
    Yao, Yanqing
    Li, Zhoujun
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2015, 2015, 9462 : 293 - 311
  • [6] Non-Malleable Extractors, Two-Source Extractors and Privacy Amplification
    Li, Xin
    2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 688 - 697
  • [7] Design Extractors, Non-Malleable Condensers and Privacy Amplification
    Li, Xin
    STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 837 - 854
  • [8] Non-malleable Extractors and Codes, with Their Many Tampered Extensions
    Chattopadhyay, Eshan
    Goyal, Vipul
    Li, Xin
    STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 285 - 298
  • [9] Multi-source Non-malleable Extractors and Applications
    Goyal, Vipul
    Srinivasan, Akshayaram
    Zhu, Chenzhi
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2021, PT II, 2021, 12697 : 468 - 497
  • [10] Privacy Amplification and Non-Malleable Extractors Via Character Sums
    Dodis, Yevgeniy
    Li, Xin
    Wooley, Trevor D.
    Zuckerman, David
    2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 668 - 677