Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Emanuele Strieder

dblp:270/7231 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0003-0204-3234ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 70% Hardware security and side channels · 30%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based key encapsulation
kyber
0.812024
The Insecurity of Masked Comparisons: SCAs on ML-KEM's FO-Transform · CCS 2024
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.812024
The Insecurity of Masked Comparisons: SCAs on ML-KEM's FO-Transform · CCS 2024
Hardware security and side channels
side-channel attack
0.812024
The Insecurity of Masked Comparisons: SCAs on ML-KEM's FO-Transform · CCS 2024
Cryptographic primitives and cryptanalysis › cryptographic transformations
fujisaki-okamoto transform
0.212024
The Insecurity of Masked Comparisons: SCAs on ML-KEM's FO-Transform · CCS 2024

Methods — techniques the papers use, named apart from their topics

t-probing model · 0.8higher-order masking · 0.8
YearPublicationVenuePosition
2024 The Insecurity of Masked Comparisons: SCAs on ML-KEM's FO-Transform
abstract
NIST released the draft standard for ML-KEM, and we can expect its widespread use in the embedded world in the near future. Several side-channel attacks have been proposed, and one line of research has focused on attacks against the comparison step of the FO-transform. A work published at TCHES 2022 stressed the need for secure higher-order masked comparisons beyond the t-probing model and proposed a higher-order masked comparison method. Subsequently, D'Anvers, Van Beirendonck, and Verbauwhede improved upon the performance of several previous proposals; their higher-order masked algorithm currently achieves the highest performance for masked comparisons.
Julius Hermelink, Kai-Chun Ning, Richard Petri 0001, Emanuele Strieder
CCS4
2023 Faulting Winternitz One-Time Signatures to Forge LMS, XMSS, or SPHINCS+ Signatures
Alexander Wagner, Vera Wesselkamp, Felix Oberhansl, Marc Schink, Emanuele Strieder
PQCrypto5