Omer Paneth

2.1k total citations
13 papers, 154 citations indexed

About

Omer Paneth is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Omer Paneth has authored 13 papers receiving a total of 154 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Artificial Intelligence, 9 papers in Computational Theory and Mathematics and 3 papers in Computer Vision and Pattern Recognition. Recurrent topics in Omer Paneth's work include Cryptography and Data Security (12 papers), Complexity and Algorithms in Graphs (9 papers) and Cryptographic Implementations and Security (5 papers). Omer Paneth is often cited by papers focused on Cryptography and Data Security (12 papers), Complexity and Algorithms in Graphs (9 papers) and Cryptographic Implementations and Security (5 papers). Omer Paneth collaborates with scholars based in United States, Israel and Switzerland. Omer Paneth's co-authors include Nir Bitansky, Alon Rosen, Ran Canetti, Leonid Reyzin, Benjamin Fuller, Yael Tauman Kalai, Adam Smith, Shafi Goldwasser, Brent Waters and Vinod Vaikuntanathan and has published in prestigious journals such as SIAM Journal on Computing, Algorithmica and Journal of Cryptology.

In The Last Decade

Omer Paneth

12 papers receiving 141 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Omer Paneth United States 7 116 58 46 32 19 13 154
Samee Zahur United States 4 240 2.1× 69 1.2× 46 1.0× 38 1.2× 9 0.5× 4 262
Nikos Gorogiannis United Kingdom 8 177 1.5× 27 0.5× 53 1.2× 43 1.3× 16 0.8× 21 229
Benjamin Mood United States 7 237 2.0× 104 1.8× 53 1.2× 69 2.2× 40 2.1× 8 274
Wilko Henecka Australia 5 208 1.8× 59 1.0× 50 1.1× 28 0.9× 20 1.1× 7 225
Mehdi Tibouchi Japan 8 168 1.4× 74 1.3× 27 0.6× 16 0.5× 13 0.7× 37 191
Pierre-Louis Cayrel France 6 114 1.0× 64 1.1× 20 0.4× 55 1.7× 9 0.5× 25 151
Gudmund Grov United Kingdom 6 77 0.7× 55 0.9× 40 0.9× 36 1.1× 12 0.6× 30 143
Lydie du Bousquet France 8 46 0.4× 72 1.2× 54 1.2× 28 0.9× 9 0.5× 32 190
Markus Jakobsson United States 6 63 0.5× 45 0.8× 26 0.6× 29 0.9× 36 1.9× 9 125
Jakob Pagter Denmark 6 102 0.9× 37 0.6× 40 0.9× 25 0.8× 9 0.5× 9 134

Countries citing papers authored by Omer Paneth

Since Specialization
Citations

This map shows the geographic impact of Omer Paneth'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 Omer Paneth with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Omer Paneth more than expected).

Fields of papers citing papers by Omer Paneth

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Omer Paneth. 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 Omer Paneth. The network helps show where Omer Paneth may publish in the future.

Co-authorship network of co-authors of Omer Paneth

This figure shows the co-authorship network connecting the top 25 collaborators of Omer Paneth. A scholar is included among the top collaborators of Omer Paneth based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Omer Paneth. Omer Paneth is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

13 of 13 papers shown
1.
Bitansky, Nir, et al.. (2024). Batch Proofs Are Statistically Hiding. 435–443. 1 indexed citations
2.
Paneth, Omer & Rafael Pass. (2022). Incrementally Verifiable Computation via Rate-1 Batch Arguments. 1045–1056. 3 indexed citations
3.
Bitansky, Nir, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, & Omer Paneth. (2022). Succinct Non-Interactive Arguments via Linear Interactive Proofs. Journal of Cryptology. 35(3). 6 indexed citations
4.
Canetti, Ran, Benjamin Fuller, Omer Paneth, Leonid Reyzin, & Adam Smith. (2020). Reusable Fuzzy Extractors for Low-Entropy Distributions. Journal of Cryptology. 34(1). 30 indexed citations
5.
Kalai, Yael Tauman, et al.. (2019). How to delegate computations publicly. 1115–1124. 15 indexed citations
6.
Bitansky, Nir, Ran Canetti, Omer Paneth, & Alon Rosen. (2016). On the Existence of Extractable One-Way Functions. SIAM Journal on Computing. 45(5). 1910–1952. 2 indexed citations
7.
Bitansky, Nir, Ran Canetti, Yael Tauman Kalai, & Omer Paneth. (2016). On Virtual Grey Box Obfuscation for General Circuits. Algorithmica. 79(4). 1014–1051. 3 indexed citations
8.
Bitansky, Nir, Shafi Goldwasser, Abhishek Jain, et al.. (2016). Time-Lock Puzzles from Randomized Encodings. DSpace@MIT (Massachusetts Institute of Technology). 345–356. 27 indexed citations
9.
Bitansky, Nir, Omer Paneth, & Alon Rosen. (2015). On the Cryptographic Hardness of Finding a Nash Equilibrium. 1480–1498. 22 indexed citations
10.
Bitansky, Nir & Omer Paneth. (2015). On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. SIAM Journal on Computing. 44(5). 1325–1383. 3 indexed citations
11.
Bitansky, Nir, Ran Canetti, Omer Paneth, & Alon Rosen. (2014). On the existence of extractable one-way functions. 505–514. 19 indexed citations
12.
Bitansky, Nir & Omer Paneth. (2013). On the impossibility of approximate obfuscation and applications to resettable cryptography. 241–250. 13 indexed citations
13.
Bitansky, Nir & Omer Paneth. (2012). From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique. 223–232. 10 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026