Welcome to roadinet.com on July 10 2009.
This is an internet experiment running to monitor browsing habbits of individuals through wikipedia contents.

Oded Goldreich

From Wikipedia, the free encyclopedia

Jump to: navigation, search
Oded Goldreich
Oded Goldreich
Oded Goldreich
Born 1957
Tel Aviv, Israel
Citizenship Israeli
Nationality Israeli
Fields Computer Science, Cryptography
Institutions Weizmann Institute of Science,
Technion
Alma mater Technion
Doctoral advisor Shimon Even
Known for Zero Knowledge Proof, Foundation of Cryptography

Oded Goldreich (Hebrew: עודד גולדרייך‎; b. 1957) is a professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel. His research interests lie within the theory of computing. Specifically, the interplay of randomness and computation, the foundations of cryptography and complexity theory at large.

Goldreich made notable contributions to the development of pseudorandomness[1][2], zero knowledge proofs[3], secure function evaluation[4], and other areas in computational complexity.


Goldreich also authored several books including: Foundations of Cryptography which comes in two volumes (volume 1 in 2001 and volume 2 in 2004), Computational Complexity: A Conceptual Perspective (2008), andModern Cryptography, Probabilistic Proofs and Pseudorandomness (1998).

[edit] External links

[edit] References

  1. ^ Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to Construct Random Functions. Journal of the ACM, Vol. 33, No. 4, Oct. 1986, pages 792--807.
  2. ^ Oded Goldreich and Leonid Levin. Hard-core Predicates for any One-Way Function. In the proceedings of the 21st ACM Symp. on Theory of Computing, pages 25-32, 1989.
  3. ^ Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that Yield Nothing But their Validity or All Languages in NP have Zero-Knowledge Proofs. Journal of the ACM, Vol. 38, No. 3, July 1991, pages 691--729.
  4. ^ Oded Goldreich, Silvio Micali, and Avi Wigderson. How to Play any Mental Game or a Completeness Theorem for Protocols with Honest Majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 218-229, ACM, 1987.
Personal tools

Visit joltnews for the latest headlines
Visit bloit.com for company information
Geed Media does computer consulting on long island.
This page viewed times. See Logs