Foundations of Cryptographic Hardness

Project Information

FOC

Grant agreement ID: 638121

DOI 10.3030/638121

Project closed

EC signature date 26 February 2015

Start date 1 March 2015

End date 28 February 2021

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost € 1 239 838,00

EU contribution € 1 239 838,00

Coordinated by

TEL AVIV UNIVERSITY
Israel

Publications

Conference proceedings (12)

Lower Bounds on the Time/Memory Tradeoff of Function Inversion

Author(s): Dror Chawin,Iftach Haitner,Noam Mazor
Published in: Theory of Cryptography - 18th International Conference, {TCC}, 2020, Page(s) 305--334
Publisher: Springer

On the Round Complexity of the Shuffle Model

Author(s): Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
Published in: Theory of Cryptography - 18th International Conference, {TCC}, 2020, Page(s) 683--712
Publisher: Springer

On the Complexity of Fair Coin Flipping

Author(s): Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Published in: Theory of Cryptography - 16th International Conference, {TCC}, 2018, Page(s) 539--562
Publisher: Springer

Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation

Author(s): Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
Published in: Theory of Cryptography - 17th International Conference, {TCC}, 2019, Page(s) 531--560
Publisher: Springer

A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence

Author(s): Itay Berman, Iftach Haitner, Eliad Tsfadia
Published in: Advances in Cryptology - {CRYPTO}, 2020, Page(s) 544--573
Publisher: Springer

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: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science, 2018, Page(s) 838-849, ISBN 978-1-5386-4230-6
Publisher: IEEE
DOI: 10.1109/focs.2018.00084

On the Communication Complexity of Key-Agreement Protocols

Author(s): Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
Published in: {10th Innovations in Theoretical Computer Science Conference, 2019, Page(s) 40:1--40:16, ISSN 1433-8092
Publisher: Hasso-Plattner-Institut für Softwaresystemtechnik GmbH
DOI: 10.4230/lipics.itcs.2019.40

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, ISBN 978-1-61197-478-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611974782.170

A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip

Author(s): Iftach Haitner, Yonatan Karidi-Heller
Published in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Page(s) 1268-1276, ISBN 978-1-7281-9621-3
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00120

On the Round Complexity of Randomized Byzantine Agreement

Author(s): Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
Published in: 33rd International Symposium on Distributed Computing, {DISC}, 2019, Page(s) 12:1--12:17
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"

Distributional Collision Resistance Beyond One-Way Functions

Author(s): Nir Bitansky,Iftach Haitner,Ilan Komargodski,Eylon Yogev
Published in: Advances in Cryptology - {EUROCRYPT}, 2019, Page(s) 667--695
Publisher: Springer

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols

Author(s): Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
Published in: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, Page(s) 136-147, ISBN 978-1-5386-4230-6
Publisher: IEEE
DOI: 10.1109/focs.2018.00022

Peer reviewed articles (7)

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols

Author(s): Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
Published in: SIAM Journal on Computing, Issue 49/6, 2020, Page(s) 1041-1082, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1236837

An Almost-Optimally Fair Three-Party Coin-Flipping Protocol

Author(s): Iftach Haitner, Eliad Tsfadia
Published in: SIAM Journal on Computing, Issue 46/2, 2017, Page(s) 479-542, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/15m1009147

Hardness-Preserving Reductions via Cuckoo Hashing

Author(s): Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
Published in: Journal of Cryptology, Issue 32/2, 2019, Page(s) 361-392, ISSN 0933-2790
Publisher: Springer Verlag
DOI: 10.1007/s00145-018-9293-0

Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

Author(s): Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
Published in: SIAM Journal on Computing, Issue 44/1, 2015, Page(s) 193-242, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/130938438

Coin Flipping of Any Constant Bias Implies One-Way Functions

Author(s): Itay Berman, Iftach Haitner, Aris Tentes
Published in: Journal of the ACM, Issue 65/3, 2018, Page(s) 1-95, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/2979676

Inaccessible Entropy {II:} {IE} Functions and Universal One-Way Hashing

Author(s): Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil Vadhan, Hoeteck Wee
Published in: Theory of Computing, Issue 16/1, 2020, Page(s) 1-55, ISSN 1557-2862
Publisher: Theory of Computing
DOI: 10.4086/toc.2020.v016a008

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
Publisher: Springer Verlag
DOI: 10.1007/s00145-017-9264-x

Other (1)

Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions

Author(s): Haitner, Iftach; Reingold, Omer; Vadhan, Salil; Wee, Hoeteck
Published in: arxiv, Issue 1, 2020
Publisher: arxiv

Book chapters (3)

From Fairness to Full Security in Multiparty Computation

Author(s): Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Published in: Security and Cryptography for Networks - 11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings, Issue 11035, 2018, Page(s) 216-234, ISBN 978-3-319-98112-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-98113-0_12

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
Publisher: Springer International Publishing
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, ISBN 978-3-662-49096-9
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-49096-9_25