Iftach Haitner

According to our database, Iftach Haitner authored at least 60 papers between 2004 and 2024.

Collaborative distances:

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

2024

Exponent-VRFs and Their Applications.

Dan Boneh, Iftach Haitner, Yehuda Lindell

IACR Cryptol. ePrint Arch., 2024

2022

On the complexity of fair coin flipping.

Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Theor. Comput. Sci., 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

From Fairness to Full Security in Multiparty Computation.

Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem

J. Cryptol., 2022

On the Round Complexity of Randomized Byzantine Agreement.

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

J. Cryptol., 2022

Lower Bound on SNARGs in the Random Oracle Model.

Iftach Haitner, Daniel Nukrai, Eylon Yogev

IACR Cryptol. ePrint Arch., 2022

Incompressiblity and Next-Block Pseudoentropy.

Iftach Haitner, Noam Mazor, Jad Silbak

Electron. Colloquium Comput. Complex., 2022

2021

Highly Efficient OT-Based Multiplication Protocols.

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia

IACR Cryptol. ePrint Arch., 2021

On the Complexity of Two-Party Differential Privacy.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia

Electron. Colloquium Comput. Complex., 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

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

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

SIAM J. Comput., 2020

On the Round Complexity of the Shuffle Model.

Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer

IACR Cryptol. ePrint Arch., 2020

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

Iftach Haitner, Yonatan Karidi-Heller

Electron. Colloquium Comput. Complex., 2020

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

Dror Chawin, Iftach Haitner, Noam Mazor

Electron. Colloquium Comput. Complex., 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

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

Distributional Collision Resistance Beyond One-Way Functions.

Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev

IACR Cryptol. ePrint Arch., 2019

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

Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2019

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

Itay Berman, Iftach Haitner, Eliad Tsfadia

Electron. Colloquium Comput. Complex., 2019

2018

Characterization of Secure Multiparty Computation Without Broadcast.

Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem

J. Cryptol., 2018

Coin Flipping of <i>Any</i> Constant Bias Implies One-Way Functions.

Itay Berman, Iftach Haitner, Aris Tentes

J. ACM, 2018

Computational Two-Party Correlation.

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

Electron. Colloquium Comput. Complex., 2018

On the Communication Complexity of Key-Agreement Protocols.

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

Electron. Colloquium Comput. Complex., 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

An Almost-Optimally Fair Three-Party Coin-Flipping Protocol.

Iftach Haitner, Eliad Tsfadia

SIAM J. Comput., 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

Limits on the Usefulness of Random Oracles.

Iftach Haitner, Eran Omri, Hila Zarosim

J. Cryptol., 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

From Non-adaptive to Adaptive Pseudorandom Functions.

Itay Berman, Iftach Haitner

J. Cryptol., 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

Coin Flipping with Constant Bias Implies One-Way Functions.

Iftach Haitner, Eran Omri

SIAM J. Comput., 2014

2013

Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions.

Iftach Haitner, Omer Reingold, Salil P. Vadhan

SIAM J. Comput., 2013

A Parallel Repetition Theorem for Any Interactive Argument.

Iftach Haitner

SIAM J. Comput., 2013

2012

On the Power of Random Oracles.

Iftach Haitner, Eran Omri, Hila Zarosim

Electron. Colloquium Comput. Complex., 2012

Hardness Preserving Reductions via Cuckoo Hashing.

Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor

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

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 Power of the Randomized Iterate.

Iftach Haitner, Danny Harnik, Omer Reingold

SIAM J. Comput., 2011

On the (In)Security of RSA Signatures.

Yevgeniy Dodis, Iftach Haitner, Aris Tentes

IACR Cryptol. ePrint Arch., 2011

2010

Universal One-Way Hash Functions via Inaccessible Entropy.

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

IACR Cryptol. ePrint Arch., 2010

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

Iftach Haitner, Mohammad Mahmoody, David Xiao

Electron. Colloquium Comput. Complex., 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

Reducing Complexity Assumptions for Statistically-Hiding Commitment.

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

J. Cryptol., 2009

Bounded Key-Dependent Message Security.

Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai

IACR Cryptol. ePrint Arch., 2009

Inaccessible Entropy.

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

Electron. Colloquium Comput. Complex., 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

2008

On the (Im)Possibility of Key Dependent Encryption.

Iftach Haitner, Thomas Holenstein

IACR Cryptol. ePrint Arch., 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

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

Iftach Haitner, Jonathan J. Hoch, Gil Segev

IACR Cryptol. ePrint Arch., 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

Electron. Colloquium Comput. Complex., 2007

2006

Statistically-Hiding Commitment from Any One-Way Function.

Iftach Haitner, Omer Reingold

IACR Cryptol. ePrint Arch., 2006

A New Interactive Hashing Theorem.

Iftach Haitner, Omer Reingold

Electron. Colloquium Comput. Complex., 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

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