Omer Paneth
Impact in
- Artificial Intelligence top 10%
- Cryptography and Data Security
- Cryptographic Implementations and Security
- Privacy-Preserving Technologies in Data
- Internet Traffic Analysis and Secure E-voting
-
- Complexity and Algorithms in Graphs
Papers in
-
- Complexity and Algorithms in Graphs 9
-
- Cryptography and Data Security 12
- Cryptographic Implementations and Security 5
- Adversarial Robustness in Machine Learning 2
- Privacy-Preserving Technologies in Data 2
- Internet Traffic Analysis and Secure E-voting 1
- Co-authors
- Nir BitanskyAlon RosenRan CanettiLeonid ReyzinBenjamin FullerYael Tauman KalaiAdam SmithShafi Goldwasser
- Journals
- SIAM Journal on Computing (2 papers)Journal of Cryptology (2 papers)Algorithmica (1 paper)DSpace@MIT (Massachusetts Institute of Technology) (1 paper)
- Partner nations
- United StatesIsraelSwitzerland
In The Last Decade
Omer Paneth
12 papers receiving 141 citations
Peers
Comparison fields: 5 of 21
- Artificial Intelligence 116
- Computational Theory and Mathematics 46
- Information Systems 58
- Hardware and Architecture 17
- Signal Processing 19
Countries citing papers authored by Omer Paneth
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
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
The 17 scholars most cited alongside Omer Paneth, 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 | 2024 | 1 | |
| 2 | 2022 | 3 | |
| 3 | 2022 | 6 | |
| 4 | 2020 | 30 | |
| 5 | 2019 | 15 | |
| 6 | 2016 | 2 | |
| 7 | 2016 | 3 | |
| 8 | 2016 | 27 | |
| 9 | 2015 | 22 | |
| 10 | 2015 | 3 | |
| 11 | 2014 | 19 | |
| 12 | 2013 | 13 | |
| 13 | 2012 | 10 |
About Omer Paneth
Omer Paneth is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Hardware and Architecture, Computer Vision and Pattern Recognition and Management Science and Operations Research, having authored 13 papers that have together received 154 indexed citations. Recurring topics across this work include Cryptography and Data Security (12 papers), Complexity and Algorithms in Graphs (9 papers), Cryptographic Implementations and Security (5 papers), Chaos-based Image/Signal Encryption (3 papers), Adversarial Robustness in Machine Learning (2 papers), Privacy-Preserving Technologies in Data (2 papers), Access Control and Trust (1 paper) and Internet Traffic Analysis and Secure E-voting (1 paper). The work is most often cited by research in Artificial Intelligence (116 citations), Computational Theory and Mathematics (46 citations), Information Systems (58 citations), Hardware and Architecture (17 citations) and Signal Processing (19 citations). Omer Paneth has collaborated with scholars based in United States, Israel and Switzerland. Frequent 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. Their work appears in journals such as SIAM Journal on Computing, Journal of Cryptology, Algorithmica and DSpace@MIT (Massachusetts Institute of Technology).
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.