Recently, the problem of privacy amplification with an active adversary has received a lot of attention. Given a shared n-bit weak random source X with min-entropy k and a security parameter s, the main goal is to construct an explicit 2-round privacy amplification protocol that achieves entropy loss O(s). Dodis and Wichs [DW09] showed that optimal protocols can be achieved by constructing explicit non-malleable extractors. However, the best known explicit non-malleable extractor only achieves k = 0.49n [Li12b] and evidence in [Li12b] suggests that constructing explicit non-malleable extractors for smaller min-entropy may be hard. In an alternative approach, Li [Li12a] introduced the notion of a non-malleable condenser and showed that explicit non-malleable condensers also give optimal privacy amplification protocols. In this paper, we give the first construction of non-malleable condensers for arbitrary minentropy. Using our construction, we obtain a 2-round privacy amplification protocol with optimal entropy loss for security parameter up to s = Ω( √ k). This is the first protocol that simultaneously achieves optimal round complexity and optimal entropy loss for arbitrary min-entropy k. We also generalize this result to obtain a protocol that runs in O(s/ √ k) rounds with optimal entropy loss, for security parameter up to s = Ω(k). This significantly improves the protocol in [CKOR10] . Finally, we give a better non-malleable condenser for linear min-entropy, and in this case obtain a 2-round protocol with optimal entropy loss for security parameter up to s = Ω(k), which improves the entropy loss and communication complexity of the protocol in [Li12b] . * Supported by a Simons postdoctoral fellowship.
He then constructed explicit non-malleable condensers for entropy as small as k = polylog(n) in REF and used them to give the first tworound privacy amplification protocol with optimal entropy loss O(s), subject to the constraint that k ≥ s 2 .
Non-Malleable Condensers for Arbitrary Min-Entropy, and Almost Optimal Protocols for Privacy Amplification
ArXiv
ArXiv
Computer Science Mathematics