Sciweavers

ECCC
2010

On beating the hybrid argument

12 years 10 months ago
On beating the hybrid argument
The hybrid argument allows one to relate the distinguishability of a distribution (from uniform) to the predictability of individual bits given a prefix. The argument incurs a loss of a factor k equal to the bit-length of the distributions: -distinguishability implies only /k-predictability. This paper studies the consequences of avoiding this loss
Bill Fefferman, Ronen Shaltiel, Christopher Umans,
Added 17 May 2011
Updated 17 May 2011
Type Journal
Year 2010
Where ECCC
Authors Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola
Comments (0)