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

• Type: Journal
• Year: 2010
• Where: ECCC
• Authors: Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola
• Keywords: Certain Natural Settings, ECCC 2010, ECommerce, Hybrid Argument, Individual Bits