Skip to main content

Foundations of Cryptographic Hardness

Searching for OpenAIRE data...

Publications

The Many Entropies in One-Way Functions

Author(s): Iftach Haitner, Salil Vadhan
Published in: Tutorials on the Foundations of Cryptography, 2017, Page(s) 159-217
DOI: 10.1007/978-3-319-57048-8_4

Characterization of Secure Multiparty Computation Without Broadcast

Author(s): Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Published in: Theory of Cryptography, 2016, Page(s) 596-616
DOI: 10.1007/978-3-662-49096-9_25

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

Author(s): Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Published in: ECCC - Electronic Colloquium on Computational Complexity, 2017

On the Communication Complexity of Key-Agreement Protocols

Author(s): Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
Published in: Electronic Colloquium on Computational Complexity (ECCC), Issue 25: 31 (2018), 2018, ISSN 1433-8092

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

Author(s): Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017, Page(s) 2580-2600
DOI: 10.1137/1.9781611974782.170

Characterization of Secure Multiparty Computation Without Broadcast

Author(s): Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Published in: Journal of Cryptology, 2017, ISSN 0933-2790
DOI: 10.1007/s00145-017-9264-x