Hastad, J., "Pseudo-Random Generators with Uniform Assumptions", Proc. 22nd ACM Symp. on Theory of Computing, pp. 395--404, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Round Complexity of Secure Protocols - Beaver, Micali, Rogaway (1990) (45 citations) (Correct)
....and Micali [BM82] and Yao [Ya82b] who showed that such generators exist under suitable complexity assumptions. Complexity assumption The only complexity assumption used for our main theorem is the existence of a pseudorandom generator. Recently, Impagliazzo, Levin and Luby [ILL89] and Hastad [Ha90] have shown this assumption to be equivalent to the existence of a one way function. The structure of our protocol The protocol we construct has two phases. The first phase is a non cryptographic protocol. The only information revealed to players in the first phase of the protocol are some random ....
J. Hastad, "Pseudo-Random Generators with Uniform Assumptions," these proceedings.
On the Theory of Average Case Complexity - Ben-David, Chor, Goldreich, Luby (1997) (28 citations) (Correct)
No context found.
Hastad, J., "Pseudo-Random Generators with Uniform Assumptions", Proc. 22nd ACM Symp. on Theory of Computing, pp. 395--404, 1990.
A Note On Computational Indistinguishability - Oded Goldreich (1990) (14 citations) (Correct)
No context found.
Hastad, J., "Pseudo-Random Generators with Uniform Assumptions", preprint, 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC