Iftach Haitner

Most-cited papers

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
2007IEEE Annual Symposium on Foundations of Computer Science232 citations
Semantic Scholar
Bounded Key-Dependent Message Security
B. Barak, Iftach Haitner, D. Hofheinz, Y. Ishai
2010IACR Cryptology ePrint Archive130 citations
Semantic Scholar
On the (Im)Possibility of Key Dependent Encryption
Iftach Haitner, Thomas Holenstein
2009Theory of Cryptography Conference110 citations Open access
Semantic Scholar
Efficiency improvements in constructing pseudorandom generators from one-way functions
Iftach Haitner, Omer Reingold, Salil P. Vadhan
2010Symposium on the Theory of Computing102 citations Open access
Semantic Scholar
Statistically-hiding commitment from any one-way function
Iftach Haitner, Omer Reingold
2007Symposium on the Theory of Computing97 citations
Semantic Scholar
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold +1 more
2009SIAM journal on computing (Print)92 citations Open access
Semantic Scholar
Semi-honest to Malicious Oblivious Transfer - The Black-Box Way
Iftach Haitner
2008Theory of Cryptography Conference73 citations
Semantic Scholar
On the Power of the Randomized Iterate
Iftach Haitner, Danny Harnik, Omer Reingold
2006SIAM journal on computing (Print)69 citations
Semantic Scholar
Reducing Complexity Assumptions for Statistically-Hiding Commitment
Iftach Haitner, Omer Horvitz, Jonathan Katz, C. Koo +2 more
2005Journal of Cryptology58 citations Open access
Semantic Scholar
Inaccessible entropy
Iftach Haitner, Omer Reingold, Salil P. Vadhan, H. Wee
2009Symposium on the Theory of Computing56 citations
Semantic Scholar
A Parallel Repetition Theorem for Any Interactive Argument
Iftach Haitner
20092009 50th Annual IEEE Symposium on Foundations of Computer Science49 citations
Semantic Scholar
Black-Box Constructions of Protocols for Secure Computation
Iftach Haitner, Y. Ishai, E. Kushilevitz, Yehuda Lindell +1 more
2011IACR Cryptology ePrint Archive45 citations Open access
Semantic Scholar
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations
Iftach Haitner
2004Theory of Cryptography Conference41 citations
Semantic Scholar
Universal One-Way Hash Functions via Inaccessible Entropy
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan +1 more
2010International Conference on the Theory and Application of Cryptographic Techniques36 citations Open access
Semantic Scholar
Limits on the Usefulness of Random Oracles
Iftach Haitner, Eran Omri, Hila Zarosim
2013Journal of Cryptology34 citations Open access
Semantic Scholar
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2015SIAM journal on computing (Print)33 citations Open access
Semantic Scholar
An almost-optimally fair three-party coin-flipping protocol
Iftach Haitner, Eliad Tsfadia
2014SIAM journal on computing (Print)33 citations Open access
Semantic Scholar
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
Iftach Haitner, Alon Rosen, Ronen Shaltiel
2009Theory of Cryptography Conference31 citations Open access
Semantic Scholar
On the Instantiability of Hash-and-Sign RSA Signatures
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
2012Theory of Cryptography Conference29 citations Open access
Semantic Scholar
Coin Flipping with Constant Bias Implies One-Way Functions
Iftach Haitner, Eran Omri
2011IEEE Annual Symposium on Foundations of Computer Science28 citations
Semantic Scholar
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
Iftach Haitner, Danny Harnik, Omer Reingold
2006International Colloquium on Automata, Languages and Programming28 citations
Semantic Scholar
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
Iftach Haitner, Mohammad Mahmoody, David Xiao
20102010 IEEE 25th Annual Conference on Computational Complexity27 citations
Semantic Scholar
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2018IEEE Annual Symposium on Foundations of Computer Science25 citations
Semantic Scholar
Fair Coin Flipping: Tighter Analysis and the Many-Party Case
Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2017ACM-SIAM Symposium on Discrete Algorithms25 citations Open access
Semantic Scholar
On the Round Complexity of Randomized Byzantine Agreement
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland +1 more
2019Journal of Cryptology23 citations Open access
Semantic Scholar
Characterization of Secure Multiparty Computation Without Broadcast
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2016Journal of Cryptology22 citations Open access
Semantic Scholar
From Non-adaptive to Adaptive Pseudorandom Functions
Itay Berman, Iftach Haitner
2012Journal of Cryptology21 citations Open access
Semantic Scholar
Coin flipping of any constant bias implies one-way functions
Itay Berman, Iftach Haitner, Aris Tentes
2014Symposium on the Theory of Computing20 citations
Semantic Scholar
Parallel Hashing via List Recoverability
Iftach Haitner, Y. Ishai, Eran Omri, Ronen Shaltiel
2015Annual International Cryptology Conference19 citations Open access
Semantic Scholar
On the Round Complexity of the Shuffle Model
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
2020IACR Cryptology ePrint Archive18 citations
Semantic Scholar
Hardness-Preserving Reductions via Cuckoo Hashing
Itay Berman, Iftach Haitner, Ilan Komargodski, M. Naor
2013Journal of Cryptology18 citations Open access
Semantic Scholar
On the Complexity of Fair Coin Flipping
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2018Electron. Colloquium Comput. Complex.16 citations Open access
Semantic Scholar
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip
Iftach Haitner, Yonatan Karidi-Heller
2020IEEE Annual Symposium on Foundations of Computer Science15 citations Open access
Semantic Scholar
Distributional Collision Resistance Beyond One-Way Functions
Nir Bitansky, Iftach Haitner, Ilan Komargodski, E. Yogev
2019IACR Cryptology ePrint Archive15 citations
Semantic Scholar
From Fairness to Full Security in Multiparty Computation
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2018Journal of Cryptology15 citations Open access
Semantic Scholar
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
Iftach Haitner, Jonathan J. Hoch, Gil Segev
2008Theory of Cryptography Conference15 citations
Semantic Scholar
A New Interactive Hashing Theorem
Iftach Haitner, Omer Reingold
2007Journal of Cryptology15 citations Open access
Semantic Scholar
Exponent-VRFs and Their Applications
Dan Boneh, Iftach Haitner, Yehuda Lindell, Gil Segev
2024IACR Cryptology ePrint Archive14 citations
Semantic Scholar
On the complexity of two-party differential privacy
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
2021Electron. Colloquium Comput. Complex.14 citations
Semantic Scholar
Highly Efficient OT-Based Multiplication Protocols
Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia
2021IACR Cryptology ePrint Archive12 citations
Semantic Scholar
Lower Bounds on the Time/Memory Tradeoff of Function Inversion
Dror Chawin, Iftach Haitner, Noam Mazor
2021Electron. Colloquium Comput. Complex.11 citations Open access
Semantic Scholar
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
2019IACR Cryptology ePrint Archive11 citations Open access
Semantic Scholar
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel +1 more
2018IEEE Annual Symposium on Foundations of Computer Science11 citations Open access
Semantic Scholar
On the Communication Complexity of Key-Agreement Protocols
Iftach Haitner, Noam Mazor, R. Oshman, Omer Reingold +1 more
2021Electron. Colloquium Comput. Complex.10 citations
Semantic Scholar
Incompressiblity and Next-Block Pseudoentropy
Iftach Haitner, Noam Mazor, Jad Silbak
2022Electron. Colloquium Comput. Complex.6 citations
Semantic Scholar
The Many Entropies in One-Way Functions
Iftach Haitner, Salil P. Vadhan
2017Tutorials on the Foundations of Cryptography6 citations
Semantic Scholar
On the (In)Security of RSA Signatures
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
2011IACR Cryptology ePrint Archive6 citations
Semantic Scholar
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions
Iftach Haitner, Omer Reingold, Salil P. Vadhan, H. Wee
2020arXiv.org5 citations
Semantic Scholar
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence
Itay Berman, Iftach Haitner, Eliad Tsfadia
2020Annual International Cryptology Conference4 citations Open access
Semantic Scholar
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments
Itay Berman, Iftach Haitner, Eliad Tsfadia
2019IACR Cryptology ePrint Archive4 citations
Semantic Scholar