Iftach Haitner

According to our database, Iftach Haitner authored at least 67 papers between 2004 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Mildly Accurate Computationally Differentially Private Inner Product Protocols Imply Oblivious Transfer.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan

CoRR, February, 2025

Tight Bounds on Uniform-Challenge Black-Box Reductions from Sigma Protocols.

Iftach Haitner, Nikolaos Makriyannis

IACR Cryptol. ePrint Arch., 2025

Integer Commitments, Old and New Tools.

Iftach Haitner, Yehuda Lindell, Nikolaos Makriyannis

IACR Cryptol. ePrint Arch., 2025

Tighter Concrete Security for the Simplest OT.

Iftach Haitner, Gil Segev

IACR Commun. Cryptol., 2025

Exponent-VRFs and Their Applications.

Dan Boneh, Iftach Haitner, Yehuda Lindell, Gil Segev

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

From OT to OLE with Subquadratic Communication.

Jack Doerner, Iftach Haitner, Yuval Ishai, Nikolaos Makriyannis

Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

2024

Exponent-VRFs and Their Applications.

Dan Boneh, Iftach Haitner, Yehuda Lindell

IACR Cryptol. ePrint Arch., 2024

2023

Incompressiblity and Next-Block Pseudoentropy.

Iftach Haitner, Noam Mazor, Jad Silbak

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.

Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri

SIAM J. Comput., 2022

On the complexity of two-party differential privacy.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Highly Efficient OT-Based Multiplication Protocols.

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Lower Bound on SNARGs in the Random Oracle Model.

Iftach Haitner, Daniel Nukrai, Eylon Yogev

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Coin Flipping of \emph{Any} Constant Bias Implies One-Way Functions.

Itay Berman, Iftach Haitner, Aris Tentes

CoRR, 2021

2020

Inaccessible Entropy II: IE Functions and Universal One-Way Hashing.

Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee

Theory Comput., 2020

Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions.

Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee

CoRR, 2020

Lower Bounds on the Time/Memory Tradeoff of Function Inversion.

Dror Chawin, Iftach Haitner, Noam Mazor

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

On the Round Complexity of the Shuffle Model.

Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip.

Iftach Haitner, Yonatan Karidi-Heller

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence.

Itay Berman, Iftach Haitner, Eliad Tsfadia

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments.

Itay Berman, Iftach Haitner, Eliad Tsfadia

Electron. Colloquium Comput. Complex., 2019

On the Round Complexity of Randomized Byzantine Agreement.

Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.

Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

On the Communication Complexity of Key-Agreement Protocols.

Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Distributional Collision Resistance Beyond One-Way Functions.

Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018

Computational Two-Party Correlation.

Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2018

On the Complexity of Fair Coin Flipping.

Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

From Fairness to Full Security in Multiparty Computation.

Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem

Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.

Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.

Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

The Many Entropies in One-Way Functions.

Iftach Haitner, Salil P. Vadhan

Electron. Colloquium Comput. Complex., 2017

Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.

Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Electron. Colloquium Comput. Complex., 2017

Fair Coin Flipping: Tighter Analysis and the Many-Party Case.

Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

The Many Entropies in One-Way Functions.

Iftach Haitner, Salil P. Vadhan

Proceedings of the Tutorials on the Foundations of Cryptography., 2017

2016

Characterization of Secure Multiparty Computation Without Broadcast.

Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

2015

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

SIAM J. Comput., 2015

Coin Flipping of Any Constant Bias Implies One-Way Functions.

Itay Berman, Iftach Haitner, Aris Tentes

Electron. Colloquium Comput. Complex., 2015

Parallel Hashing via List Recoverability.

Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

An almost-optimally fair three-party coin-flipping protocol.

Iftach Haitner, Eliad Tsfadia

Proceedings of the Symposium on Theory of Computing, 2014

Coin flipping of <i>any</i> constant bias implies one-way functions.

Itay Berman, Iftach Haitner, Aris Tentes

Proceedings of the Symposium on Theory of Computing, 2014

2013

Limits on the Usefulness of Random Oracles.

Iftach Haitner, Eran Omri, Hila Zarosim

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Hardness Preserving Reductions via Cuckoo Hashing.

Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

2012

On the Power of Random Oracles.

Iftach Haitner, Eran Omri, Hila Zarosim

Electron. Colloquium Comput. Complex., 2012

On the Instantiability of Hash-and-Sign RSA Signatures.

Yevgeniy Dodis, Iftach Haitner, Aris Tentes

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

From Non-adaptive to Adaptive Pseudorandom Functions.

Itay Berman, Iftach Haitner

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

2011

Black-Box Constructions of Protocols for Secure Computation.

Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank

SIAM J. Comput., 2011

On the (In)Security of RSA Signatures.

Yevgeniy Dodis, Iftach Haitner, Aris Tentes

IACR Cryptol. ePrint Arch., 2011

Coin Flipping with Constant Bias Implies One-Way Functions.

Iftach Haitner, Eran Omri

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Efficiency improvements in constructing pseudorandom generators from one-way functions.

Iftach Haitner, Omer Reingold, Salil P. Vadhan

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Universal One-Way Hash Functions via Inaccessible Entropy.

Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Bounded Key-Dependent Message Security.

Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.

Iftach Haitner, Mohammad Mahmoody, David Xiao

Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010

2009

Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function.

Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan

SIAM J. Comput., 2009

On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.

Iftach Haitner, Alon Rosen, Ronen Shaltiel

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

On the (Im)Possibility of Key Dependent Encryption.

Iftach Haitner, Thomas Holenstein

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Inaccessible entropy.

Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

A Parallel Repetition Theorem for Any Interactive Argument.

Iftach Haitner

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.

Iftach Haitner, Jonathan J. Hoch, Gil Segev

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Semi-honest to Malicious Oblivious Transfer - The Black-Box Way.

Iftach Haitner

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

2007

Statistically-hiding commitment from any one-way function.

Iftach Haitner, Omer Reingold

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

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

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

A New Interactive Hashing Theorem.

Iftach Haitner, Omer Reingold

Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

2006

Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions.

Iftach Haitner, Danny Harnik, Omer Reingold

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

On the Power of the Randomized Iterate.

Iftach Haitner, Danny Harnik, Omer Reingold

Proceedings of the Advances in Cryptology, 2006

2005

Reducing Complexity Assumptions for Statistically-Hiding Commitment.

Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel

Proceedings of the Advances in Cryptology, 2005

2004

Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions

Iftach Haitner, Ronen Shaltiel

Electron. Colloquium Comput. Complex., 2004

Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations.

Iftach Haitner

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004