| | |
Summary: 2-Source Extractors Under Computational Assumptions and Cryptography
with Defective Randomness
Yael Tauman Kalai
Microsoft Research New England
yael@microsoft.com
Xin Li
Department of Computer Science
University of Texas at Austin
lixints@cs.utexas.edu
Anup Rao
Institute for Advanced Study
arao@ias.edu
Abstract-- We show how to efficiently extract truly ran-
dom bits from two independent sources of linear min-entropy,
under a computational assumption. The assumption we rely
on is the existence of an efficiently computable permutation
f1
, such that for any source X {0, 1}n
with linear min-
entropy, any circuit of size poly(n) cannot invert f(X) with
|
