Iftach Haitner

Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor: Hardness Preserving Reductions via Cuckoo Hashing. TCC 2013: 40-59

Iftach Haitner, Eran Omri, Hila Zarosim: Limits on the Usefulness of Random Oracles. TCC 2013: 437-456

Yevgeniy Dodis, Iftach Haitner, Aris Tentes: On the Instantiability of Hash-and-Sign RSA Signatures. TCC 2012: 112-132

Itay Berman, Iftach Haitner: From Non-adaptive to Adaptive Pseudorandom Functions. TCC 2012: 357-368

Iftach Haitner, Eran Omri, Hila Zarosim: On the Power of Random Oracles. Electronic Colloquium on Computational Complexity (ECCC) 19: 129 (2012)

Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor: Hardness Preserving Reductions via Cuckoo Hashing. Electronic Colloquium on Computational Complexity (ECCC) 19: 182 (2012)

Iftach Haitner, Eran Omri, Hila Zarosim: On the Power of Random Oracles. IACR Cryptology ePrint Archive 2012: 573 (2012)

Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor: Hardness Preserving Reductions via Cuckoo Hashing. IACR Cryptology ePrint Archive 2012: 722 (2012)

Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-Box Constructions of Protocols for Secure Computation. SIAM J. Comput. 40(2): 225-266 (2011)

Iftach Haitner, Danny Harnik, Omer Reingold: On the Power of the Randomized Iterate. SIAM J. Comput. 40(6): 1486-1528 (2011)

Iftach Haitner, Eran Omri: Coin Flipping with Constant Bias Implies One-Way Functions. FOCS 2011: 110-119

Yevgeniy Dodis, Iftach Haitner, Aris Tentes: On the (In)Security of RSA Signatures. IACR Cryptology ePrint Archive 2011: 87 (2011)

Iftach Haitner, Itay Berman: From Non-Adaptive to Adaptive Pseudorandom Functions. IACR Cryptology ePrint Archive 2011: 504 (2011)

Iftach Haitner, Mohammad Mahmoody, David Xiao: A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. IEEE Conference on Computational Complexity 2010: 76-87

Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai: Bounded Key-Dependent Message Security. EUROCRYPT 2010: 423-444

Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT 2010: 616-637

Iftach Haitner, Omer Reingold, Salil P. Vadhan: Efficiency improvements in constructing pseudorandom generators from one-way functions. STOC 2010: 437-446

Iftach Haitner, Mohammad Mahmoody, David Xiao: A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. Electronic Colloquium on Computational Complexity (ECCC) 17: 1 (2010)

Iftach Haitner, Omer Reingold, Salil P. Vadhan: Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions. Electronic Colloquium on Computational Complexity (ECCC) 17: 89 (2010)

Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptology ePrint Archive 2010: 120 (2010)

Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-Box Constructions of Protocols for Secure Computation. IACR Cryptology ePrint Archive 2010: 164 (2010)

Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. J. Cryptology 22(3): 283-310 (2009)

Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan: Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function. SIAM J. Comput. 39(3): 1153-1218 (2009)

Iftach Haitner: A Parallel Repetition Theorem for Any Interactive Argument. FOCS 2009: 241-250

Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Inaccessible entropy. STOC 2009: 611-620

Iftach Haitner, Thomas Holenstein: On the (Im)Possibility of Key Dependent Encryption. TCC 2009: 202-219

Iftach Haitner, Alon Rosen, Ronen Shaltiel: On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. TCC 2009: 220-237

Iftach Haitner: A Parallel Repetition Theorem for Any Interactive Argument. Electronic Colloquium on Computational Complexity (ECCC) 16: 27 (2009)

Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Inaccessible Entropy. Electronic Colloquium on Computational Complexity (ECCC) 16: 45 (2009)

Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai: Bounded Key-Dependent Message Security. IACR Cryptology ePrint Archive 2009: 511 (2009)

Iftach Haitner: Semi-honest to Malicious Oblivious Transfer - The Black-Box Way. TCC 2008: 412-426

Iftach Haitner, Jonathan J. Hoch, Gil Segev: A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. TCC 2008: 445-464

Iftach Haitner, Thomas Holenstein: On the (Im)Possibility of Key Dependent Encryption. IACR Cryptology ePrint Archive 2008: 164 (2008)

Iftach Haitner, Omer Reingold: A New Interactive Hashing Theorem. IEEE Conference on Computational Complexity 2007: 319-332

Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev: Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. FOCS 2007: 669-679

Iftach Haitner, Omer Reingold: Statistically-hiding commitment from any one-way function. STOC 2007: 1-10

Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev: Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. Electronic Colloquium on Computational Complexity (ECCC) 14(038) (2007)

Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev: Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. IACR Cryptology ePrint Archive 2007: 145 (2007)

Iftach Haitner, Jonathan J. Hoch, Gil Segev: A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. IACR Cryptology ePrint Archive 2007: 351 (2007)

Iftach Haitner, Danny Harnik, Omer Reingold: On the Power of the Randomized Iterate. CRYPTO 2006: 22-40

Iftach Haitner, Danny Harnik, Omer Reingold: Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. ICALP (2) 2006: 228-239

Iftach Haitner, Omer Reingold: A New Interactive Hashing Theorem. Electronic Colloquium on Computational Complexity (ECCC) 13(096) (2006)

Iftach Haitner, Omer Reingold: Statistically-Hiding Commitment from Any One-Way Function. IACR Cryptology ePrint Archive 2006: 436 (2006)

Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. EUROCRYPT 2005: 58-77

Iftach Haitner, Danny Harnik, Omer Reingold: On the Power of the Randomized Iterate. Electronic Colloquium on Computational Complexity (ECCC)(135) (2005)

Iftach Haitner: Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations. TCC 2004: 394-409

Iftach Haitner, Ronen Shaltiel: Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions. Electronic Colloquium on Computational Complexity (ECCC)(115) (2004)

Iftach Haitner, Ronen Shaltiel: Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions. IACR Cryptology ePrint Archive 2004: 335 (2004)