On beating the hybrid argument

Bill Fefferman; Ronen Shaltiel; Christopher Umans; Emanuele Viola

doi:10.4086/toc.2013.v009a026

On beating the hybrid argument

Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	809-843
Number of pages	35
Journal	Theory of Computing
Volume	9
Issue number	1
DOIs	https://doi.org/10.4086/toc.2013.v009a026
State	Published - 2013

Access to Document

10.4086/toc.2013.v009a026

1 Conference contribution

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 proceeding › Conference contribution › peer-review

Open Access

Cite this

@article{8f68081f2bf04aee86347ed017e6abdb,

title = "On beating the hybrid argument",

abstract = "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: ",

author = "Bill Fefferman and Ronen Shaltiel and Christopher Umans and Emanuele Viola",

year = "2013",

doi = "10.4086/toc.2013.v009a026",

language = "אנגלית",

volume = "9",

pages = "809--843",

journal = "Theory of Computing",

issn = "1557-2862",

publisher = "University of Chicago, Department of Computer Science",

number = "1",

}

TY - JOUR

T1 - On beating the hybrid argument

AU - Fefferman, Bill

AU - Shaltiel, Ronen

AU - Umans, Christopher

AU - Viola, Emanuele

PY - 2013

Y1 - 2013

N2 - 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:

AB - 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:

U2 - 10.4086/toc.2013.v009a026

DO - 10.4086/toc.2013.v009a026

M3 - מאמר

SN - 1557-2862

VL - 9

SP - 809

EP - 843

JO - Theory of Computing

JF - Theory of Computing

IS - 1

ER -

On beating the hybrid argument

Abstract

Access to Document

Fingerprint

Related research output

On beating the hybrid argument

Cite this