Foundations of Cryptographic Hardness

Lower Bounds on the Time/Memory Tradeoff of Function Inversion

Auteurs: Dror Chawin,Iftach Haitner,Noam Mazor
Publié dans: Theory of Cryptography - 18th International Conference, {TCC}, 2020, Page(s) 305--334
Éditeur: Springer

On the Round Complexity of the Shuffle Model

Auteurs: Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
Publié dans: Theory of Cryptography - 18th International Conference, {TCC}, 2020, Page(s) 683--712
Éditeur: Springer

On the Complexity of Fair Coin Flipping

Auteurs: Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Publié dans: Theory of Cryptography - 16th International Conference, {TCC}, 2018, Page(s) 539--562
Éditeur: Springer

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

Auteurs: Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
Publié dans: Theory of Cryptography - 17th International Conference, {TCC}, 2019, Page(s) 531--560
Éditeur: Springer

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

Auteurs: Itay Berman, Iftach Haitner, Eliad Tsfadia
Publié dans: Advances in Cryptology - {CRYPTO}, 2020, Page(s) 544--573
Éditeur: Springer

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

Auteurs: Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Publié dans: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science, 2018, Page(s) 838-849, ISBN 978-1-5386-4230-6
Éditeur: IEEE
DOI: 10.1109/focs.2018.00084

On the Communication Complexity of Key-Agreement Protocols

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

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

Auteurs: Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
Publié dans: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017, Page(s) 2580-2600, ISBN 978-1-61197-478-2
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611974782.170

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

Auteurs: Iftach Haitner, Yonatan Karidi-Heller
Publié dans: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Page(s) 1268-1276, ISBN 978-1-7281-9621-3
Éditeur: IEEE
DOI: 10.1109/focs46700.2020.00120

On the Round Complexity of Randomized Byzantine Agreement

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

Distributional Collision Resistance Beyond One-Way Functions

Auteurs: Nir Bitansky,Iftach Haitner,Ilan Komargodski,Eylon Yogev
Publié dans: Advances in Cryptology - {EUROCRYPT}, 2019, Page(s) 667--695
Éditeur: Springer

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

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

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

Auteurs: Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
Publié dans: SIAM Journal on Computing, Numéro 49/6, 2020, Page(s) 1041-1082, ISSN 0097-5397
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1236837

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

Auteurs: Iftach Haitner, Eliad Tsfadia
Publié dans: SIAM Journal on Computing, Numéro 46/2, 2017, Page(s) 479-542, ISSN 0097-5397
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/15m1009147

Hardness-Preserving Reductions via Cuckoo Hashing

Auteurs: Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
Publié dans: Journal of Cryptology, Numéro 32/2, 2019, Page(s) 361-392, ISSN 0933-2790
Éditeur: 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

Auteurs: Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
Publié dans: SIAM Journal on Computing, Numéro 44/1, 2015, Page(s) 193-242, ISSN 0097-5397
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/130938438

Coin Flipping of Any Constant Bias Implies One-Way Functions

Auteurs: Itay Berman, Iftach Haitner, Aris Tentes
Publié dans: Journal of the ACM, Numéro 65/3, 2018, Page(s) 1-95, ISSN 0004-5411
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/2979676

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

Auteurs: Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil Vadhan, Hoeteck Wee
Publié dans: Theory of Computing, Numéro 16/1, 2020, Page(s) 1-55, ISSN 1557-2862
Éditeur: Theory of Computing
DOI: 10.4086/toc.2020.v016a008

Characterization of Secure Multiparty Computation Without Broadcast

Auteurs: Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Publié dans: Journal of Cryptology, 2017, ISSN 0933-2790
Éditeur: Springer Verlag
DOI: 10.1007/s00145-017-9264-x

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

Auteurs: Haitner, Iftach; Reingold, Omer; Vadhan, Salil; Wee, Hoeteck
Publié dans: arxiv, Numéro 1, 2020
Éditeur: arxiv

From Fairness to Full Security in Multiparty Computation

Auteurs: Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Publié dans: Security and Cryptography for Networks - 11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings, Numéro 11035, 2018, Page(s) 216-234, ISBN 978-3-319-98112-3
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-319-98113-0_12

The Many Entropies in One-Way Functions

Auteurs: Iftach Haitner, Salil Vadhan
Publié dans: Tutorials on the Foundations of Cryptography, 2017, Page(s) 159-217
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-319-57048-8_4

Characterization of Secure Multiparty Computation Without Broadcast

Auteurs: Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Publié dans: Theory of Cryptography, 2016, Page(s) 596-616, ISBN 978-3-662-49096-9
Éditeur: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-49096-9_25

Publications

Partager cette page

Télécharger