2026 Oded Goldreich: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	111	210	205	4	4	440	77017

Research.com Recognitions

2026 - Research.com Computer Science in Israel Leader Award
2025 - Research.com Computer Science in Israel Leader Award
2023 - Research.com Computer Science in Israel Leader Award
2022 - Research.com Computer Science in Israel Leader Award

Overview

Oded Goldreich is affiliated with the Weizmann Institute of Science in Israel. Their research spans several areas within computer science and mathematics, focusing on computational theory and related subfields.

The scientist's main fields of study include:

Computer Science
Mathematics

Within these fields, Goldreich's work touches on key subfields such as:

Computational Theory and Mathematics
Artificial Intelligence
Computer Vision and Pattern Recognition
Computer Networks and Communications
Electrical and Electronic Engineering

Main research topics addressed by this scientist are:

Complexity and Algorithms in Graphs
Machine Learning and Algorithms
Advanced Graph Theory Research
Cryptography and Data Security
Algorithms and Data Compression
Graph Theory and Algorithms
Semigroups and Automata Theory

Recent publications by Oded Goldreich include:

Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP, 2021, Theoretical Computer Science
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing, 2022, TheoretiCS
A Lower Bound on the Complexity of Testing Grained Distributions, 2023, Computational Complexity

Additional recent papers often coauthored or connected with Goldreich are:

Randomness Extraction from Somewhat Dependent Sources, 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Bovine Serum Albumin-Based Sponges as Biocompatible Adsorbents: Development, Characterization, and Perfluorooctane Sulfonate Removal Efficiency, 2025, Small Science

Throughout Goldreich's career, frequent coauthors include:

Dana Ron
Avi Wigderson
Laliv Tauber
Guy N. Rothblum
Marshall Ball

Goldreich has been published several times in prominent venues such as:

Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
TheoretiCS
Computational Complexity
Theoretical Computer Science
Small Science

They have also contributed a book titled Computational Complexity and Property Testing, published in 2020 by Springer Science+Business Media.

Best Publications

How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority

Oded Goldreich;Silvio Micali;Avi Wigderson

8520
Citations
How to play ANY mental game

O. Goldreich;S. Micali;A. Wigderson

5011
Citations
Foundations of Cryptography

Oded Goldreich

3163
Citations
Private information retrieval

B. Chor;O. Goldreich;E. Kushilevitz;M. Sudan

2964
Citations
How to construct random functions

Oded Goldreich;Shafi Goldwasser;Silvio Micali

2847
Citations
Private information retrieval

Benny Chor;Eyal Kushilevitz;Oded Goldreich;Madhu Sudan

2521
Citations
The random oracle methodology, revisited

Ran Canetti;Oded Goldreich;Shai Halevi

2184
Citations
A randomized protocol for signing contracts

Shimon Even;Oded Goldreich;Abraham Lempel

2129
Citations
Software protection and simulation on oblivious RAMs

Oded Goldreich;Rafail Ostrovsky

2083
Citations
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Oded Goldreich;Silvio Micali;Avi Wigderson

2062
Citations
On the (im)possibility of obfuscating programs

Boaz Barak;Oded Goldreich;Russell Impagliazzo;Steven Rudich

1838
Citations
Foundations of Cryptography: Basic Tools

Oded Goldreich

1687
Citations
A hard-core predicate for all one-way functions

O. Goldreich;L. A. Levin

1566
Citations
Property testing and its connection to learning and approximation

Oded Goldreich;Shari Goldwasser;Dana Ron

1451
Citations
Public-key cryptosystems from lattice reduction problems

O. Goldreich;S. Goldwasser;S. Halevi

1443
Citations
The random oracle methodology, revisited (preliminary version)

Ran Canetti;Oded Goldreich;Shai Halevi

1027
Citations
Unbiased bits from sources of weak randomness and probabilistic communication complexity

Benny Chor;Oded Goldreich

903
Citations
Computational Complexity: A Conceptual Perspective

Oded Goldreich

841
Citations
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

Mihir Bellare;Oded Goldreich;Madhu Sudan

821
Citations
Simple Constructions of Almost k-wise Independent Random Variables

Noga Alon;Oded Goldreich;Johan Håstad;René Peralta

810
Citations

Frequent Co-Authors

Shafi Goldwasser University of California, Berkeley

Dana Ron Tel Aviv University

Avi Wigderson Institute for Advanced Study

Madhu Sudan Harvard University

Salil P. Vadhan Harvard University

Silvio Micali MIT

Shai Halevi Amazon (United States)

Benny Chor Tel Aviv University

Mihir Bellare University of California, San Diego

Shimon Even Technion – Israel Institute of Technology

External Links

Wikipedia of Oded Goldreich Personal website of Oded Goldreich Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

As you consider studying Computer Science in the USA, it's important to explore related online degrees and alternative career pathways. Many students are now looking for flexible, career-oriented programs that can be completed remotely while balancing other commitments.

For those interested in high-demand tech fields, an online data science degree provides valuable skills in analytics and big data, opening doors across various industries. Similarly, if you’re drawn toward building and project management, pursuing an online degree for construction management can help you enter a rapidly growing sector with diverse opportunities.

On the business side, earning a cheap mba online can strengthen your leadership and strategic management skills, which are useful in both technology and non-tech roles. If you’re interested in obtaining a credential quickly, a 1 year masters degree online offers a fast-tracked route to advanced knowledge with minimal time investment.

Exploring these accredited online degrees can help you customize your study journey and build a strong foundation for your career, whether in computer science or closely related fields.