PL EN
REVIEW PAPER
FLEXIBLE TWO-SOURCE EXTRACTORS AND APPLICATIONS
 
 
More details
Hide details
1
Uniwersytet Warszawski
 
 
Publication date: 2014-12-05
 
 
SBN 2014;6(2): 239–245
 
KEYWORDS
ABSTRACT
We introduce new notion – flexible two-source extractor. We show various methods and theorems that fill in cases not covered by Lidsey’s lemma and Leftover Hash Lemma. We present flexible version of Barak’s theorem for strong and weak flexible extractors. We also show possible application of flexible extractors to leakage resilient storage schemes. We are able to obtain better parameters then in standard extraction case, moreover we are able to obtain resilience to adaptive leakages.
 
REFERENCES (8)
1.
D. Aggarwal, Y. Dodis, T. Kazan, and M. Obremski, Reductions and their applications, unpublished manuscript, 2014.
 
2.
D. Aggarwal, Y. Dodis, and S. Lovett, Non-malleable codes from additive combinatorics, FOCS, 2014.
 
3.
D. Aggarwal, S. Dziembowski, T. Kazan, and M. Obremski, Interactive non-malleable codes, unpublished manuscript, 2014.
 
4.
B. Barak, Y. Dodis, H. Krawczyk, O. Pereira, K. Pietrzak, F.-X. Standaert, and Y. Yu, Leftover hash lemma, revisited, 2011, http://eprint.iacr.org/.
 
5.
F. Dav´i, S. Dziembowski, and D. Venturi, Leakage-resilient storage, Security and Cryptography for Networks, 2010, p. 121–137.
 
6.
S. Dziembowski, T. Kazana, and M. Obremski, Non-malleable codes from two-source extractors, CRYPTO, 2013.
 
7.
T. Holenstein, Pseudorandom generators from one-way functions: A simple construction for any hardness, In TCC, 2006, pp. 443–461.
 
8.
A. Rao, An exposition of bourgain 2-source extractor, In Electronic Colloquium on Computational Complexity (ECCC), vol. 14, 2007, page 034.
 
ISSN:2082-2677