Proceedings ArticleDOI
Extracting randomness: how and why. A survey
Noam Nisan
- pp 44-58
Reads0
Chats0
TLDR
This manuscript surveys extractors and dispersers: what they are, how they can be designed, and some of their applications.Abstract:
Extractors are Boolean functions that allow, in some precise sense, extraction of randomness from somewhat random distributions. Extractors, and the closely related "Dispersers", exhibit some of the most "random-like" properties of explicitly constructed combinatorial structures. In turn, extractors and dispersers have many applications in "removing randomness" in various settings and in making randomized constructions explicit. This manuscript surveys extractors and dispersers: what they are, how they can be designed, and some of their applications. The work described is due to of a long list of research papers by various authors-most notably by David Zuckerman.read more
Citations
More filters
Journal ArticleDOI
Extracting Randomness
Noam Nisan,Amnon Ta-Shma +1 more
TL;DR: This paper presents a new tool for constructing explicit extractors and gives two new constructions that greatly improve upon previous results, and shows how to build good explicit mergers, and how mergers can be used to build better extractors.
Book ChapterDOI
Unconditional Security Against Memory-Bounded Adversaries
Christian Cachin,Ueli Maurer +1 more
TL;DR: A private-key cryptosystem and a protocol for key agreement by public discussion that are unconditionally secure based on the sole assumption that an adversary's memory capacity is limited are proposed.
Proceedings ArticleDOI
Extracting all the randomness and reducing the error in Trevisan's extractors
TL;DR: In this article, the authors showed that a weaker notion of "combinatorial design" suffices for the Nisan-Wigderson pseudorandom generator, which underlies the recent extractor of Trevisan.
Proceedings ArticleDOI
Practical leakage-resilient identity-based encryption from simple assumptions
TL;DR: This work designs the first Leakage-Resilient Identity-Based Encryption (LR-IBE) systems from static assumptions in the standard model, and derives these schemes by applying a hash proof technique from Alwen et.al. (Eurocrypt '10) to variants of the existing IBE schemes of Boneh-Boyen, Waters, and Lewko-Waters.
Book ChapterDOI
Constant-Round Oblivious Transfer in the Bounded Storage Model
TL;DR: A constant round protocol for Oblivious Transfer in Maurer's bounded storage model that has only 5 messages and uses constructions of almost t-wise independent permutations, randomness extractors and averaging samplers from the theory of derandomization.
References
More filters
Book
The Probabilistic Method
TL;DR: A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.
Proceedings ArticleDOI
Proof verification and hardness of approximation problems
TL;DR: Agarwal et al. as discussed by the authors showed that the MAXSNP-hard problem does not have polynomial-time approximation schemes unless P=NP, and for some epsilon > 0 the size of the maximal clique in a graph cannot be approximated within a factor of n/sup 1/ε / unless P = NP.
Proceedings ArticleDOI
Pseudo-random generation from one-way functions
TL;DR: From one-way functions of type (1) or (2) it is shown how to construct pseudo-random generators secure against small circuits or fast algorithms, respectively, and vice-versa.
Journal ArticleDOI
Unbiased bits from sources of weak randomness and probabilistic communication complexity
Benny Chor,Oded Goldreich +1 more
TL;DR: A new model for weak random physical sources is presented that strictly generalizes previous models and provides a fruitful viewpoint on problems studied previously such as Extracting almost-perfect bits from sources of weak randomness.
Proceedings ArticleDOI
Probabilistic checking of proofs; a new characterization of NP
Sanjeev Arora,Shmuel Safra +1 more
TL;DR: The authors give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs can be verified probabilistically in polynomial time using logarithmic number of random bits and sub-logarital number of queries to the proof.