Goldreich has also authored several books including: Foundations of Cryptography[14] which comes in two volumes (volume 1 in 2001[15] and volume 2 in 2004), Computational Complexity: A Conceptual Perspective[16] (2008), and Modern Cryptography, Probabilistic Proofs and Pseudorandomness[17] (1998).[15]
Goldreich received the Knuth prize in 2017 for "fundamental and lasting contributions to theoretical computer science in many areas including cryptography, randomness, probabilistically checkable proofs, inapproximability, property testing as well as complexity theory in general. Goldreich has, in addition to his outstanding research contributions, advanced these fields through many survey articles and several first class textbooks. He has contributed eminent results, new basic definitions and pointed to new directions of research. Goldreich has been one of the driving forces for the theoretical computer science community for three decades."[1]
In 2021 he was selected by committee to win the Israel Prize in mathematics. Education Minister Yoav Gallant vetoed his selection over Goldreich's alleged support of the boycott, divestment and sanctions movement (BDS) against Israel. One of the reasons for the decision was a letter signed by Goldreich calling German parliament not to equate BDS with anti-semitism.[18][19] However, according to Goldreich, he did not support BDS but instead signed a petition calling for the halt of EU funding for the Israeli Ariel University on the occupied West Bank.[20] The prize committee petitioned to the Supreme Court of Israel to ensure that Goldreich will win the prize.[21] On 8 April 2021 Israel's Supreme Court of Justice ruled in favor of Gallant's petition so that Goldreich could receive the prize that year, giving Gallant a month to further examine the issue.[22] On 11 April 2021, a 2004 Israeli Prize winner,[23] Professor David Harel, decided to share his award with Goldreich in protest of the government's decision to not award the 2021 prize for Professor Goldreich.[24] In August 2021 the Supreme Court wrote, "we found appropriate at this stage to accept the position of the Attorney General that the Education Minister should be allowed to examine new information that he received only two days ago regarding a petition that Professor Goldreich signed that was publicized around two weeks ago." This meant that
the matter should be resolved by the new Minister of Education Yifat Shasha-Biton.[25] In November 2021, Shasha-Biton announced that she would block Goldreich from receiving the prize.[26] In December 2021 Attorney General Mandelblit told the High Court that Prof. Goldreich should be given the Israel Prize in Mathematics, despite Education Minister Shasha-Biton's decision.[27]
In an editorial, the Jerusalem Post wrote that Goldreich's "[c]alling for the boycott of professional colleagues... is a red line that shouldn't be crossed".[28]AHaaretz editorial said that Shasha-Biton's decision meant "the most prestigious prize awarded by Israel will not be the mark of scientific excellence but of loyalty to the government".[29] In March 2022 the High Court of Israel ruled that the 2021 prize had to be awarded to Prof. Goldreich.[30]
^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.
^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.
^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.
^ abOded Goldreich, Shafi Goldwasser, and Dana Ron. 1998 Property Testing and its connection to Learning and Approximation.
Journal of the ACM, pages 653-750.
^B. Chor and O. Goldreich. Unbiased Bits From Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM J. Comp., Vol. 17, No. 2, April 1988, pages 230-261.
^Mihir Bellare, O. Goldreich and M. Sudan. Free Bits, PCPs and Non-Approximability -- Towards Tight Results. SIAM J. Comp., Vol. 27, No. 3, pages 804-915, June 1998.
