Oded Goldreich

Oded Goldreich (Hebrew עודד גולדרייך; born February 4, 1957 in Tel Aviv) is an Israeli mathematician and computer scientist.

Goldreich studied at the Technion in Haifa, where in 1982 he took his Master's degree in computer science and received his doctorate in 1983 with Shimon Even. After that, he was at the Computer Science Department of the Technion and from 1983 to 1986 ( and 1995-1998 ) at the Laboratory for Computer Science of the Massachusetts Institute of Technology (MIT). Since 1994 he is professor at the Weizmann Institute of Science.

Goldreich deals with, inter alia, with cryptography ( in the modern sense as a theory of information systems, which are resistant to abuse), the pseudo-random properties, complexity theory and probabilistic algorithms. He is known for his work on zero-knowledge proof systems. In 1987, he was with Avi Wigderson and Silvio Micali the existence of a secure protocol for any multi-party communication problem (Secure Multiparty Computation ) using zero-knowledge proofs (Journal of the ACM, 1991).

In 1994 he was invited speaker at the International Congress of Mathematicians in Zurich. He is a corresponding member of the Bavarian Academy of Sciences.

Writings

  • Modern cryptography, probabilistic proofs and pseudo- randomness. Springer 1998.
  • Foundations of Cryptography. 2 volumes, 2001, 2004 ( a third volume is planned).
  • Computational Complexity: a conceptual perspective. Cambridge University Press 2008
  • Computational Complexity, in Engquist, Schmid Mathematics Unlimited -2001 and Beyond, Springer 2000
  • With Wigderson, Micali: proofs did yield nothing but Their validity or all languages ​​in NP have zero-knowledge proof system. Journal of the ACM ( Association of Computing Machinery ), Vol 38, 1991, S.691 - 729th
  • By Goldwasser, Micali, "How to construct pseudo- random functions", Journal ACM, Bd.33, 1986
  • Goldreich " Multiparticle Secure Communication"
  • Goldreich Pseudo Randomness, Notices AMS, November 1999
613650
de