On beating the hybrid argument

Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola

Research output: Contribution to journalArticlepeer-review


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 ϵ/k-predictability. This paper studies the consequences of avoiding this loss -- what we call “beating the hybrid argument” -- and develops new proof techniques that circumvent the loss in certain natural settings. Our main results are:
Original languageEnglish
Pages (from-to)809-843
Number of pages35
JournalTheory of Computing
Issue number1
StatePublished - 2013


Dive into the research topics of 'On beating the hybrid argument'. Together they form a unique fingerprint.
  • On beating the hybrid argument

    Fefferman, B., Shaltiel, R., Umans, C. & Viola, E., 2012, ITCS 2012 - Innovations in Theoretical Computer Science Conference. p. 468-483 16 p. (ITCS 2012 - Innovations in Theoretical Computer Science Conference).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Cite this