### Abstract

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 O(log n · log log n) that works for entropy (log n). This improves upon a recent exciting construction by Chattopadhyay, Goyal, and Li (STOC'16) that has seed length O(log2 n) and requires entropy (log2 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(log n), 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.

Original language | English (US) |
---|---|

Title of host publication | 31st Conference on Computational Complexity, CCC 2016 |

Editors | Ran Raz |

Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |

Pages | 8:1-8:29 |

ISBN (Electronic) | 9783959770088 |

DOIs | |

State | Published - May 1 2016 |

Event | 31st Conference on Computational Complexity, CCC 2016 - Tokyo, Japan Duration: May 29 2016 → Jun 1 2016 |

### Publication series

Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|

Volume | 50 |

ISSN (Print) | 1868-8969 |

### Other

Other | 31st Conference on Computational Complexity, CCC 2016 |
---|---|

Country | Japan |

City | Tokyo |

Period | 5/29/16 → 6/1/16 |

### All Science Journal Classification (ASJC) codes

- Software

### Keywords

- Explicit constructions
- Extractors
- Non-malleable

## Fingerprint Dive into the research topics of 'Non-malleable extractors - New tools and improved constructions'. Together they form a unique fingerprint.

## Cite this

*31st Conference on Computational Complexity, CCC 2016*(pp. 8:1-8:29). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 50). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CCC.2016.8