Iftach Haitner

144 papers A* 18A 5B 9Misc 1Journal 97Unranked 13
YearRankTypeTitle / Venue / Authors
2026 J jnl
Fair Coin Flipping: Tighter Analysis and the Many-Party Case.
J. Cryptol.
Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2026 J jnl
On the Complexity of Interactive Arguments.
IACR Cryptol. ePrint Arch.
Idan Baril, Iftach Haitner
2025 — conf
Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer.
CRYPTO (4)
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan
2025 — conf
Exponent-VRFs and Their Applications.
EUROCRYPT (7)
Dan Boneh, Iftach Haitner, Yehuda Lindell, Gil Segev
2025 A* conf
From OT to OLE with Subquadratic Communication.
CCS
Jack Doerner, Iftach Haitner, Yuval Ishai, Nikolaos Makriyannis
2025 J jnl
From OT to OLE with Subquadratic Communication.
IACR Cryptol. ePrint Arch.
Jack Doerner, Iftach Haitner, Yuval Ishai, Nikolaos Makriyannis
2025 J jnl
Integer Commitments, Old and New Tools.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Yehuda Lindell, Nikolaos Makriyannis
2025 J jnl
Mildly Accurate Computationally Differentially Private Inner Product Protocols Imply Oblivious Transfer.
CoRR
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan
2025 J jnl
Tight Bounds on Uniform-Challenge Black-Box Reductions from Sigma Protocols.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Nikolaos Makriyannis
2025 J jnl
Tighter Concrete Security for the Simplest OT.
IACR Commun. Cryptol.
Iftach Haitner, Gil Segev
2025 J jnl
Tighter Concrete Security for the Simplest OT.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Gil Segev
2024 J jnl
Exponent-VRFs and Their Applications.
IACR Cryptol. ePrint Arch.
Dan Boneh, Iftach Haitner, Yehuda Lindell
2023 A conf
Incompressiblity and Next-Block Pseudoentropy.
ITCS
Iftach Haitner, Noam Mazor, Jad Silbak
2022 J jnl
From Fairness to Full Security in Multiparty Computation.
J. Cryptol.
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2022 — conf
Highly Efficient OT-Based Multiplication Protocols.
EUROCRYPT (1)
Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia
2022 J jnl
Incompressiblity and Next-Block Pseudoentropy.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Noam Mazor, Jad Silbak
2022 J jnl
Incompressiblity and Next-Block Pseudoentropy.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Noam Mazor, Jad Silbak
2022 — conf
Lower Bound on SNARGs in the Random Oracle Model.
CRYPTO (3)
Iftach Haitner, Daniel Nukrai, Eylon Yogev
2022 J jnl
Lower Bound on SNARGs in the Random Oracle Model.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Daniel Nukrai, Eylon Yogev
2022 J jnl
On the Round Complexity of Randomized Byzantine Agreement.
J. Cryptol.
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
2022 J jnl
On the complexity of fair coin flipping.
Theor. Comput. Sci.
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2022 A* conf
On the complexity of two-party differential privacy.
STOC
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
2022 J jnl
Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
SIAM J. Comput.
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2021 J jnl
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence.
CoRR
Itay Berman, Iftach Haitner, Eliad Tsfadia
2021 J jnl
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol.
CoRR
Iftach Haitner, Eliad Tsfadia
2021 J jnl
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.
CoRR
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
2021 J jnl
Characterization of Secure Multiparty Computation Without Broadcast.
CoRR
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2021 J jnl
Coin Flipping of \emph{Any} Constant Bias Implies One-Way Functions.
CoRR
Itay Berman, Iftach Haitner, Aris Tentes
2021 J jnl
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.
CoRR
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
2021 J jnl
Distributional Collision Resistance Beyond One-Way Functions.
CoRR
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
2021 J jnl
Fair Coin Flipping: Tighter Analysis and the Many-Party Case.
CoRR
Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2021 J jnl
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments.
CoRR
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2021 J jnl
From Fairness to Full Security in Multiparty Computation.
CoRR
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2021 J jnl
Hardness-Preserving Reductions via Cuckoo Hashing.
CoRR
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2021 J jnl
Highly Efficient OT-Based Multiplication Protocols.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia
2021 J jnl
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing.
CoRR
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2021 J jnl
Lower Bounds on the Time/Memory Tradeoff of Function Inversion.
CoRR
Dror Chawin, Iftach Haitner, Noam Mazor
2021 J jnl
On the Communication Complexity of Key-Agreement Protocols.
CoRR
Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
2021 J jnl
On the Complexity of Fair Coin Flipping.
CoRR
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2021 J jnl
On the Complexity of Two-Party Differential Privacy.
CoRR
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
2021 J jnl
On the Complexity of Two-Party Differential Privacy.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
2021 J jnl
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
CoRR
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2020 A* conf
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip.
FOCS
Iftach Haitner, Yonatan Karidi-Heller
2020 J jnl
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip.
CoRR
Iftach Haitner, Yonatan Karidi-Heller
2020 J jnl
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Yonatan Karidi-Heller
2020 — conf
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence.
CRYPTO (3)
Itay Berman, Iftach Haitner, Eliad Tsfadia
2020 J jnl
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.
SIAM J. Comput.
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
2020 J jnl
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions.
CoRR
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2020 J jnl
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing.
Theory Comput.
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2020 — conf
Lower Bounds on the Time/Memory Tradeoff of Function Inversion.
TCC (3)
Dror Chawin, Iftach Haitner, Noam Mazor
2020 J jnl
Lower Bounds on the Time/Memory Tradeoff of Function Inversion.
Electron. Colloquium Comput. Complex.
Dror Chawin, Iftach Haitner, Noam Mazor
2020 J jnl
Lower Bounds on the Time/Memory Tradeoff of Function Inversion.
IACR Cryptol. ePrint Arch.
Dror Chawin, Iftach Haitner, Noam Mazor
2020 — conf
On the Round Complexity of the Shuffle Model.
TCC (2)
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
2020 J jnl
On the Round Complexity of the Shuffle Model.
CoRR
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
2020 J jnl
On the Round Complexity of the Shuffle Model.
IACR Cryptol. ePrint Arch.
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
2019 J jnl
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments.
Electron. Colloquium Comput. Complex.
Itay Berman, Iftach Haitner, Eliad Tsfadia
2019 J jnl
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments.
IACR Cryptol. ePrint Arch.
Itay Berman, Iftach Haitner, Eliad Tsfadia
2019 — conf
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.
TCC (1)
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
2019 J jnl
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
2019 J jnl
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
2019 — conf
Distributional Collision Resistance Beyond One-Way Functions.
EUROCRYPT (3)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
2019 J jnl
Distributional Collision Resistance Beyond One-Way Functions.
IACR Cryptol. ePrint Arch.
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
2019 J jnl
From Fairness to Full Security in Multiparty Computation.
IACR Cryptol. ePrint Arch.
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2019 J jnl
Hardness-Preserving Reductions via Cuckoo Hashing.
J. Cryptol.
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2019 A conf
On the Communication Complexity of Key-Agreement Protocols.
ITCS
Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
2019 A conf
On the Round Complexity of Randomized Byzantine Agreement.
DISC
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
2019 J jnl
On the Round Complexity of Randomized Byzantine Agreement.
CoRR
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
2019 J jnl
On the Round Complexity of Randomized Byzantine Agreement.
IACR Cryptol. ePrint Arch.
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
2018 J jnl
Characterization of Secure Multiparty Computation Without Broadcast.
J. Cryptol.
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2018 J jnl
Coin Flipping of
J. ACM
Itay Berman, Iftach Haitner, Aris Tentes
2018 J jnl
Computational Two-Party Correlation.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
2018 A* conf
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.
FOCS
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
2018 Misc conf
From Fairness to Full Security in Multiparty Computation.
SCN
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2018 J jnl
On the Communication Complexity of Key-Agreement Protocols.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
2018 — conf
On the Complexity of Fair Coin Flipping.
TCC (1)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2018 J jnl
On the Complexity of Fair Coin Flipping.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2018 J jnl
On the Complexity of Fair Coin Flipping.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2018 A* conf
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
FOCS
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2017 J jnl
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol.
SIAM J. Comput.
Iftach Haitner, Eliad Tsfadia
2017 A* conf
Fair Coin Flipping: Tighter Analysis and the Many-Party Case.
SODA
Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2017 — ch.
The Many Entropies in One-Way Functions.
Tutorials on the Foundations of Cryptography
Iftach Haitner, Salil P. Vadhan
2017 J jnl
The Many Entropies in One-Way Functions.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Salil P. Vadhan
2017 J jnl
Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.
Electron. Colloquium Comput. Complex.
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2016 — conf
Characterization of Secure Multiparty Computation Without Broadcast.
TCC (A1)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2016 J jnl
Limits on the Usefulness of Random Oracles.
J. Cryptol.
Iftach Haitner, Eran Omri, Hila Zarosim
2015 J jnl
Characterization of Secure Multiparty Computation Without Broadcast.
IACR Cryptol. ePrint Arch.
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2015 J jnl
Coin Flipping of Any Constant Bias Implies One-Way Functions.
Electron. Colloquium Comput. Complex.
Itay Berman, Iftach Haitner, Aris Tentes
2015 J jnl
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments.
SIAM J. Comput.
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2015 J jnl
From Non-adaptive to Adaptive Pseudorandom Functions.
J. Cryptol.
Itay Berman, Iftach Haitner
2015 — conf
Parallel Hashing via List Recoverability.
CRYPTO (2)
Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel
2014 J jnl
A New Interactive Hashing Theorem.
J. Cryptol.
Iftach Haitner, Omer Reingold
2014 A* conf
An almost-optimally fair three-party coin-flipping protocol.
STOC
Iftach Haitner, Eliad Tsfadia
2014 J jnl
Coin Flipping with Constant Bias Implies One-Way Functions.
SIAM J. Comput.
Iftach Haitner, Eran Omri
2014 A* conf
Coin flipping of
STOC
Itay Berman, Iftach Haitner, Aris Tentes
2013 J jnl
A Parallel Repetition Theorem for Any Interactive Argument.
SIAM J. Comput.
Iftach Haitner
2013 J jnl
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions.
SIAM J. Comput.
Iftach Haitner, Omer Reingold, Salil P. Vadhan
2013 B conf
Hardness Preserving Reductions via Cuckoo Hashing.
TCC
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2013 B conf
Limits on the Usefulness of Random Oracles.
TCC
Iftach Haitner, Eran Omri, Hila Zarosim
2012 B conf
From Non-adaptive to Adaptive Pseudorandom Functions.
TCC
Itay Berman, Iftach Haitner
2012 J jnl
Hardness Preserving Reductions via Cuckoo Hashing.
Electron. Colloquium Comput. Complex.
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2012 J jnl
Hardness Preserving Reductions via Cuckoo Hashing.
IACR Cryptol. ePrint Arch.
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2012 B conf
On the Instantiability of Hash-and-Sign RSA Signatures.
TCC
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
2012 J jnl
On the Power of Random Oracles.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Eran Omri, Hila Zarosim
2012 J jnl
On the Power of Random Oracles.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Eran Omri, Hila Zarosim
2011 J jnl
Black-Box Constructions of Protocols for Secure Computation.
SIAM J. Comput.
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2011 A* conf
Coin Flipping with Constant Bias Implies One-Way Functions.
FOCS
Iftach Haitner, Eran Omri
2011 J jnl
From Non-Adaptive to Adaptive Pseudorandom Functions.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Itay Berman
2011 J jnl
On the (In)Security of RSA Signatures.
IACR Cryptol. ePrint Arch.
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
2011 J jnl
On the Power of the Randomized Iterate.
SIAM J. Comput.
Iftach Haitner, Danny Harnik, Omer Reingold
2010 A conf
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.
CCC
Iftach Haitner, Mohammad Mahmoody, David Xiao
2010 J jnl
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Mohammad Mahmoody, David Xiao
2010 J jnl
Black-Box Constructions of Protocols for Secure Computation.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
2010 A* conf
Bounded Key-Dependent Message Security.
EUROCRYPT
Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai
2010 J jnl
Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Omer Reingold, Salil P. Vadhan
2010 A* conf
Efficiency improvements in constructing pseudorandom generators from one-way functions.
STOC
Iftach Haitner, Omer Reingold, Salil P. Vadhan
2010 A* conf
Universal One-Way Hash Functions via Inaccessible Entropy.
EUROCRYPT
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2010 J jnl
Universal One-Way Hash Functions via Inaccessible Entropy.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2009 A* conf
A Parallel Repetition Theorem for Any Interactive Argument.
FOCS
Iftach Haitner
2009 J jnl
A Parallel Repetition Theorem for Any Interactive Argument.
Electron. Colloquium Comput. Complex.
Iftach Haitner
2009 J jnl
Bounded Key-Dependent Message Security.
IACR Cryptol. ePrint Arch.
Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai
2009 J jnl
Inaccessible Entropy.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2009 A* conf
Inaccessible entropy.
STOC
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2009 B conf
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.
TCC
Iftach Haitner, Alon Rosen, Ronen Shaltiel
2009 B conf
On the (Im)Possibility of Key Dependent Encryption.
TCC
Iftach Haitner, Thomas Holenstein
2009 J jnl
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
J. Cryptol.
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel
2009 J jnl
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function.
SIAM J. Comput.
Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan
2008 B conf
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
TCC
Iftach Haitner, Jonathan J. Hoch, Gil Segev
2008 J jnl
On the (Im)Possibility of Key Dependent Encryption.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Thomas Holenstein
2008 B conf
Semi-honest to Malicious Oblivious Transfer - The Black-Box Way.
TCC
Iftach Haitner
2007 J jnl
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Jonathan J. Hoch, Gil Segev
2007 A conf
A New Interactive Hashing Theorem.
CCC
Iftach Haitner, Omer Reingold
2007 A* conf
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
FOCS
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2007 J jnl
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2007 J jnl
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2007 A* conf
Statistically-hiding commitment from any one-way function.
STOC
Iftach Haitner, Omer Reingold
2006 J jnl
A New Interactive Hashing Theorem.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Omer Reingold
2006 — conf
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions.
ICALP (2)
Iftach Haitner, Danny Harnik, Omer Reingold
2006 A* conf
On the Power of the Randomized Iterate.
CRYPTO
Iftach Haitner, Danny Harnik, Omer Reingold
2006 J jnl
Statistically-Hiding Commitment from Any One-Way Function.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Omer Reingold
2005 J jnl
On the Power of the Randomized Iterate
Electron. Colloquium Comput. Complex.
Iftach Haitner, Danny Harnik, Omer Reingold
2005 A* conf
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
EUROCRYPT
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel
2004 B conf
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations.
TCC
Iftach Haitner
2004 J jnl
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions
Electron. Colloquium Comput. Complex.
Iftach Haitner, Ronen Shaltiel
2004 J jnl
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Ronen Shaltiel