( en | de | ru )

 

Disambiguation of "Komargodski, Ilan"

Author of the publication

copydeleteadd this publication to your clipboard
Communication with Contextual Uncertainty.

, , , and . SODA, page 2072-2085. SIAM, (2016)

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

On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing., and . Comput. Complex., 32 (2): 9 (December 2023)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)Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions., , and . CRYPTO (3), volume 13509 of Lecture Notes in Computer Science, page 131-160. Springer, (2022)Average-case lower bounds for formula size., and . STOC, page 171-180. ACM, (2013)White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing., , and . FOCS, page 622-632. IEEE Computer Society, (2017)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)Threshold Secret Sharing Requires a Linear Size Alphabet., , and . TCC (B2), volume 9986 of Lecture Notes in Computer Science, page 471-484. (2016)Distributional Collision Resistance Beyond One-Way Functions., , , and . CoRR, (2021)