Elena Andreeva
Assistant Prof. / PhD
About
My research interests lie in the area of theory and applications of cryptography and more concretely in symmetric cryptography, authenticated encryption, forkciphers, hash functions, key derivation, provable security, privacy-friendly security protocols, and cryptography for blockchains. I am interested in theory and development of provably secure cryptographic designs for secure data communications, storage and private computation.
Roles
-
Assistant Professor
Security and Privacy, E192-06 -
On Leave
Security and Privacy, E192-06
Courses
2023S
- Bachelor Thesis / 192.061 / PR
- Project in Computer Science 1 / 192.075 / PR
- Project in Computer Science 2 / 192.076 / PR
- Scientific Research and Writing / 193.052 / SE
- Seminar for Master Students in Logic and Computation / 180.773 / SE
- Seminar for PhD Students / 192.060 / SE
Publications
Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.
- 1, 2, 3, Fork: Counter Mode Variants based on a Generalized Forkcipher / Andreeva, E., Bhati, A. S., Preneel, B., & Vizár, D. (2021). 1, 2, 3, Fork: Counter Mode Variants based on a Generalized Forkcipher. IACR Transactions on Symmetric Cryptology, 2021(3). https://doi.org/10.46586/tosc.v2021.i3.1-35
- Nonce-Misuse Security of the SAEF Authenticated Encryption Mode / Andreeva, E., Bhati, A. S., & Vizár, D. (2021). Nonce-Misuse Security of the SAEF Authenticated Encryption Mode. In Selected Areas in Cryptography (pp. 512–534). Springer LNCS. https://doi.org/10.1007/978-3-030-81652-0_20
- Optimized Software Implementations for the Lightweight Encryption Scheme ForkAE / Andreeva, E., Deprez, A., Bermudo Mera, J. M., Karmakar, A., & Purnal, A. (2021). Optimized Software Implementations for the Lightweight Encryption Scheme ForkAE. In Smart Card Research and Advanced Applications (pp. 68–83). Springer. https://doi.org/10.1007/978-3-030-68487-7_5
- Compactness of Hashing Modes and Efficiency Beyond Merkle Tree / Andreeva, E., Bhattacharyya, R., & Roy, A. (2021). Compactness of Hashing Modes and Efficiency Beyond Merkle Tree. In Lecture Notes in Computer Science (pp. 92–123). Springer. https://doi.org/10.1007/978-3-030-77886-6_4
- Interpolation Cryptanalysis of Unbalanced Feistel Networks with Low Degree Round Functions / Andreeva, E., Roy, A., & Sauer, J. F. (2021). Interpolation Cryptanalysis of Unbalanced Feistel Networks with Low Degree Round Functions. In Selected Areas in Cryptography (pp. 273–300). Springer LNCS. https://doi.org/10.1007/978-3-030-81652-0_11
- Forkcipher: A New Primitive for Authenticated Encryption of Very Short Messages / Andreeva, E., Lallemand, V., Purnal, A., Reyhanitabar, R., Roy, A., & Vizár, D. (2019). Forkcipher: A New Primitive for Authenticated Encryption of Very Short Messages. In Lecture Notes in Computer Science (pp. 153–182). Springer LNCS. https://doi.org/10.1007/978-3-030-34621-8_6
- Open problems in hash function security / Andreeva, E., Mennink, B., & Preneel, B. (2015). Open problems in hash function security. Designs, Codes and Cryptography, 77(2–3), 611–631. https://doi.org/10.1007/s10623-015-0096-0