Sparse Pseudorandom Distributions
- 6 July 2001
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
- p. 113-127
- https://doi.org/10.1007/0-387-34805-0_12
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Homogeneous measures and polynomial time invariantsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- On the existence of pseudorandom generatorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- One way functions and pseudorandom generatorsCombinatorica, 1987
- The complexity of perfect zero-knowledgePublished by Association for Computing Machinery (ACM) ,1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- How to construct random functionsJournal of the ACM, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952