How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
SIAM Journal on Computing
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
Journal of Computer and System Sciences
Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Journal of Computer and System Sciences
Characterizing linear size circuits in terms of privacy
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pseudo-random generators for all hardnesses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Randomness in Private Computations
SIAM Journal on Discrete Mathematics
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
On the Number of Random Bits in Totally Private Computation
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Lower bounds on the amount of randomness in private computation
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Sufficient conditions for collision-resistant hashing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Pseudorandom generators from one-way functions: a simple construction for any hardness
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Infeasibility of instance compression and succinct PCPs for NP
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Weak Pseudorandom Functions in Minicrypt
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Worst-Case to Average-Case Reductions Revisited
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lower bounds for non-interactive zero-knowledge
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Basing weak public-key cryptography on strong one-way functions
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On the security of pseudorandomized information-theoretically secure schemes
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
Leftover Hash Lemma, revisited
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
A mathematical problem for security analysis of hash functions and pseudorandom generators
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Protecting circuits from leakage: the computationally-bounded and noisy cases
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
The Complexity of Distributions
SIAM Journal on Computing
Practical leakage-resilient pseudorandom objects with minimum public randomness
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Shielding circuits with groups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Iterated group products and leakage resilience against NC1
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |
We consider the following question: Can every efficiently samplable distribution be efficiently sampled, up to a small statistical distance, using roughly as much randomness as the length of its output? Towards a study of this question we generalize the current theory of pseudorandomness and consider pseudorandom generators that fool non-boolean distinguishers (nb-PRGs). We show a link between nb-PRGs and a notion of function compression, introduced by Harnik and Naor [16]. (A compression algorithm for f should efficiently compress an input x in a way that will preserve the information needed to compute f(x).) By constructing nb-PRGs, we answer the above question affirmatively under the following types of assumptions:Cryptographic incompressibility assumptions (that are implied by, and seem weaker than, "exponential" cryptographic assumptions).Nisan-Wigderson style (average-case) incompressibility assumptions for polynomial-time computable functions.No assumptions are needed for answering our question affirmatively in the case of constant depth samplers.To complement the above, we extend an idea from [16] and establish the following win-win situation. If the answer to our main question is "no", then it is possible to construct a (weak variant of) collision-resistant hash function from any one-way permutation. The latter would be considered a surprising result, as a black-box construction of this type was ruled out by Simon [35].Finally, we present an application of nb-PRGs to information theoretic cryptography. Specifically, under any of the above assumptions, efficient protocols for information-theoretic secure multiparty computation never need to use (much) more randomness than communication.