Hi, my name is Elena Andreeva
I am a tenure-track Assistant Professor in the Security and Privacy Research Unit at TU Wien, Austria. Previously, I was an Assistant Prof. at DTU, Denmark and a Lecturer at the University of Klagenfurt, Austria. I was also a Research Expert at COSIC, KU Leuven, Belgium. My postdoc. and doc. research was funded by grants from the Flemish Research Foundation. My PhD was supervised by prof. Bart Preneel at COSIC, Belgium. I hold a Master’s degree in CS from the University of Saarland, Germany.
My research focuses on theory and applications of cryptography related to symmetric authenticated encryption, block ciphers and forkciphers, hash functions, privacy-friendly protocols, and blockchains. I am interested in theoretical foundations and practical cryptographic algorithms for secure data communications, storage and private computation.
News
Our paper on attacks on the XCBv1 and XCBv2 IEEE 1619.2 standards for encryption of sector-oriented storage media is accepted to CRYPTO 2025.
Our new family of MACs Sonikku with superior speed and state size compared to state-of-the-art TBC-based MACs and beyond-birthday-bound security is accepted to ArcticCrypt 2025.
Our paper on efficient modes for algebraic hashing is accepted at IEEE CSF 2024.
Our paper on a new KDF and its application to Signal (like) protocol(s) is accepted at ACM ASIACCS 2024.
Our paper on strong OAE-RUP notions and its application to the SAEF forkcipher-based AEAD mode was accepted at SCN, 2024.
Our paper on a new expanding PRF Butterknife and its application is accepted at ACNS 2024.
Professional Activities
Program committees 2025, 2024: CT-RSA 2025, CiC 2025, ACNS 2025, USENIX 2024, ASIACRYPT 2024, ToSC tool evaluation 2024, Provsec 2024, Africacrypt 2024
Cryptographic designs
GEM: n-bit (beyond birthday bound) secure tweakable enciphering mode with efficient AES-based instances KohiNoor and DaryaiNoor.
Skye: efficient and secure key derivation function, well suited for Signal-style KDF applications.
ABR tree hashing: optimally efficient collision secure tree hash function.
Forkcipher: input expanding symmetric primitive. The ForkSkinny (n-to-2n) forkcipher in authenticated encryption modes is selected to Round 2 in the NIST lightweight AEAD competition.
ButterKnife: n-to-8n-bit expanding function based on AES and used in SAFE and ZAFE n-bit secure and highly efficient deterministic AE.
COLM: the development of AES-COPA AEAD and a one of the winners in the defense-in-depth category of the CAESAR AEAD competition.
PRIMATEs: lightweight AEAD family {APE, Hanuman, Gibbon} and selected to Round 2 in the CAESAR AEAD competition.