On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols
(si apre in una nuova finestra)
Autori:
Ohad Klein, Ilan Komargodski, Chenzhi Zhu
Pubblicato in:
Lecture Notes in Computer Science, Theory of Cryptography, 2024
Editore:
Springer Nature Switzerland
DOI:
10.1007/978-3-031-78011-0_13
MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM
(si apre in una nuova finestra)
Autori:
Gilad Asharov, Eliran Eiluz, Ilan Komargodski, Wei-Kai Lin
Pubblicato in:
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025
Editore:
ACM
DOI:
10.1145/3719027.3765159
Sub-linear Secure Broadcast and Applications
(si apre in una nuova finestra)
Autori:
Yuval Gelles, Ilan Komargodski, Merav Parter
Pubblicato in:
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026, ISSN 0737-8017
Editore:
ACM
DOI:
10.1145/3798129.3800870
A New Approach for LPN-Based Pseudorandom Functions: Low-Depth and Key-Homomorphic
(si apre in una nuova finestra)
Autori:
Youlong Ding, Aayush Jain, Ilan Komargodski
Pubblicato in:
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025
Editore:
ACM
DOI:
10.1145/3717823.3718210
Improved Rate for Non-Malleable Codes and Time-Lock Puzzles
(si apre in una nuova finestra)
Autori:
Cody Freitag; Ilan Komargodski; Manu Kondapaneni; Jad Silbak
Pubblicato in:
17th Innovations in Theoretical Computer Science Conference (ITCS 2026), Leibniz International Proceedings in Informatics (LIPIcs), 2026
Editore:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI:
10.4230/LIPICS.ITCS.2026.62
Offline-Online Indifferentiability of Cryptographic Systems
(si apre in una nuova finestra)
Autori:
Ashrujit Ghoshal, Ilan Komargodski, Gil Segev
Pubblicato in:
Lecture Notes in Computer Science, Theory of Cryptography, 2025
Editore:
Springer Nature Switzerland
DOI:
10.1007/978-3-032-12293-3_1
