Oded Goldreich
Impact in
- Computational Theory and Mathematics top 0.01%
- Complexity and Algorithms in Graphs
- Artificial Intelligence top 0.02%
- Cryptography and Data Security
- Privacy-Preserving Technologies in Data
- Cryptographic Implementations and Security
- Machine Learning and Algorithms
- Internet Traffic Analysis and Secure E-voting
- Coding theory and cryptography
Papers in
-
- Complexity and Algorithms in Graphs 109
- Computability, Logic, AI Algorithms 44
- Advanced Graph Theory Research 21
-
- Cryptography and Data Security 93
- Machine Learning and Algorithms 43
- Cryptographic Implementations and Security 24
- Algorithms and Data Compression 24
- Co-authors
- Silvio MicaliAvi WigdersonBenny ChorMadhu SudanRafail OstrovskyRan CanettiEyal KushilevitzShafi Goldwasser
- Journals
- SIAM Journal on Computing (12 papers)Journal of Cryptology (11 papers)Random Structures and Algorithms (10 papers)Journal of the ACM (10 papers)Computational Complexity (9 papers)
- Partner nations
- IsraelUnited StatesGermany
In The Last Decade
Oded Goldreich
230 papers receiving 13.9k citations
Hit Papers
Peers
Comparison fields: 5 of 132
- Computational Theory and Mathematics 6.5k
- Artificial Intelligence 12.6k
- Computer Networks and Communications 3.9k
- Information Systems 2.8k
- Discrete Mathematics and Combinatorics 340
Countries citing papers authored by Oded Goldreich
This map shows the geographic impact of Oded Goldreich's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Oded Goldreich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Oded Goldreich more than expected).
Fields of papers citing papers by Oded Goldreich
This network shows the impact of papers produced by Oded Goldreich. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Oded Goldreich. The network helps show where Oded Goldreich may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Oded Goldreich, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Constructing Large Families of Pairwise Far Permutations: Good Permutation Codes Based on the Shuffle-Exchange Network. | 2020 | 1 |
| 2 | Universal Locally Testable Codes. | 2016 | 1 |
| 3 | On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions. | 2013 | 1 |
| 4 | Two-Sided Error Proximity Oblivious Testing - (Extended Abstract). | 2012 | 4 |
| 5 | Two Comments on Targeted Canonical Derandomizers. | 2011 | 6 |
| 6 | In a World of P=BPP. | 2010 | 1 |
| 7 | P, NP, and NP-Completeness: The Basics of Complexity Theory. | 2010 | 3 |
| 8 | On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge. | 2006 | 4 |
| 9 | Bounds on 2-Query Codeword Testing. | 2003 | 3 |
| 10 | Zero-Knowledge twenty years after its invention | 2002 | 31 |
| 11 | On Pseudorandomness with respect to Deterministic Observers. | 2000 | 5 |
| 12 | Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors. | 1999 | 1 |
| 13 | Property Testing and its connection to Learning and Approximation | 1996 | 3 |
| 14 | On the Message Complexity of Interactive Proof Systems | 1996 | 1 |
| 15 | A Combinatorial Consistency Lemma with application to the PCP Theorem | 1996 | 1 |
| 16 | Public-Key Cryptosystems from Lattice Reduction Problems | 1996 | 18 |
| 17 | Collision-Free Hashing from Lattice Problems | 1996 | 30 |
| 18 | Free Bits, PCP and Non-Approximability - Towards Tight Results | 1995 | 14 |
| 19 | On-Line/Off-Line Digital Schemes | 1989 | 14 |
| 20 | On concurrent identification protocols | 1985 | 1 |
About Oded Goldreich
Oded Goldreich is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design, having authored 241 papers that have together received 15.4k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (109 papers), Cryptography and Data Security (93 papers), Computability, Logic, AI Algorithms (44 papers), Machine Learning and Algorithms (43 papers), Cryptographic Implementations and Security (24 papers), Algorithms and Data Compression (24 papers), Chaos-based Image/Signal Encryption (21 papers) and Advanced Graph Theory Research (21 papers). The work is most often cited by research in Computational Theory and Mathematics (6.5k citations), Artificial Intelligence (12.6k citations), Computer Networks and Communications (3.9k citations), Information Systems (2.8k citations) and Discrete Mathematics and Combinatorics (340 citations). Oded Goldreich has collaborated with scholars based in Israel, United States and Germany. Frequent co-authors include Silvio Micali, Avi Wigderson, Benny Chor, Madhu Sudan, Rafail Ostrovsky, Ran Canetti, Eyal Kushilevitz, Shafi Goldwasser, Dana Ron and Shai Halevi. Their work appears in journals such as SIAM Journal on Computing, Journal of Cryptology, Random Structures and Algorithms, Journal of the ACM and Computational Complexity.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.