Eran Omri

903 total citations
20 papers, 96 citations indexed

About

Eran Omri is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, Eran Omri has authored 20 papers receiving a total of 96 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Artificial Intelligence, 8 papers in Computational Theory and Mathematics and 3 papers in Information Systems. Recurrent topics in Eran Omri's work include Cryptography and Data Security (15 papers), Privacy-Preserving Technologies in Data (8 papers) and Complexity and Algorithms in Graphs (6 papers). Eran Omri is often cited by papers focused on Cryptography and Data Security (15 papers), Privacy-Preserving Technologies in Data (8 papers) and Complexity and Algorithms in Graphs (6 papers). Eran Omri collaborates with scholars based in Israel, United States and Belgium. Eran Omri's co-authors include Yehuda Lindell, Iftach Haitner, Amos Beimel, Anat Paskin-Cherniavsky, Andreas Weiermann, Boaz Ben‐Moshe, Michael Elkin, Lee-Ad Gottlieb, Kobbi Nissim and Ronen Shaltiel and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Combinatorial Theory Series A.

In The Last Decade

Eran Omri

17 papers receiving 94 citations

Peers

Eran Omri

AI

CTM

IS

CNC

GT

Élie de Panafieu France

Jens Zumbrägel Germany

Nathan Chenette United States

Pascal Giorgi France

Jesse Alama Portugal

Ludovic Perret France

Wilmer Ricciotti Italy

Daniel R. L. Brown Canada

Friedrich Slivovsky Austria

Shi Bai United States

Élie de Panafieu France

Eran Omri

107 ×1.3

AI

46 ×1.4

CTM

52 ×2.6

IS

18 ×1.6

CNC

4 ×0.5

GT

Citations per year, relative to Eran Omri Eran Omri (= 1×) peers Élie de Panafieu

Countries citing papers authored by Eran Omri

Since Specialization

Citations

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

Fields of papers citing papers by Eran Omri

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Eran Omri

This figure shows the co-authorship network connecting the top 25 collaborators of Eran Omri. A scholar is included among the top collaborators of Eran Omri 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 Eran Omri. Eran Omri is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Cohen, Ran, et al.. (2023). On the Power of an Honest Majority in Three-Party Computation Without Broadcast. Journal of Cryptology. 36(3).

2.

Beimel, Amos, et al.. (2022). Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. SIAM Journal on Computing. 51(4). 1126–1171.

3.

Haitner, Iftach, et al.. (2022). On the complexity of fair coin flipping. Theoretical Computer Science. 914. 23–38.

4.

Omri, Eran, et al.. (2022). PSImple. 1098–1112. 11 indexed citations

5.

Haitner, Iftach, et al.. (2020). Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. SIAM Journal on Computing. 49(6). 1041–1082. 1 indexed citations

6.

Haitner, Iftach, et al.. (2018). Computational Two-Party Correlation.. 25. 71. 2 indexed citations

7.

Beimel, Amos, et al.. (2018). Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. 838–849. 2 indexed citations

8.

Haitner, Iftach, et al.. (2018). Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. 136–147. 2 indexed citations

9.

Beimel, Amos, et al.. (2017). Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.. 24. 168. 2 indexed citations

10.

Lindell, Yehuda, et al.. (2017). Completeness for Symmetric Two-Party Functionalities: Revisited. Journal of Cryptology. 31(3). 671–697. 1 indexed citations

11.

Ben‐Moshe, Boaz, Michael Elkin, Lee-Ad Gottlieb, & Eran Omri. (2016). Optimizing budget allocation for center and median points. Theoretical Computer Science. 627. 13–25. 2 indexed citations

12.

Lindell, Yehuda, et al.. (2016). Optimizing Semi-Honest Secure Multiparty Computation for the Internet. 578–590. 42 indexed citations

13.

Haitner, Iftach, et al.. (2014). Limits on the Usefulness of Random Oracles. Journal of Cryptology. 29(2). 283–335. 4 indexed citations

14.

Haitner, Iftach & Eran Omri. (2014). Coin Flipping with Constant Bias Implies One-Way Functions. SIAM Journal on Computing. 43(2). 389–409. 6 indexed citations

15.

Beimel, Amos, et al.. (2013). Protocols for Multiparty Coin Toss with a Dishonest Majority. Journal of Cryptology. 28(3). 551–600. 7 indexed citations

16.

Haitner, Iftach, et al.. (2012). On the Power of Random Oracles.. IACR Cryptology ePrint Archive. 19. 129. 1 indexed citations

17.

Ben‐Moshe, Boaz, Michael Elkin, Lee-Ad Gottlieb, & Eran Omri. (2011). Optimizing Budget Allocation in Graphs. Canadian Conference on Computational Geometry. 2 indexed citations

18.

Haitner, Iftach & Eran Omri. (2011). Coin Flipping with Constant Bias Implies One-Way Functions. 110–119. 4 indexed citations

19.

Omri, Eran & Andreas Weiermann. (2008). Classifying the phase transition threshold for Ackermannian functions. Annals of Pure and Applied Logic. 158(3). 156–162. 2 indexed citations

20.

Kojman, Menachem, et al.. (2008). Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers. Journal of Combinatorial Theory Series A. 115(6). 1036–1055. 5 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