Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Iftach
    Last name: Haitner
    DBLP: 26/2723
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 65 of 65  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia.
    Fair Coin Flipping: Tighter Analysis and the Many-Party Case.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Iftach Haitner, Eliad Tsfadia.
    An Almost-Optimally Fair Three-Party Coin-Flipping Protocol.
    SIAM J. Comput. 2017, Volume 46 (0) 2017
    Conference paper
    Iftach Haitner, Salil P. Vadhan.
    The Many Entropies in One-Way Functions.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Book chapter
    Iftach Haitner, Salil P. Vadhan.
    The Many Entropies in One-Way Functions.
    Tutorials on the Foundations of Cryptography. 2017 (0) 2017
    Conference paper
    Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem.
    Characterization of Secure Multiparty Computation Without Broadcast.
    Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I 2016 (0) 2016
    Conference paper
    Iftach Haitner, Eran Omri, Hila Zarosim.
    Limits on the Usefulness of Random Oracles.
    J. Cryptology 2016, Volume 29 (0) 2016
    Journal article
    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. 2015, Volume 44 (0) 2015
    Conference paper
    Itay Berman, Iftach Haitner.
    From Non-adaptive to Adaptive Pseudorandom Functions.
    J. Cryptology 2015, Volume 28 (0) 2015
    Conference paper
    Itay Berman, Iftach Haitner, Aris Tentes.
    Coin Flipping of Any Constant Bias Implies One-Way Functions.
    Electronic Colloquium on Computational Complexity (ECCC) 2015, Volume 22 (0) 2015
    Conference paper
    Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel.
    Parallel Hashing via List Recoverability.
    Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II 2015 (0) 2015
    Conference paper
    Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem.
    Characterization of Secure Multiparty Computation Without Broadcast.
    IACR Cryptology ePrint Archive 2015, Volume 2015 (0) 2015
    Journal article
    Iftach Haitner, Omer Reingold.
    A New Interactive Hashing Theorem.
    J. Cryptology 2014, Volume 27 (0) 2014
    Conference paper
    Iftach Haitner, Eran Omri.
    Coin Flipping with Constant Bias Implies One-Way Functions.
    SIAM J. Comput. 2014, Volume 43 (0) 2014
    Conference paper
    Itay Berman, Iftach Haitner, Aris Tentes.
    Coin flipping of
    Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014 2014 (0) 2014
    Conference paper
    Iftach Haitner, Eliad Tsfadia.
    An almost-optimally fair three-party coin-flipping protocol.
    Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014 2014 (0) 2014
    Conference paper
    Iftach Haitner, Eran Omri, Hila Zarosim.
    Limits on the Usefulness of Random Oracles.
    TCC 2013 (0) 2013
    Conference paper
    Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor.
    Hardness Preserving Reductions via Cuckoo Hashing.
    TCC 2013 (0) 2013
    Conference paper
    Iftach Haitner, Omer Reingold, Salil P. Vadhan.
    Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions.
    SIAM J. Comput. 2013, Volume 42 (0) 2013
    Conference paper
    Iftach Haitner.
    A Parallel Repetition Theorem for Any Interactive Argument.
    SIAM J. Comput. 2013, Volume 42 (0) 2013
    Conference paper
    Itay Berman, Iftach Haitner.
    From Non-adaptive to Adaptive Pseudorandom Functions.
    Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, Italy, March 19-21, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Yevgeniy Dodis, Iftach Haitner, Aris Tentes.
    On the Instantiability of Hash-and-Sign RSA Signatures.
    Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, Italy, March 19-21, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Iftach Haitner, Eran Omri, Hila Zarosim.
    On the Power of Random Oracles.
    IACR Cryptology ePrint Archive 2012, Volume 2012 (0) 2012
    Conference paper
    Iftach Haitner, Eran Omri, Hila Zarosim.
    On the Power of Random Oracles.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor.
    Hardness Preserving Reductions via Cuckoo Hashing.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor.
    Hardness Preserving Reductions via Cuckoo Hashing.
    IACR Cryptology ePrint Archive 2012, Volume 2012 (0) 2012
    Conference paper
    Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank.
    Black-Box Constructions of Protocols for Secure Computation.
    SIAM J. Comput. 2011, Volume 40 (0) 2011
    Journal article
    Yevgeniy Dodis, Iftach Haitner, Aris Tentes.
    On the (In)Security of RSA Signatures.
    IACR Cryptology ePrint Archive 2011, Volume 2011 (0) 2011
    Conference paper
    Iftach Haitner, Eran Omri.
    Coin Flipping with Constant Bias Implies One-Way Functions.
    IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011 2011 (0) 2011
    Conference paper
    Iftach Haitner, Itay Berman.
    From Non-Adaptive to Adaptive Pseudorandom Functions.
    IACR Cryptology ePrint Archive 2011, Volume 2011 (0) 2011
    Conference paper
    Iftach Haitner, Danny Harnik, Omer Reingold.
    On the Power of the Randomized Iterate.
    SIAM J. Comput. 2011, Volume 40 (0) 2011
    Conference paper
    Iftach Haitner, Omer Reingold, Salil P. Vadhan.
    Efficiency improvements in constructing pseudorandom generators from one-way functions.
    Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010 2010 (0) 2010
    Conference paper
    Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai.
    Bounded Key-Dependent Message Security.
    Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30 - June 3, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee.
    Universal One-Way Hash Functions via Inaccessible Entropy.
    Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30 - June 3, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Iftach Haitner, Mohammad Mahmoody, David Xiao.
    A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.
    Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, June 9-12, 2010 2010 (0) 2010
    Journal article
    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) 2010, Volume 17 (0) 2010
    Journal article
    Iftach Haitner, Omer Reingold, Salil P. Vadhan.
    Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions.
    Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17 (0) 2010
    Journal article
    Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee.
    Universal One-Way Hash Functions via Inaccessible Entropy.
    IACR Cryptology ePrint Archive 2010, Volume 2010 (0) 2010
    Conference paper
    Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank.
    Black-Box Constructions of Protocols for Secure Computation.
    IACR Cryptology ePrint Archive 2010, Volume 2010 (0) 2010
    Journal article
    Iftach Haitner.
    A Parallel Repetition Theorem for Any Interactive Argument.
    Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16 (0) 2009
    Journal article
    Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee.
    Inaccessible Entropy.
    Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16 (0) 2009
    Journal article
    Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai.
    Bounded Key-Dependent Message Security.
    IACR Cryptology ePrint Archive 2009, Volume 2009 (0) 2009
    Conference paper
    Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee.
    Inaccessible entropy.
    Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009 (0) 2009
    Conference paper
    Iftach Haitner, Thomas Holenstein.
    On the (Im)Possibility of Key Dependent Encryption.
    Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Iftach Haitner, Alon Rosen, Ronen Shaltiel.
    On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.
    Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel.
    Reducing Complexity Assumptions for Statistically-Hiding Commitment.
    J. Cryptology 2009, Volume 22 (0) 2009
    Journal article
    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. 2009, Volume 39 (0) 2009
    Conference paper
    Iftach Haitner.
    A Parallel Repetition Theorem for Any Interactive Argument.
    50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA 2009 (0) 2009
    Journal article
    Iftach Haitner, Thomas Holenstein.
    On the (Im)Possibility of Key Dependent Encryption.
    IACR Cryptology ePrint Archive 2008, Volume 2008 (0) 2008
    Conference paper
    Iftach Haitner, Jonathan J. Hoch, Gil Segev.
    A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
    Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. 2008 (0) 2008
    Conference paper
    Iftach Haitner.
    Semi-honest to Malicious Oblivious Transfer - The Black-Box Way.
    Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. 2008 (0) 2008
    Conference paper
    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, Volume 2007 (0) 2007
    Conference paper
    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, Volume 2007 (0) 2007
    Conference paper
    Iftach Haitner, Omer Reingold.
    A New Interactive Hashing Theorem.
    22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA 2007 (0) 2007
    Conference paper
    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.
    48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings 2007 (0) 2007
    Conference paper
    Iftach Haitner, Omer Reingold.
    Statistically-hiding commitment from any one-way function.
    Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007 2007 (0) 2007
    Conference paper
    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) 2007, Volume 14 (0) 2007
    Conference paper
    Iftach Haitner, Omer Reingold.
    Statistically-Hiding Commitment from Any One-Way Function.
    IACR Cryptology ePrint Archive 2006, Volume 2006 (0) 2006
    Conference paper
    Iftach Haitner, Danny Harnik, Omer Reingold.
    On the Power of the Randomized Iterate.
    Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Iftach Haitner, Danny Harnik, Omer Reingold.
    Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions.
    Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II 2006 (0) 2006
    Conference paper
    Iftach Haitner, Omer Reingold.
    A New Interactive Hashing Theorem.
    Electronic Colloquium on Computational Complexity (ECCC) 2006, Volume null (0) 2006
    Conference paper
    Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel.
    Reducing Complexity Assumptions for Statistically-Hiding Commitment.
    Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Iftach Haitner, Danny Harnik, Omer Reingold.
    On the Power of the Randomized Iterate
    Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null (0) 2005
    Journal article
    Iftach Haitner, Ronen Shaltiel.
    Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions.
    IACR Cryptology ePrint Archive 2004, Volume 2004 (0) 2004
    Conference paper
    Iftach Haitner.
    Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations.
    Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Iftach Haitner, Ronen Shaltiel.
    Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Show item 1 to 65 of 65  

    Your query returned 65 matches in the database.