( en | de | ru )

 

Disambiguation of "Komargodski, Ilan"

Author of the publication

copydeleteadd this publication to your clipboard
FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM.

, , and . CCS, page 3313-3327. ACM, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ilan Moradi

Dragutin Ilan i

Ilan Katz

Ilan Wolff

Ilan Golan

 

Other publications of authors with the same name

Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions., , and . TCC (2), volume 9015 of Lecture Notes in Computer Science, page 352-377. Springer, (2015)Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation., and . EUROCRYPT (1), volume 10820 of Lecture Notes in Computer Science, page 259-279. Springer, (2018)On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing., and . Comput. Complex., 32 (2): 9 (December 2023)Communication with Contextual Uncertainty., , , and . Comput. Complex., 27 (3): 463-509 (2018)Threshold Secret Sharing Requires a Linear-Size Alphabet., , and . Theory Comput., (2020)FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM., , and . CCS, page 3313-3327. ACM, (2023)Optimal Oblivious Parallel RAM., , , , and . SODA, page 2459-2521. SIAM, (2022)Instance Complexity and Unlabeled Certificates in the Decision Tree Model., , and . Electron. Colloquium Comput. Complex., (2019)Threshold Secret Sharing Requires a Linear Size Alphabet., , and . Electron. Colloquium Comput. Complex., (2016)Secret-Sharing for NP., , and . J. Cryptol., 30 (2): 444-469 (2017)