---
res:
bibo_abstract:
- Consider a joint distribution (X,A) on a set. We show that for any family of distinguishers,
there exists a simulator such that 1 no function in can distinguish (X,A) from
(X,h(X)) with advantage ε, 2 h is only O(2 3ℓ ε -2) times less efficient than
the functions in. For the most interesting settings of the parameters (in particular,
the cryptographic case where X has superlogarithmic min-entropy, ε > 0 is negligible
and consists of circuits of polynomial size), we can make the simulator h deterministic.
As an illustrative application of our theorem, we give a new security proof for
the leakage-resilient stream-cipher from Eurocrypt'09. Our proof is simpler and
quantitatively much better than the original proof using the dense model theorem,
giving meaningful security guarantees if instantiated with a standard blockcipher
like AES. Subsequent to this work, Chung, Lui and Pass gave an interactive variant
of our main theorem, and used it to investigate weak notions of Zero-Knowledge.
Vadhan and Zheng give a more constructive version of our theorem using their new
uniform min-max theorem.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Dimitar
foaf_name: Jetchev, Dimitar
foaf_surname: Jetchev
- foaf_Person:
foaf_givenName: Krzysztof Z
foaf_name: Pietrzak, Krzysztof Z
foaf_surname: Pietrzak
foaf_workInfoHomepage: http://www.librecat.org/personId=3E04A7AA-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-9139-1654
bibo_doi: 10.1007/978-3-642-54242-8_24
bibo_volume: 8349
dct_date: 2014^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/978-364254241-1
dct_language: eng
dct_publisher: Springer@
dct_title: How to fake auxiliary input@
...