default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharlotte Lefevre
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j5]Charlotte Lefevre, Mario Marhuenda Beltrán
, Bart Mennink:
To Pad or Not to Pad? Padding-Free Arithmetization-Oriented Sponges. IACR Trans. Symmetric Cryptol. 2025(1): 97-137 (2025)- [j4]Charlotte Lefevre, Bart Mennink:
SoK: Security of the Ascon Modes. IACR Trans. Symmetric Cryptol. 2025(1): 138-210 (2025) - 2024
- [j3]Charlotte Lefevre, Bart Mennink:
Permutation-Based Hashing Beyond the Birthday Bound. IACR Trans. Symmetric Cryptol. 2024(1): 71-113 (2024) - [j2]Charlotte Lefevre, Bart Mennink:
Permutation-Based Hash Chains with Application to Password Hashing. IACR Trans. Symmetric Cryptol. 2024(4): 249-286 (2024) - [c3]Charlotte Lefevre, Bart Mennink:
Generic Security of the Ascon Mode: On the Power of Key Blinding. SAC (2) 2024: 3-32 - [i9]Charlotte Lefevre:
A Note on Adversarial Online Complexity in Security Proofs of Duplex-Based Authenticated Encryption Modes. IACR Cryptol. ePrint Arch. 2024: 213 (2024) - [i8]Charlotte Lefevre, Bart Mennink:
Permutation-Based Hashing Beyond the Birthday Bound. IACR Cryptol. ePrint Arch. 2024: 407 (2024) - [i7]Charlotte Lefevre, Bart Mennink:
Permutation-Based Hash Chains with Application to Password Hashing. IACR Cryptol. ePrint Arch. 2024: 557 (2024) - [i6]Charlotte Lefevre, Bart Mennink:
SoK: Security of the Ascon Modes. IACR Cryptol. ePrint Arch. 2024: 1969 (2024) - 2023
- [j1]Charlotte Lefevre:
Indifferentiability of the Sponge Construction with a Restricted Number of Message Blocks. IACR Trans. Symmetric Cryptol. 2023(1): 224-243 (2023) - [i5]Charlotte Lefevre:
Indifferentiability of the Sponge Construction with a Restricted Number of Message Blocks. IACR Cryptol. ePrint Arch. 2023: 217 (2023) - [i4]Bart Mennink, Charlotte Lefevre:
Generic Security of the Ascon Mode: On the Power of Key Blinding. IACR Cryptol. ePrint Arch. 2023: 796 (2023) - [i3]Charlotte Lefevre, Yanis Belkheyar, Joan Daemen:
Kirby: A Robust Permutation-Based PRF Construction. IACR Cryptol. ePrint Arch. 2023: 1520 (2023) - 2022
- [c2]Charlotte Lefevre, Bart Mennink:
Tight Preimage Resistance of the Sponge Construction. CRYPTO (4) 2022: 185-204 - [c1]Pierre Karpman, Charlotte Lefevre:
Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes. Public Key Cryptography (1) 2022: 82-111 - [i2]Pierre Karpman, Charlotte Lefevre:
Time-Memory tradeoffs for large-weight syndrome decoding in ternary codes. IACR Cryptol. ePrint Arch. 2022: 128 (2022) - [i1]Charlotte Lefevre, Bart Mennink:
Tight Preimage Resistance of the Sponge Construction. IACR Cryptol. ePrint Arch. 2022: 734 (2022)
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 2025-05-03 00:06 CEST 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:
