Iftach Haitner

According to our database1, Iftach Haitner authored at least 47 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Hardness-Preserving Reductions via Cuckoo Hashing.
J. Cryptology, 2019

From Fairness to Full Security in Multiparty Computation.
IACR Cryptology ePrint Archive, 2019

On the Round Complexity of Randomized Byzantine Agreement.
IACR Cryptology ePrint Archive, 2019

Distributional Collision Resistance Beyond One-Way Functions.
IACR Cryptology ePrint Archive, 2019

Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.
Electronic Colloquium on Computational Complexity (ECCC), 2019

A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments.
Electronic Colloquium on Computational Complexity (ECCC), 2019

2018
Characterization of Secure Multiparty Computation Without Broadcast.
J. Cryptology, 2018

Coin Flipping of Any Constant Bias Implies One-Way Functions.
J. ACM, 2018

Computational Two-Party Correlation.
Electronic Colloquium on Computational Complexity (ECCC), 2018

On the Communication Complexity of Key-Agreement Protocols.
Electronic Colloquium on Computational Complexity (ECCC), 2018

On the Complexity of Fair Coin Flipping.
Electronic Colloquium on Computational Complexity (ECCC), 2018

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol.
SIAM J. Comput., 2017

The Many Entropies in One-Way Functions.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Fair Coin Flipping: Tighter Analysis and the Many-Party Case.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

The Many Entropies in One-Way Functions.
Proceedings of the Tutorials on the Foundations of Cryptography., 2017

2016
Limits on the Usefulness of Random Oracles.
J. Cryptology, 2016

2015
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments.
SIAM J. Comput., 2015

From Non-adaptive to Adaptive Pseudorandom Functions.
J. Cryptology, 2015

Coin Flipping of Any Constant Bias Implies One-Way Functions.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Parallel Hashing via List Recoverability.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Coin Flipping with Constant Bias Implies One-Way Functions.
SIAM J. Comput., 2014

A New Interactive Hashing Theorem.
J. Cryptology, 2014

2012
On the Power of Random Oracles.
Electronic Colloquium on Computational Complexity (ECCC), 2012

On the Instantiability of Hash-and-Sign RSA Signatures.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

2011
On the (In)Security of RSA Signatures.
IACR Cryptology ePrint Archive, 2011

2010
Black-Box Constructions of Protocols for Secure Computation.
IACR Cryptology ePrint Archive, 2010

Universal One-Way Hash Functions via Inaccessible Entropy.
IACR Cryptology ePrint Archive, 2010

Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions.
Electronic Colloquium on Computational Complexity (ECCC), 2010

A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.
Electronic Colloquium on Computational Complexity (ECCC), 2010

2009
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function.
SIAM J. Comput., 2009

Reducing Complexity Assumptions for Statistically-Hiding Commitment.
J. Cryptology, 2009

Bounded Key-Dependent Message Security.
IACR Cryptology ePrint Archive, 2009

Inaccessible Entropy.
Electronic Colloquium on Computational Complexity (ECCC), 2009

A Parallel Repetition Theorem for Any Interactive Argument.
Electronic Colloquium on Computational Complexity (ECCC), 2009

On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

2008
On the (Im)Possibility of Key Dependent Encryption.
IACR Cryptology ePrint Archive, 2008

Semi-honest to Malicious Oblivious Transfer - The Black-Box Way.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

2007
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
IACR Cryptology ePrint Archive, 2007

Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
Electronic Colloquium on Computational Complexity (ECCC), 2007

2006
Statistically-Hiding Commitment from Any One-Way Function.
IACR Cryptology ePrint Archive, 2006

Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
On the Power of the Randomized Iterate
Electronic Colloquium on Computational Complexity (ECCC), 2005

2004
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions
Electronic Colloquium on Computational Complexity (ECCC), 2004

Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004


  Loading...