DocumentCode :
2434459
Title :
Non-malleable Extractors, Two-Source Extractors and Privacy Amplification
Author :
Li, Xin
Author_Institution :
Univ. of Washington, Seattle, WA, USA
fYear :
2012
fDate :
20-23 Oct. 2012
Firstpage :
688
Lastpage :
697
Abstract :
In [1], Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor is a much stronger version of a seeded extractor. Dodis and Wichs showed that such an object can be used to give optimal privacy amplification protocols with an active adversary. Previously, there are only two known constructions of nonmalleable extractors [2], [3]. Both constructions only work for (n, k)-sources with k >; n/2. Interestingly, both constructions are also two-source extractors. In this paper, we present a strong connection between nonmalleable extractors and two-source extractors. The first part of the connection shows that non-malleable extractors can be used to construct two-source extractors. This partially explains why previous constructions of non-malleable extractors only work for entropy rate >; 1/2, and why explicit non-malleable extractors for small min-entropy may be hard to get. The second part of the connection shows that certain two-source extractors can be used to construct non-malleable extractors. Using this connection, we obtain the first construction of non-malleable extractors for k <; n/2. Finally, despite the lack of explicit non-malleable extractors for arbitrarily linear entropy, we give the first 2-round privacy amplification protocol with asymptotically optimal entropy loss and communication complexity for (n, k) sources with k = αn for any constant α >; 0. This dramatically improves previous results and answers an open problem in [2].
Keywords :
communication complexity; data privacy; entropy; protocols; 2-round privacy amplification protocols; active adversary; arbitrarily linear entropy; asymptotically optimal entropy loss; communication complexity; entropy rate; min-entropy; nonmalleable extractors; seeded extractor; two-source extractors; Agricultural machinery; Complexity theory; Entropy; Privacy; Protocols; Random variables; Vectors; extractor; non-malleable; privacy amplification;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science (FOCS), 2012 IEEE 53rd Annual Symposium on
Conference_Location :
New Brunswick, NJ
ISSN :
0272-5428
Print_ISBN :
978-1-4673-4383-1
Type :
conf
DOI :
10.1109/FOCS.2012.26
Filename :
6375348
Link To Document :
بازگشت