Iftach Haitner

发表

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

Eran Omri, Amos Beimel, Iftach Haitner, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Coin Flipping of Any Constant Bias Implies One-Way Functions

Iftach Haitner, Itay Berman, Aris Tentes, 2018 .

On the complexity of two-party differential privacy

Iftach Haitner, N. Mazor, Jad Silbak, 2021, Electron. Colloquium Comput. Complex..

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

S. Vadhan, O. Reingold, H. Wee, 2021, Theory of Computing.

On the Round Complexity of Randomized Byzantine Agreement

Alex Samorodnitsky, Nikolaos Makriyannis, Ran Cohen, 2022, Journal of Cryptology.

Hardness-Preserving Reductions via Cuckoo Hashing

M. Naor, Ilan Komargodski, Iftach Haitner, 2013, Journal of Cryptology.

On the (In)Security of RSA Signatures

Yevgeniy Dodis, Iftach Haitner, Aris Tentes, 2011, IACR Cryptol. ePrint Arch..

On the Power of the Randomized Iterate

Omer Reingold, Iftach Haitner, Danny Harnik, 2006, SIAM J. Comput..

From Fairness to Full Security in Multiparty Computation

Eran Omri, Iftach Haitner, Lior Rotem, 2018, Journal of Cryptology.

On the Round Complexity of Randomized Byzantine Agreement

Alex Samorodnitsky, Iftach Haitner, Nikolaos Makriyannis, 2019, IACR Cryptol. ePrint Arch..

Characterization of Secure Multiparty Computation Without Broadcast

Eran Omri, Iftach Haitner, Lior Rotem, 2016, Journal of Cryptology.

Incompressiblity and Next-Block Pseudoentropy

Iftach Haitner, N. Mazor, Jad Silbak, 2022, Electron. Colloquium Comput. Complex..

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

Omer Reingold, Hoeteck Wee, Salil Vadhan, 2020, ArXiv.

The Many Entropies in One-Way Functions

Salil P. Vadhan, Iftach Haitner, S. Vadhan, 2017, Tutorials on the Foundations of Cryptography.

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

Iftach Haitner, Mohammad Mahmoody, David Xiao, 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

Inaccessible entropy

Omer Reingold, Hoeteck Wee, Salil P. Vadhan, 2009, STOC '09.

A constant-round public-coin protocol for sampling with size, and applications (working draft)

David Xiao, Mohammad Mahmoody-Ghidary, Iftach Haitner, 2009 .

Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

Omer Reingold, Gil Segev, Iftach Haitner, 2015, SIAM J. Comput..

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

Omer Reingold, Salil P. Vadhan, Iftach Haitner, 2009, SIAM J. Comput..

Reducing Complexity Assumptions for Statistically-Hiding Commitment

Jonathan Katz, Ronen Shaltiel, Chiu-Yuen Koo, 2009, Journal of Cryptology.

Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments

Omer Reingold, Gil Segev, Iftach Haitner, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

A New Interactive Hashing Theorem

Omer Reingold, Iftach Haitner, O. Reingold, 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

Statistically-hiding commitment from any one-way function

Omer Reingold, Iftach Haitner, O. Reingold, 2007, STOC '07.

Reducing Complexity Assumptions for Statistically-Hiding Commitment

Jonathan Katz, Ronen Shaltiel, Chiu-Yuen Koo, 2005, EUROCRYPT.

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

Ronen Shaltiel, Iftach Haitner, Ronen Shaltiel, 2004, Electron. Colloquium Comput. Complex..

On the (Im)Possibility of Key Dependent Encryption

Thomas Holenstein, Iftach Haitner, Thomas Holenstein, 2009, TCC.

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

Niv Buchbinder, Iftach Haitner, Eliad Tsfadia, 2017, SODA.

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

Iftach Haitner, Eliad Tsfadia, Iftach Haitner, 2014, SIAM J. Comput..

Coin flipping of any constant bias implies one-way functions

Itay Berman, Iftach Haitner, Aris Tentes, 2014, STOC.

Distributional Collision Resistance Beyond One-Way Functions

Nir Bitansky, Ilan Komargodski, Eylon Yogev, 2019, IACR Cryptol. ePrint Arch..

On the Instantiability of Hash-and-Sign RSA Signatures

Yevgeniy Dodis, Iftach Haitner, Aris Tentes, 2012, TCC.

Parallel Hashing via List Recoverability

Eran Omri, Yuval Ishai, Ronen Shaltiel, 2015, CRYPTO.

Bounded Key-Dependent Message Security

Yuval Ishai, Dennis Hofheinz, Boaz Barak, 2010, IACR Cryptol. ePrint Arch..

On the Round Complexity of Randomized Byzantine Agreement

Alex Samorodnitsky, Nikolaos Makriyannis, Ran Cohen, 2019, Journal of Cryptology.

Efficiency improvements in constructing pseudorandom generators from one-way functions

Omer Reingold, Salil P. Vadhan, Iftach Haitner, 2010, STOC '10.

Universal One-Way Hash Functions via Inaccessible Entropy

Omer Reingold, Hoeteck Wee, Salil Vadhan, 2010, EUROCRYPT.

On the Round Complexity of the Shuffle Model pdf

Amos Beimel, Kobbi Nissim, Uri Stemmer, 2020, IACR Cryptol. ePrint Arch..

Coin Flipping with Constant Bias Implies One-Way Functions

Eran Omri, Iftach Haitner, Eran Omri, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

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

Ronen Shaltiel, Iftach Haitner, Jad Silbak, 2019, IACR Cryptol. ePrint Arch..

Computational Two-Party Correlation

Kobbi Nissim, Eran Omri, Ronen Shaltiel, 2018, FOCS 2018.

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

Eran Omri, Ronen Shaltiel, Kobbi Nissim, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Limits on the Usefulness of Random Oracles

Eran Omri, Iftach Haitner, Hila Zarosim, 2013, Journal of Cryptology.

On the Power of Random Oracles

Eran Omri, Iftach Haitner, Hila Zarosim, 2012, Electron. Colloquium Comput. Complex..

Black-Box Constructions of Protocols for Secure Computation

Yehuda Lindell, Yuval Ishai, Eyal Kushilevitz, 2011, IACR Cryptol. ePrint Arch..

Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations

Iftach Haitner, Iftach Haitner, 2004, TCC.

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

Iftach Haitner, Iftach Haitner, 2008, TCC.

Hardness-Preserving Reductions via Cuckoo Hashing

Moni Naor, Ilan Komargodski, Itay Berman, 2013, Journal of Cryptology.

Coin Flipping of Any Constant Bias Implies One-Way Functions

Iftach Haitner, Itay Berman, Aris Tentes, 2018 .

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

Ronen Shaltiel, Alon Rosen, Iftach Haitner, 2009, TCC.

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

Gil Segev, Iftach Haitner, Jonathan J. Hoch, 2008, TCC.