| 2026 | CRYPTO | On the Complexity of Interactive Arguments. | Idan Baril, Iftach Haitner |
| 2026 | EuroCrypt | Tight Bounds on Uniform-Challenge Reductions from Sigma Protocols. | Iftach Haitner, Nikolaos Makriyannis |
| 2025 | CCS | From OT to OLE with Subquadratic Communication. | Jack Doerner, Iftach Haitner, Yuval Ishai, Nikolaos Makriyannis |
| 2025 | CRYPTO | Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer. | Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan |
| 2025 | EuroCrypt | Exponent-VRFs and Their Applications. | Dan Boneh, Iftach Haitner, Yehuda Lindell, Gil Segev |
| 2022 | CRYPTO | Lower Bound on SNARGs in the Random Oracle Model. | Iftach Haitner, Daniel Nukrai, Eylon Yogev |
| 2022 | EuroCrypt | Highly Efficient OT-Based Multiplication Protocols. | Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia |
| 2022 | STOC | On the complexity of two-party differential privacy. | Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia |
| 2020 | CRYPTO | A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. | Itay Berman, Iftach Haitner, Eliad Tsfadia |
| 2020 | FOCS | A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip. | Iftach Haitner, Yonatan Karidi-Heller |
| 2020 | TCC | On the Round Complexity of the Shuffle Model. | Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer |
| 2020 | TCC | Lower Bounds on the Time/Memory Tradeoff of Function Inversion. | Dror Chawin, Iftach Haitner, Noam Mazor |
| 2019 | EuroCrypt | Distributional Collision Resistance Beyond One-Way Functions. | Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev |
| 2019 | TCC | Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. | Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak |
| 2018 | FOCS | Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. | Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri |
| 2018 | FOCS | Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. | Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak |
| 2018 | SCN | From Fairness to Full Security in Multiparty Computation. | Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem |
| 2018 | TCC | On the Complexity of Fair Coin Flipping. | Iftach Haitner, Nikolaos Makriyannis, Eran Omri |
| 2017 | SODA | Fair Coin Flipping: Tighter Analysis and the Many-Party Case. | Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia |
| 2016 | TCC | Characterization of Secure Multiparty Computation Without Broadcast. | Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem |
| 2015 | CRYPTO | Parallel Hashing via List Recoverability. | Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel |
| 2014 | STOC | Coin flipping of | Itay Berman, Iftach Haitner, Aris Tentes |
| 2014 | STOC | An almost-optimally fair three-party coin-flipping protocol. | Iftach Haitner, Eliad Tsfadia |
| 2013 | TCC | Hardness Preserving Reductions via Cuckoo Hashing. | Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor |
| 2013 | TCC | Limits on the Usefulness of Random Oracles. | Iftach Haitner, Eran Omri, Hila Zarosim |
| 2012 | TCC | From Non-adaptive to Adaptive Pseudorandom Functions. | Itay Berman, Iftach Haitner |
| 2012 | TCC | On the Instantiability of Hash-and-Sign RSA Signatures. | Yevgeniy Dodis, Iftach Haitner, Aris Tentes |
| 2011 | FOCS | Coin Flipping with Constant Bias Implies One-Way Functions. | Iftach Haitner, Eran Omri |
| 2010 | EuroCrypt | Bounded Key-Dependent Message Security. | Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai |
| 2010 | EuroCrypt | Universal One-Way Hash Functions via Inaccessible Entropy. | Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
| 2010 | STOC | Efficiency improvements in constructing pseudorandom generators from one-way functions. | Iftach Haitner, Omer Reingold, Salil P. Vadhan |
| 2009 | FOCS | A Parallel Repetition Theorem for Any Interactive Argument. | Iftach Haitner |
| 2009 | STOC | Inaccessible entropy. | Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
| 2009 | TCC | On the (Im)Possibility of Key Dependent Encryption. | Iftach Haitner, Thomas Holenstein |
| 2009 | TCC | On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. | Iftach Haitner, Alon Rosen, Ronen Shaltiel |
| 2008 | TCC | Semi-honest to Malicious Oblivious Transfer - The Black-Box Way. | Iftach Haitner |
| 2008 | TCC | A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. | Iftach Haitner, Jonathan J. Hoch, Gil Segev |
| 2007 | FOCS | Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. | Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev |
| 2007 | STOC | Statistically-hiding commitment from any one-way function. | Iftach Haitner, Omer Reingold |
| 2006 | CRYPTO | On the Power of the Randomized Iterate. | Iftach Haitner, Danny Harnik, Omer Reingold |
| 2006 | ICALP | Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. | Iftach Haitner, Danny Harnik, Omer Reingold |
| 2005 | EuroCrypt | Reducing Complexity Assumptions for Statistically-Hiding Commitment. | Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel |
| 2004 | TCC | Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations. | Iftach Haitner |