Iftach Haitner

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 73

Top Venues

CoRR

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

J. Cryptol.

Publications

Dan Boneh, Iftach Haitner, Yehuda Lindell
Exponent-VRFs and Their Applications. IACR Cryptol. ePrint Arch. 2024 (2024)
Iftach Haitner, Noam Mazor, Jad Silbak
Incompressiblity and Next-Block Pseudoentropy. ITCS (2023)
Iftach Haitner, Noam Mazor, Jad Silbak
Incompressiblity and Next-Block Pseudoentropy. IACR Cryptol. ePrint Arch. 2022 (2022)
Iftach Haitner, Daniel Nukrai, Eylon Yogev
Lower Bound on SNARGs in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2022 (2022)
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. SIAM J. Comput. 51 (4) (2022)
Iftach Haitner, Daniel Nukrai, Eylon Yogev
Lower Bound on SNARGs in the Random Oracle Model. CRYPTO (3) (2022)
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
On the complexity of two-party differential privacy. STOC (2022)
Iftach Haitner, Noam Mazor, Jad Silbak
Incompressiblity and Next-Block Pseudoentropy. Electron. Colloquium Comput. Complex. (2022)
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
On the Round Complexity of Randomized Byzantine Agreement. J. Cryptol. 35 (2) (2022)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. J. Cryptol. 35 (1) (2022)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
On the complexity of fair coin flipping. Theor. Comput. Sci. 914 (2022)
Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia
Highly Efficient OT-Based Multiplication Protocols. EUROCRYPT (1) (2022)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
On the Complexity of Fair Coin Flipping. CoRR (2021)
Itay Berman, Iftach Haitner, Eliad Tsfadia
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. CoRR (2021)
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
On the Complexity of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. 28 (2021)
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. CoRR (2021)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. CoRR (2021)
Dror Chawin, Iftach Haitner, Noam Mazor
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. CoRR (2021)
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. CoRR (2021)
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. CoRR (2021)
Iftach Haitner, Eliad Tsfadia
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol. CoRR (2021)
Itay Berman, Iftach Haitner, Aris Tentes
Coin Flipping of \emph{Any} Constant Bias Implies One-Way Functions. CoRR (2021)
Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
On the Communication Complexity of Key-Agreement Protocols. CoRR (2021)
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
Hardness-Preserving Reductions via Cuckoo Hashing. CoRR (2021)
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. CoRR (2021)
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. CoRR (2021)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. CoRR (2021)
Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia
Highly Efficient OT-Based Multiplication Protocols. IACR Cryptol. ePrint Arch. 2021 (2021)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. CoRR (2021)
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
On the Complexity of Two-Party Differential Privacy. CoRR (2021)
Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. CoRR (2021)
Iftach Haitner, Yonatan Karidi-Heller
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip. CoRR (2020)
Iftach Haitner, Yonatan Karidi-Heller
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip. FOCS (2020)
Dror Chawin, Iftach Haitner, Noam Mazor
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. TCC (3) (2020)
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions. CoRR (2020)
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
On the Round Complexity of the Shuffle Model. TCC (2) (2020)
Dror Chawin, Iftach Haitner, Noam Mazor
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. Electron. Colloquium Comput. Complex. 27 (2020)
Iftach Haitner, Yonatan Karidi-Heller
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip. Electron. Colloquium Comput. Complex. 27 (2020)
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
On the Round Complexity of the Shuffle Model. CoRR (2020)
Itay Berman, Iftach Haitner, Eliad Tsfadia
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. CRYPTO (3) (2020)
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. SIAM J. Comput. 49 (6) (2020)
Dror Chawin, Iftach Haitner, Noam Mazor
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. IACR Cryptol. ePrint Arch. 2020 (2020)
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. Theory Comput. 16 (2020)
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
On the Round Complexity of the Shuffle Model. IACR Cryptol. ePrint Arch. 2020 (2020)
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
On the Round Complexity of Randomized Byzantine Agreement. DISC (2019)
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
Hardness-Preserving Reductions via Cuckoo Hashing. J. Cryptol. 32 (2) (2019)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. IACR Cryptol. ePrint Arch. 2019 (2019)
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
On the Round Complexity of Randomized Byzantine Agreement. CoRR (2019)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. EUROCRYPT (3) (2019)
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
On the Round Complexity of Randomized Byzantine Agreement. IACR Cryptol. ePrint Arch. 2019 (2019)
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. IACR Cryptol. ePrint Arch. 2019 (2019)
Itay Berman, Iftach Haitner, Eliad Tsfadia
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. Electron. Colloquium Comput. Complex. 26 (2019)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. IACR Cryptol. ePrint Arch. 2019 (2019)
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. Electron. Colloquium Comput. Complex. 26 (2019)
Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
On the Communication Complexity of Key-Agreement Protocols. ITCS (2019)
Itay Berman, Iftach Haitner, Eliad Tsfadia
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. IACR Cryptol. ePrint Arch. 2019 (2019)
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. TCC (1) (2019)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. J. Cryptol. 31 (2) (2018)
Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
On the Communication Complexity of Key-Agreement Protocols. Electron. Colloquium Comput. Complex. 25 (2018)
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. FOCS (2018)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
On the Complexity of Fair Coin Flipping. IACR Cryptol. ePrint Arch. 2018 (2018)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
On the Complexity of Fair Coin Flipping. TCC (1) (2018)
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
Computational Two-Party Correlation. Electron. Colloquium Comput. Complex. 25 (2018)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
On the Complexity of Fair Coin Flipping. Electron. Colloquium Comput. Complex. 25 (2018)
Itay Berman, Iftach Haitner, Aris Tentes
Constant Bias Implies One-Way Functions. J. ACM 65 (3) (2018)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. SCN (2018)
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. FOCS (2018)
Iftach Haitner, Eliad Tsfadia
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol. SIAM J. Comput. 46 (2) (2017)
Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. SODA (2017)
Iftach Haitner, Salil P. Vadhan
The Many Entropies in One-Way Functions. Electron. Colloquium Comput. Complex. 24 (2017)
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling. Electron. Colloquium Comput. Complex. 24 (2017)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. TCC (A1) (2016)
Iftach Haitner, Eran Omri, Hila Zarosim
Limits on the Usefulness of Random Oracles. J. Cryptol. 29 (2) (2016)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. IACR Cryptol. ePrint Arch. 2015 (2015)
Itay Berman, Iftach Haitner
From Non-adaptive to Adaptive Pseudorandom Functions. J. Cryptol. 28 (2) (2015)
Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel
Parallel Hashing via List Recoverability. CRYPTO (2) (2015)
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. SIAM J. Comput. 44 (1) (2015)
Itay Berman, Iftach Haitner, Aris Tentes
Coin Flipping of Any Constant Bias Implies One-Way Functions. Electron. Colloquium Comput. Complex. 22 (2015)
Iftach Haitner, Eran Omri
Coin Flipping with Constant Bias Implies One-Way Functions. SIAM J. Comput. 43 (2) (2014)
Iftach Haitner, Omer Reingold
A New Interactive Hashing Theorem. J. Cryptol. 27 (1) (2014)
Itay Berman, Iftach Haitner, Aris Tentes
constant bias implies one-way functions. STOC (2014)
Iftach Haitner, Eliad Tsfadia
An almost-optimally fair three-party coin-flipping protocol. STOC (2014)
Iftach Haitner, Omer Reingold, Salil P. Vadhan
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions. SIAM J. Comput. 42 (3) (2013)
Iftach Haitner
A Parallel Repetition Theorem for Any Interactive Argument. SIAM J. Comput. 42 (6) (2013)
Iftach Haitner, Eran Omri, Hila Zarosim
Limits on the Usefulness of Random Oracles. TCC (2013)
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
Hardness Preserving Reductions via Cuckoo Hashing. TCC (2013)
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
Hardness Preserving Reductions via Cuckoo Hashing. IACR Cryptol. ePrint Arch. 2012 (2012)
Itay Berman, Iftach Haitner
From Non-adaptive to Adaptive Pseudorandom Functions. TCC (2012)
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
Hardness Preserving Reductions via Cuckoo Hashing. Electron. Colloquium Comput. Complex. 19 (2012)
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
On the Instantiability of Hash-and-Sign RSA Signatures. TCC (2012)
Iftach Haitner, Eran Omri, Hila Zarosim
On the Power of Random Oracles. IACR Cryptol. ePrint Arch. 2012 (2012)
Iftach Haitner, Eran Omri, Hila Zarosim
On the Power of Random Oracles. Electron. Colloquium Comput. Complex. 19 (2012)
Iftach Haitner, Itay Berman
From Non-Adaptive to Adaptive Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2011 (2011)
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
Black-Box Constructions of Protocols for Secure Computation. SIAM J. Comput. 40 (2) (2011)
Iftach Haitner, Danny Harnik, Omer Reingold
On the Power of the Randomized Iterate. SIAM J. Comput. 40 (6) (2011)
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
On the (In)Security of RSA Signatures. IACR Cryptol. ePrint Arch. 2011 (2011)
Iftach Haitner, Eran Omri
Coin Flipping with Constant Bias Implies One-Way Functions. FOCS (2011)
Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai
Bounded Key-Dependent Message Security. EUROCRYPT (2010)
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptol. ePrint Arch. 2010 (2010)
Iftach Haitner, Omer Reingold, Salil P. Vadhan
Efficiency improvements in constructing pseudorandom generators from one-way functions. STOC (2010)

Iftach Haitner.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Iftach Haitner