( en | de | ru )

 

Disambiguation of "Dodis, Yevgeniy"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Message Franking: From Invisible Salamanders to Encryptment.

, , , and . IACR Cryptology ePrint Archive, (2019)

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.

Yevgeniy Dodis

Yevgeniy Ivanisenko

Yevgeniy Leshch

Yevgeniy Temko

Yevgeniy Shapiro

 

Other publications of authors with the same name

Fuzzy Extractors: How to Generate Strong Keys from Biometrcis and Other Noisy Data, , , and . (2008)Extracting Randomness from Extractor-Dependent Sources., , and . EUROCRYPT (1), volume 12105 of Lecture Notes in Computer Science, page 313-342. Springer, (2020)Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited., , and . IACR Cryptol. ePrint Arch., (2021)Updatable Public Key Encryption in the Standard Model., , and . IACR Cryptol. ePrint Arch., (2022)Security with Functional Re-encryption from CPA., , and . TCC (2), volume 14370 of Lecture Notes in Computer Science, page 279-305. Springer, (2023)Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited., , and . EUROCRYPT (1), volume 14004 of Lecture Notes in Computer Science, page 86-116. Springer, (2023)T₅: Hashing Five Inputs with Three Compression Calls., , , and . ITC, volume 199 of LIPIcs, page 24:1-24:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Fuzzy extractors: How to generate string keys from biometrics and other noisy data., , and . In Proceedings of the International Conference on Advances in Cryptology (EUROCRYPT '04), Lecture Notes in Computer Science, Springer Verlag, (2004)The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol., , and . EUROCRYPT (1), volume 11476 of Lecture Notes in Computer Science, page 129-158. Springer, (2019)Non-Malleable Codes from Additive Combinatorics., , and . SIAM J. Comput., 47 (2): 524-546 (2018)