b406262

Iftach Haitner יפתח הייטנר

I am a  faculty member at the School of Computer Science at Tel Aviv University.  I am a member at the Israeli Center of Research Excellence in Algorithms (ICORE) and the Check Point Institute for Information Security.
My main research interests are Cryptography and Computational Complexity.
[Contact Info] [Short Bio] [Professional Activity] [School Activity]
Teaching
Seminar on Pseudorandomness (Fall 13), Computational Model (Spring 14), Foundation of Cryptography (Spring 14)

Publications
in Reverse Chronological Order

  • Itay Berman and Iftach Haitner and  Aris Tentes
    Coin Flipping of Any Constant Bias Implies One-Way Functions [Abstract] [Slides] 
    STOC 2014 [PDF]

  • Iftach Haitner and Eliad Tsfadia
    An Almost-Optimally Fair Three-Party Coin-Flipping Protocol [Abstract]  [Slides]
    STOC 2014 [PDF]

  • Iftach Haitner, Jonathan J. Hoch, Omer Reingold and Gil Segev
    Finding Collisions in Interactive Protocols — Tight Lower Bounds on the Round Complexity and Communication Complexity of Statistically Hiding Commitments [Abstract]
    Manuscript 2013 [PDF]
  • Itay Berman and Iftach Haitner and  Ilan Komargodski and  Moni Naor
    Hardness Preserving Reductions via Cuckoo Hashing [Abstract] 
    TCC 2013 [PDF]

    Draft of full version [PDF]

  • Iftach Haitner and Eran Omri  and Hila Zarosim 
    Limits on the Usefulness of Random Oracles [Abstract]
    TCC 2013 [PDF]
    Draft of full version
    [PDF]

  • Itay Berman and Iftach Haitner
    From Non-Adaptive to Adaptive Pseudorandom Functions [Abstract]
    TCC 2012 [PDF]

    Draft of full version [PDF]

  • Iftach Haitner and Eran Omri 
    Coin Flipping with Constant Bias Implies One-Way Functions [Abstract]  [Slides] 
    SIAM Journal of Computing 2013 [link]

    FOCS 2011 [PDF]
    Draft of full version [PDF]

  • Yevgeniy Dodis, Iftach Haitner and Aris Tentes
    On the Instantiability of Hash-and-Sign RSA Signatures [Abstract] [Slides
    TCC 2012 [PDF]

    Draft of full version [PDF]

  • Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell and Erez Petrank
    Black-Box Constructions of Protocols for Secure Computation [Abstract] 
    SIAM Journal of Computing 2011
    [link]
    Draft of full version [PDF]

  • Iftach Haitner, Omer Reingold, and Salil Vadhan
    Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions  [Abstract]
    SIAM Journal of Computing 2013 [link]
    Annual ACM Symposium on Theory of Computing (STOC), 2010
    [PDF]
    Draft of full version [PDF]

  • Boaz Barak, Iftach Haitner, Dennis Hofheinz and Yuval Ishai
    Bounded Key-Dependent Message Security [Abstract]
    Advances in Cryptology - Eurocrypt, 2010 [PDF]
    Draft of full version [PDF]

  • Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil Vadhan and Hoeteck Wee
    Universal One-Way Hash Functions via Inaccessible Entropy [Abstract]
    Advances in Cryptology - Eurocrypt, 2010 [PDF]
    Draft of full version [PDF]  

  • Iftach Haitner, Mohammad Mahmoody and David Xiao
    A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP [Abstract]

    IEEE Conference on Computational Complexity  (CCC), 2010 [PDF] 
    Draft of full version [PDF] 

  • Iftach Haitner
    A Parallel Repetition Theorem for Any Interactive Argument [Abstract] [Slides]
    SIAM Journal of Computing 2013 [link]

    IEEE Symposium on Foundations of Computer Science (FOCS), 2009
    Draft of full version [PDF]

  • Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold and Salil Vadhan
    Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function [Abstract]
    SIAM Journal of Computing 2009 [link]
    Draft of full version
    [PDF]

  • Iftach Haitner, Omer Reingold, Salil Vadhan and Hoeteck Wee
    Inaccessible Entropy [Abstract] [Slides] [Video (appx. 1 hour)]
    Annual ACM Symposium on Theory of Computing (STOC), 2009 [PDF]
    Draft of full version [PDF]

  • Iftach Haitner, Alon Rosen and Ronen Shaltiel
    On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols [Abstract] [Slides]
    Theory of Cryptography Conference (TCC), 2009 [PDF]

  • Iftach Haitner and  Thomas Holenstein
    On the (Im)Possibility of Key Dependent Encryption [Abstract] [Slides]
    Theory of Cryptography Conference (TCC), 2009 [PDF]
    Draft of full version [PDF]

  • Iftach Haitner
    New Implications and Improved Efficiency of Constructions Based on One-way Functions
    PhD. Thesis, 2008 [PDF]

  • Iftach Haitner
    Semi-Honest to Malicious Oblivious Transfer -- The Black-Box Way [Abstract] [Slides]

    Theory of Cryptography Conference (TCC), 2008  [PDF]
    Full version is part of [Black-Box Constructions of Protocols for Secure Computation]

  • Iftach Haitner, Jonathan J. Hoch and  Gil Segev
    A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval [Abstract]  [Slides]
    Theory of Cryptography Conference (TCC), 2008 [PDF]
    Full version is part of [Finding Collisions in Interactive Protocols — Tight Lower Bounds on the Round Complexity and Communication Complexity of Statistically Hiding Commitments]

  • Iftach Haitner, Jonathan J. Hoch, Omer Reingold and Gil Segev
    Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments [Abstract] [Slides]
    IEEE Symposium on Foundations of Computer Science (FOCS), 2007 [PDF]
    Full version is part of [Finding Collisions in Interactive Protocols — Tight Lower Bounds on the Round Complexity and Communication Complexity of Statistically Hiding Commitments]

  • Iftach Haitner and Omer Reingold
    Statistically Hiding Commitment from Any One-Way Function [Abstract] [Slides]

    Annual ACM Symposium on Theory of Computing (STOC), 2007 [PDF]
    Full version is part of [Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function]

  • Iftach Haitner and Omer Reingold
    A New Interactive Hashing Theorem [Abstract] [Slides]
    Journal of Cryptology 2014  [link]

    IEEE Conference on Computational Complexity  (CCC), 2007 [PDF]

    Draft of full version [PDF]

  • Iftach Haitner, Danny Harnik and Omer Reingold
    On the Power of the Randomized Iterate [Abstract] [Slides]

    SIAM Journal of Computing 2011 [link]
    Advanced in Cryptology - CRYPTO, 2006 [PDF]

    Draft of full version [PDF] 

  • Iftach Haitner, Danny Harnik and Omer Reingold
    On Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions [Abstract] [Slides]

    International Colloquium on Automata, Languages and Programming - ICALP, 2006 [PDF]
    Full version is part of [On the Power of the Randomized Iterate]

  • Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli and Ronen Shaltiel
    Reducing Complexity Assumptions for Statistically-Hiding Commitment [Abstract] [Slides]

    Journal of Cryptology 2009 [link]
    Advances in Cryptology - Eurocrypt, 2005
    [PDF]
    Draft of full version [PDF]

  • Iftach Haitner
    Implementing Oblivious Transfer Using a Collection of Dense Trapdoor Permutations [Abstract] [Slides]

    Theory of Cryptography Conference (TCC), 2004 [PDF]
    Draft of full version [PDF]