default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElena Andreeva 0001
Person information
- affiliation: Technical University of Vienna, Austria
- affiliation (former): Alpen-Adria University, Klagenfurt, Austria
- affiliation (former): Technical University of Denmark, DTU Compute, Kongens Lyngby, Denmark
- affiliation (former, PhD 2010): Katholieke Universiteit Leuven, Department of Electrical Engineering, Belgium
Other persons with the same name
- Elena Andreeva 0002 — National Research University, Nizhny Novgorod, Russia
- Elena Andreeva 0003 — Petrozavodsk State University, Russia
- Elena Andreeva 0004 — Moscow State University, Russia
- Elena Andreeva 0005 — Smart Engines Service LLC, Moscow, Russia
Other persons with a similar name
- Elena I. Andreeva — Bonch-Bruevich Saint-Petersburg State University of Telecommunications, Russia
- Elena S. Andreeva — University of Moscow, Department of Physics, Russia
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Samir Hodzic
, Arnab Roy, Elena Andreeva:
Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks. Des. Codes Cryptogr. 92(2): 227-257 (2024)- [j8]Elena Andreeva, Andrey Bogdanov, Nilanjan Datta, Atul Luykx, Bart Mennink, Mridul Nandi, Elmar Tischhauser, Kan Yasuda:
The COLM Authenticated Encryption Scheme. J. Cryptol. 37(2): 15 (2024) - [c30]Elena Andreeva, Benoît Cogliati, Virginie Lallemand, Marine Minier, Antoon Purnal, Arnab Roy:
Masked Iterate-Fork-Iterate: A New Design Paradigm for Tweakable Expanding Pseudorandom Function. ACNS (2) 2024: 433-459 - [c29]Amit Singh Bhati, Antonin Dufka, Elena Andreeva, Arnab Roy, Bart Preneel:
Skye: An Expanding PRF based Fast KDF and its Applications. AsiaCCS 2024 - [c28]Elena Andreeva, Rishiraj Bhattacharyya, Arnab Roy, Stefano Trevisani:
On Efficient and Secure Compression Functions for Arithmetization-Oriented Hashing. CSF 2024: 1-16 - [c27]Amit Singh Bhati, Elena Andreeva, Damian Vizár:
OAE-RUP: A Strong Online AEAD Security Notion and Its Application to SAEF. SCN (2) 2024: 117-139 - [i30]Elena Andreeva, Rishiraj Bhattacharyya, Arnab Roy, Stefano Trevisani:
On Efficient and Secure Compression Modes for Arithmetization-Oriented Hashing. IACR Cryptol. ePrint Arch. 2024: 47 (2024) - [i29]Amit Singh Bhati, Michiel Verbauwhede, Elena Andreeva:
Breaking, Repairing and Enhancing XCBv2 into the Tweakable Enciphering Mode GEM. IACR Cryptol. ePrint Arch. 2024: 1554 (2024) - 2023
- [c26]Elena Andreeva, Andreas Weninger:
A Forkcipher-Based Pseudo-Random Number Generator. ACNS 2023: 3-31 - [c25]Amit Singh Bhati, Erik Pohle, Aysajan Abidin, Elena Andreeva, Bart Preneel:
Let's Go Eevee! A Friendly and Suitable Family of AEAD Modes for IoT-to-Cloud Secure Computation. CCS 2023: 2546-2560 - [i28]Amit Singh Bhati, Antonin Dufka, Elena Andreeva, Arnab Roy, Bart Preneel:
Skye: A Fast KDF based on Expanding PRF and its Application to Signal. IACR Cryptol. ePrint Arch. 2023: 781 (2023) - [i27]Amit Singh Bhati, Erik Pohle, Aysajan Abidin, Elena Andreeva, Bart Preneel:
Let's Go Eevee! A Friendly and Suitable Family of AEAD Modes for IoT-to-Cloud Secure Computation. IACR Cryptol. ePrint Arch. 2023: 1361 (2023) - 2022
- [i26]Samir Hodzic, Arnab Roy, Elena Andreeva:
Quantum Cryptanalysis of Farfalle and (Generalised) Feistel Network. CoRR abs/2203.12018 (2022) - [i25]Elena Andreeva, Benoit Cogliati, Virginie Lallemand, Marine Minier, Antoon Purnal, Arnab Roy:
Masked Iterate-Fork-Iterate: A new Design Paradigm for Tweakable Expanding Pseudorandom Function. IACR Cryptol. ePrint Arch. 2022: 1534 (2022) - 2021
- [j7]Elena Andreeva, Amit Singh Bhati, Bart Preneel, Damian Vizár:
1, 2, 3, Fork: Counter Mode Variants based on a Generalized Forkcipher. IACR Trans. Symmetric Cryptol. 2021(3): 1-35 (2021) - [c24]Elena Andreeva, Rishiraj Bhattacharyya, Arnab Roy:
Compactness of Hashing Modes and Efficiency Beyond Merkle Tree. EUROCRYPT (2) 2021: 92-123 - [i24]Elena Andreeva, Rishiraj Bhattacharyya, Arnab Roy:
Compactness of Hashing Modes and Efficiency beyond Merkle Tree. CoRR abs/2104.15055 (2021) - [i23]Elena Andreeva, Amit Singh Bhati, Damian Vizár:
RUP Security of the SAEF Authenticated Encryption mode. IACR Cryptol. ePrint Arch. 2021: 103 (2021) - [i22]Arnab Roy, Elena Andreeva, Jan Ferdinand Sauer:
Interpolation Cryptanalysis of Unbalanced Feistel Networks with Low Degree Round Functions. IACR Cryptol. ePrint Arch. 2021: 367 (2021) - [i21]Elena Andreeva, Rishiraj Bhattacharyya, Arnab Roy:
Compactness of Hashing Modes and Efficiency beyond Merkle Tree. IACR Cryptol. ePrint Arch. 2021: 573 (2021) - [i20]Elena Andreeva, Amit Singh Bhati, Bart Preneel, Damian Vizár:
1, 2, 3, Fork: Counter Mode Variants based on a Generalized Forkcipher. IACR Cryptol. ePrint Arch. 2021: 1154 (2021) - 2020
- [c23]Arne Deprez, Elena Andreeva, Jose Maria Bermudo Mera, Angshuman Karmakar, Antoon Purnal:
Optimized Software Implementations for the Lightweight Encryption Scheme ForkAE. CARDIS 2020: 68-83 - [c22]Arnab Roy, Elena Andreeva, Jan Ferdinand Sauer:
Interpolation Cryptanalysis of Unbalanced Feistel Networks with Low Degree Round Functions. SAC 2020: 273-300 - [c21]Elena Andreeva, Amit Singh Bhati, Damian Vizár:
Nonce-Misuse Security of the SAEF Authenticated Encryption Mode. SAC 2020: 512-534 - [i19]Arne Deprez, Elena Andreeva, Jose Maria Bermudo Mera, Angshuman Karmakar, Antoon Purnal:
Optimized Software Implementations for theLightweight Encryption Scheme ForkAE. IACR Cryptol. ePrint Arch. 2020: 1295 (2020) - [i18]Elena Andreeva, Amit Singh Bhati, Damian Vizár:
Nonce-Misuse Security of the SAEF Authenticated Encryption mode. IACR Cryptol. ePrint Arch. 2020: 1524 (2020)
2010 – 2019
- 2019
- [c20]Elena Andreeva, Virginie Lallemand, Antoon Purnal, Reza Reyhanitabar, Arnab Roy, Damian Vizár:
Forkcipher: A New Primitive for Authenticated Encryption of Very Short Messages. ASIACRYPT (2) 2019: 153-182 - [i17]Elena Andreeva, Virginie Lallemand, Antoon Purnal, Reza Reyhanitabar, Arnab Roy, Damian Vizár:
Forkcipher: a New Primitive for Authenticated Encryption of Very Short Messages. IACR Cryptol. ePrint Arch. 2019: 1004 (2019) - 2018
- [i16]Elena Andreeva, Reza Reyhanitabar, Kerem Varici, Damian Vizár:
Forking a Blockcipher for Authenticated Encryption of Very Short Messages. IACR Cryptol. ePrint Arch. 2018: 916 (2018) - 2017
- [j6]Elena Andreeva, Guy Barwell, Ritam Bhaumik, Mridul Nandi, Dan Page, Martijn Stam:
Turning Online Ciphers Off. IACR Trans. Symmetric Cryptol. 2017(2): 105-142 (2017) - [i15]Fatemeh Shirazi, Elena Andreeva, Markulf Kohlweiss, Claudia Díaz:
Multiparty Routing: Secure Routing for Mixnets. CoRR abs/1708.03387 (2017) - 2016
- [j5]Elena Andreeva, Charles Bouillaguet, Orr Dunkelman, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer:
New Second-Preimage Attacks on Hash Functions. J. Cryptol. 29(4): 657-696 (2016) - 2015
- [j4]Elena Andreeva, Bart Mennink, Bart Preneel:
Open problems in hash function security. Des. Codes Cryptogr. 77(2-3): 611-631 (2015) - [c19]Elena Andreeva, Joan Daemen, Bart Mennink, Gilles Van Assche:
Security of Keyed Sponge Constructions Using a Modular Proof Approach. FSE 2015: 364-384 - [c18]Willem Schroé, Bart Mennink, Elena Andreeva, Bart Preneel:
Forgery and Subkey Recovery on CAESAR Candidate iFeed. SAC 2015: 197-204 - [i14]Elena Andreeva, Andrey Bogdanov, Bart Mennink:
Towards Understanding the Known-Key Security of Block Ciphers. IACR Cryptol. ePrint Arch. 2015: 222 (2015) - [i13]Elena Andreeva, Guy Barwell, Dan Page, Martijn Stam:
Turning Online Ciphers Off. IACR Cryptol. ePrint Arch. 2015: 485 (2015) - 2014
- [c17]Elena Andreeva, Andrey Bogdanov, Atul Luykx, Bart Mennink, Nicky Mouha, Kan Yasuda:
How to Securely Release Unverified Plaintext in Authenticated Encryption. ASIACRYPT (1) 2014: 105-125 - [c16]Elena Andreeva, Begül Bilgin, Andrey Bogdanov, Atul Luykx, Bart Mennink, Nicky Mouha, Kan Yasuda:
APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography. FSE 2014: 168-186 - [c15]Elena Andreeva, Atul Luykx, Bart Mennink, Kan Yasuda:
COBRA: A Parallelizable Authenticated Online Cipher Without Block Cipher Inverse. FSE 2014: 187-204 - [i12]Elena Andreeva, Andrey Bogdanov, Atul Luykx, Bart Mennink, Nicky Mouha, Kan Yasuda:
How to Securely Release Unverified Plaintext in Authenticated Encryption. IACR Cryptol. ePrint Arch. 2014: 144 (2014) - 2013
- [c14]Elena Andreeva, Andrey Bogdanov, Atul Luykx, Bart Mennink, Elmar Tischhauser, Kan Yasuda:
Parallelizable and Authenticated Online Ciphers. ASIACRYPT (1) 2013: 424-443 - [c13]Elena Andreeva, Andrey Bogdanov, Yevgeniy Dodis, Bart Mennink, John P. Steinberger:
On the Indifferentiability of Key-Alternating Ciphers. CRYPTO (1) 2013: 531-550 - [c12]Elena Andreeva, Andrey Bogdanov, Bart Mennink:
Towards Understanding the Known-Key Security of Block Ciphers. FSE 2013: 348-366 - [i11]Elena Andreeva, Andrey Bogdanov, Yevgeniy Dodis, Bart Mennink, John P. Steinberger:
On the Indifferentiability of Key-Alternating Ciphers. IACR Cryptol. ePrint Arch. 2013: 61 (2013) - [i10]Elena Andreeva, Andrey Bogdanov, Atul Luykx, Bart Mennink, Elmar Tischhauser, Kan Yasuda:
Parallelizable and Authenticated Online Ciphers. IACR Cryptol. ePrint Arch. 2013: 790 (2013) - [i9]Elena Andreeva, Begül Bilgin, Andrey Bogdanov, Atul Luykx, Bart Mennink, Nicky Mouha, Kan Yasuda:
APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography. IACR Cryptol. ePrint Arch. 2013: 791 (2013) - 2012
- [j3]Elena Andreeva, Andrey Bogdanov, Bart Mennink, Bart Preneel, Christian Rechberger:
On security arguments of the second round SHA-3 candidates. Int. J. Inf. Sec. 11(2): 103-120 (2012) - [j2]Elena Andreeva, Bart Mennink, Bart Preneel:
The parazoa family: generalizing the sponge hash functions. Int. J. Inf. Sec. 11(3): 149-165 (2012) - [c11]Elena Andreeva, Bart Mennink, Bart Preneel, Marjan Skrobot:
Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein. AFRICACRYPT 2012: 287-305 - [c10]Elena Andreeva, Atul Luykx, Bart Mennink:
Provable Security of BLAKE with Non-ideal Compression Function. Selected Areas in Cryptography 2012: 321-338 - [i8]Elena Andreeva, Andrey Bogdanov, Bart Mennink, Bart Preneel, Christian Rechberger:
On Security Arguments of the Second Round SHA-3 Candidates. IACR Cryptol. ePrint Arch. 2012: 147 (2012) - [i7]Atul Luykx, Elena Andreeva, Bart Mennink, Bart Preneel:
Impossibility Results for Indifferentiability with Resets. IACR Cryptol. ePrint Arch. 2012: 644 (2012) - 2011
- [c9]Elena Andreeva, Martijn Stam:
The Symbiosis between Collision and Preimage Resistance. IMACC 2011: 152-171 - [c8]Elena Andreeva, Bart Mennink:
Provable Chosen-Target-Forced-Midfix Preimage Resistance. Selected Areas in Cryptography 2011: 37-54 - [i6]Elena Andreeva, Bart Mennink, Bart Preneel:
The Parazoa Family: Generalizing the Sponge Hash Functions. IACR Cryptol. ePrint Arch. 2011: 28 (2011) - [i5]Elena Andreeva, Atul Luykx, Bart Mennink:
Provable Security of BLAKE with Non-Ideal Compression Function. IACR Cryptol. ePrint Arch. 2011: 620 (2011) - 2010
- [j1]Elena Andreeva, Bart Mennink, Bart Preneel:
Security Properties of Domain Extenders for Cryptographic Hash Functions. J. Inf. Process. Syst. 6(4): 453-480 (2010) - [c7]Elena Andreeva, Bart Mennink, Bart Preneel:
Security Reductions of the Second Round SHA-3 Candidates. ISC 2010: 39-53 - [c6]Elena Andreeva, Bart Mennink, Bart Preneel:
On the Indifferentiability of the Grøstl Hash Function. SCN 2010: 88-105 - [i4]Elena Andreeva, Bart Mennink, Bart Preneel:
On the Indifferentiability of the Gröstl Hash Function. IACR Cryptol. ePrint Arch. 2010: 298 (2010) - [i3]Elena Andreeva, Bart Mennink, Bart Preneel:
Security Reductions of the Second Round SHA-3 Candidates. IACR Cryptol. ePrint Arch. 2010: 381 (2010)
2000 – 2009
- 2009
- [c5]Elena Andreeva, Charles Bouillaguet, Orr Dunkelman, John Kelsey:
Herding, Second Preimage and Trojan Message Attacks beyond Merkle-Damgård. Selected Areas in Cryptography 2009: 393-414 - [i2]Sebastiaan Indesteege, Elena Andreeva, Christophe De Cannière, Orr Dunkelman, Emilia Käsper, Svetla Nikova, Bart Preneel, Elmar Tischhauser:
The Lane hash function. Symmetric Cryptography 2009 - 2008
- [c4]Elena Andreeva, Charles Bouillaguet, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer:
Second Preimage Attacks on Dithered Hash Functions. EUROCRYPT 2008: 270-288 - [c3]Elena Andreeva, Bart Preneel:
A Three-Property-Secure Hash Function. Selected Areas in Cryptography 2008: 228-244 - 2007
- [c2]Elena Andreeva, Gregory Neven, Bart Preneel, Thomas Shrimpton:
Seven-Property-Preserving Iterated Hashing: ROX. ASIACRYPT 2007: 130-146 - [i1]Elena Andreeva, Gregory Neven, Bart Preneel, Thomas Shrimpton:
Seven-Property-Preserving Iterated Hashing: ROX. IACR Cryptol. ePrint Arch. 2007: 176 (2007) - 2006
- [c1]Ammar Alkassar, Elena Andreeva, Helger Lipmaa:
SLC: Efficient Authenticated Encryption for Short Packages. Sicherheit 2006: 270-278
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
