Iftach Haitner

1.6k total citations
34 papers, 169 citations indexed

About

Iftach Haitner is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Iftach Haitner has authored 34 papers receiving a total of 169 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Artificial Intelligence, 14 papers in Computational Theory and Mathematics and 7 papers in Computer Networks and Communications. Recurrent topics in Iftach Haitner's work include Cryptography and Data Security (32 papers), Complexity and Algorithms in Graphs (11 papers) and Privacy-Preserving Technologies in Data (9 papers). Iftach Haitner is often cited by papers focused on Cryptography and Data Security (32 papers), Complexity and Algorithms in Graphs (11 papers) and Privacy-Preserving Technologies in Data (9 papers). Iftach Haitner collaborates with scholars based in Israel, United States and France. Iftach Haitner's co-authors include Omer Reingold, Salil Vadhan, Eran Omri, Jonathan J. Hoch, Gil Segev, Shien Jin Ong, Ronen Shaltiel, Mohammad Mahmoody, David Xiao and Hoeteck Wee and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Iftach Haitner

26 papers receiving 158 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Iftach Haitner Israel 7 149 73 35 25 14 34 169
Gillat Kol Israel 7 113 0.8× 104 1.4× 63 1.8× 25 1.0× 8 0.6× 30 166
Emmanuela Orsini Italy 5 219 1.5× 73 1.0× 38 1.1× 53 2.1× 4 0.3× 10 226
Jakob Pagter Denmark 6 102 0.7× 40 0.5× 25 0.7× 37 1.5× 10 0.7× 9 134
Eylon Yogev Israel 8 102 0.7× 47 0.6× 31 0.9× 21 0.8× 26 1.9× 23 139
Robert Brummayer Austria 5 70 0.5× 80 1.1× 23 0.7× 37 1.5× 4 0.3× 7 140
Chris Monico United States 5 142 1.0× 84 1.2× 38 1.1× 14 0.6× 28 2.0× 21 201
Phillipp Schoppmann United States 5 171 1.1× 19 0.3× 16 0.5× 30 1.2× 11 0.8× 11 189
Sivakanth Gopi United States 9 138 0.9× 47 0.6× 102 2.9× 10 0.4× 11 0.8× 26 189
Sibylle Schupp Germany 7 109 0.7× 29 0.4× 34 1.0× 75 3.0× 10 0.7× 53 169
Shuguo Han Singapore 8 157 1.1× 26 0.4× 16 0.5× 41 1.6× 10 0.7× 9 179

Countries citing papers authored by Iftach Haitner

Since Specialization
Citations

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

Fields of papers citing papers by Iftach Haitner

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Iftach Haitner

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

All Works

20 of 20 papers shown
1.
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.
2.
Haitner, Iftach, et al.. (2022). On the complexity of fair coin flipping. Theoretical Computer Science. 914. 23–38.
3.
Haitner, Iftach, et al.. (2019). On the Communication Complexity of Key-Agreement Protocols. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 25. 16.
4.
Haitner, Iftach, et al.. (2018). Computational Two-Party Correlation.. 25. 71. 2 indexed citations
5.
6.
Buchbinder, Niv, et al.. (2017). Fair coin flipping: tighter analysis and the many-party case. arXiv (Cornell University). 2580–2600. 1 indexed citations
7.
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
8.
Haitner, Iftach, et al.. (2014). Limits on the Usefulness of Random Oracles. Journal of Cryptology. 29(2). 283–335. 4 indexed citations
9.
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
10.
Haitner, Iftach, et al.. (2014). Coin flipping of any constant bias implies one-way functions. 398–407. 3 indexed citations
11.
Haitner, Iftach. (2013). A Parallel Repetition Theorem for Any Interactive Argument. SIAM Journal on Computing. 42(6). 2487–2501.
12.
Haitner, Iftach, Omer Reingold, & Salil Vadhan. (2013). Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions. SIAM Journal on Computing. 42(3). 1405–1430. 8 indexed citations
13.
Haitner, Iftach, et al.. (2012). On the Power of Random Oracles.. IACR Cryptology ePrint Archive. 19. 129. 1 indexed citations
14.
Haitner, Iftach & Eran Omri. (2011). Coin Flipping with Constant Bias Implies One-Way Functions. 110–119. 4 indexed citations
15.
Haitner, Iftach, Mohammad Mahmoody, & David Xiao. (2010). A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.. Electronic colloquium on computational complexity. 17. 1. 1 indexed citations
16.
Haitner, Iftach, Omer Reingold, & Salil Vadhan. (2010). Efficiency improvements in constructing pseudorandom generators from one-way functions. 437–446. 19 indexed citations
17.
Haitner, Iftach, Jonathan J. Hoch, Omer Reingold, & Gil Segev. (2007). Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. 669–679. 22 indexed citations
18.
19.
Haitner, Iftach & Omer Reingold. (2007). A New Interactive Hashing Theorem. Journal of Cryptology. 16(1). 109–138. 1 indexed citations
20.
Haitner, Iftach, Danny Harnik, & Omer Reingold. (2006). Efficient pseudorandom generators from exponentially hard one-way functions. 2 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

Breakdown of academic impact, for papers by Gillat Kol Breakdown of academic impact, for papers by Emmanuela Orsini Breakdown of academic impact, for papers by Jakob Pagter Breakdown of academic impact, for papers by Eylon Yogev Breakdown of academic impact, for papers by Robert Brummayer Breakdown of academic impact, for papers by Chris Monico Breakdown of academic impact, for papers by Phillipp Schoppmann Breakdown of academic impact, for papers by Sivakanth Gopi Breakdown of academic impact, for papers by Sibylle Schupp Breakdown of academic impact, for papers by Shuguo Han
Rankless by CCL
2026