Abstract
Pseudorandom distributions on n-bit strings are ones which cannot be effi- ciently distinguished from the uniform distribution on strings of the same length. Namely, the expected behavior of any polynomial-time algorithm on a pseudorandom input is (almost) the same as on a random (i.e. uniformly chosen) input. Clearly, the uni- form distribution is a pseudorandom one. But do such trivial cases exhaust the notion of pseudorandomness? Under certain intractability assumptions the existence of pseudoran- dom generators was proven, which in turn implies the existence of non-trivial pseudoran- dom distributions. In this paper we investigate the existence of pseudorandom distribu- tions, using no unproven assumptions.
We show that sparse pseudorandom distributions do exist. A probability distribu- tion is called sparse if it is concentrated on a negligible fraction of the set of all strings (of the same length). It is shown that sparse pseudorandom distributions can be gen- erated by probabilistic (non-polynomial time) algorithms, and some of them are not sta- tistically close to any distribution induced by probabilistic polynomial-time algorithms.
Finally, we show the existence of probabilistic algorithms which induce pseudoran- dom distributions with polynomial-time evasive support. Any polynomial-time algorithm trying to find a string in their support will succeed with negligible probability. A conse- quence of this result is a proof that the original definition of zero-knowledge is not robust under sequential composition. (This was claimed before, leading to the introduction of more robust formulations of zero-knowledge.)
First author was supported by grant No. 86-00301 from the United States - Israel Binational Science Foundation (BSF), Jerusalem, Israel.
Chapter PDF
References
Blum, M., and Micali, S., “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits”, SIAM Jour. on Computing, Vol. 13, 1984, pp. 850–864.
Chemoff, H., “A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations”, Annals of Mathematical Statistics, Vol. 23, 1952, pp. 493–507.
Feige, U., M.Sc. Thesis. Weizmann Institute, 1987.
Fortnow, L., “The Complexity of Perfect Zero-Knowledge”, Proc. of 19th STOC, 1987, pp. 204–209.
Goldreich, O., S. Goldwasser, and S. Micali, “How to Construct Random Functions”, Jour. of ACM, Vol. 33, No. 4, 1986, pp. 792–807.
Goldreich, O., Krawczyk, H. and Luby, M., “On the Existence of Pseudorandom Generators”, Proc. of the 29th IEEE Symp. on Foundation of Computer Science, 1988, pp. 12–24.
Goldreich, O., S. Micali, and A. Wigderson, “Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design”, Proc. 27th FOCS, 1986, pp. 174–187.
Goldwasser, S., S. Micali, and C. Rackoff, “Knowledge Complexity of Interactive Proofs”, Proc. 17th STOC, 1985, pp. 291–304.
Goldwasser, S., S. Micali, and C. Rackoff, “Knowledge Complexity of Interactive Proofs”, SIAM Jour. on Computing, Vol. 18, 1989, pp. 186–208.
Hoeffding W., “Probability Inequalities for Sums of Bounded Random Variables”, Journal of the American Statistical Association, Vol. 58, 1963, pp. 13–30.
Impagliazzo, R., L.A., Levin and M.G. Luby, “Pseudo-Random Generation from One-Way Functions”, Proc. 21st STOC, 1989, pp. 12–24.
L.A. Levin, “One-Way Function and Pseudorandom Generators”, Combinatorica, Vol. 7, No. 4, 1987, pp. 357–363.
L. A. Levin, “Homogeneous Measures and Polynomial Time Invariants”, Proc. of the 29th IEEE Symp. on Foundation of Computer Science, 1988, pp. 36–41.
M. Luby and C. Rackoff, “How to Construct Pseudorandom Permutations From Pseudorandom Functions”, SIAM Jour. on Computing, Vol. 17, 1988, pp. 373–386.
Nissan, N. and Wigderson, A., “Hardness vs. Randomness”, Proc. of the 29th IEEE Symp. on Foundation of Computer Science, 1988, pp. 2–11.
Oren, Y., “On the Cunning Power of Cheating Verifiers: Some Observations About Zero-Knowledge Proofs”, Proc. of the 28th IEEE Symp. on Foundation of Computer Science, 1987, pp. 462–471.
Tompa, M, and H. Woll, “Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information”, Proc. of the 28th IEEE Symp. on Foundation of Computer Science, 1987, pp. 472–482.
Yao, A.C., “Theory and Applications of Trapdoor Functions”, Proc. of the 23rd IEEE Symp. on Foundation of Computer Science, 1982, pp. 80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldreich, O., Krawczyk, H. (1990). Sparse Pseudorandom Distributions. In: Brassard, G. (eds) Advances in Cryptology — CRYPTO’ 89 Proceedings. CRYPTO 1989. Lecture Notes in Computer Science, vol 435. Springer, New York, NY. https://doi.org/10.1007/0-387-34805-0_12
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_12
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97317-3
Online ISBN: 978-0-387-34805-6
eBook Packages: Springer Book Archive