Demo Data from EDBT 2026 / reviewers in the wild / expert
Andrea Gangemi
dblp:323/4253
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0001-9689-8473ORCID · 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 protocols and secure computation · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
commitment schemes |
0.7 | 1 | 2023 | Non-interactive Commitment from Non-transitive Group Actions · ASIACRYPT (7) 2023 |
Cryptographic protocols and secure computation › commitment schemes
non-interactive commitments |
0.7 | 1 | 2023 | Non-interactive Commitment from Non-transitive Group Actions · ASIACRYPT (7) 2023 |
Methods — techniques the papers use, named apart from their topics
group actions · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Sneaking up the ranks: Partial key exposure attacks on rank-based schemesabstractAbstract A partial key exposure attack is a key recovery attack where an adversary obtains a priori partial knowledge of the secret key, e.g., through side-channel leakage. While for a long time post-quantum cryptosystems, unlike RSA, have been believed to be resistant to such attacks, recent results by Esser, May, Verbel, and Wen (CRYPTO ’22), and by Kirshanova and May (SCN ’22), have refuted this belief. In this work, we focus on partial key exposure attacks in the context of rank-metric-based schemes, particularly targeting the RYDE, MIRA, and MiRitH digital signatures schemes, which are active candidates in the NIST post-quantum cryptography standardization process. We demonstrate that, similar to the RSA case, the secret key in RYDE can be recovered from a constant fraction of its bits. Specifically, for NIST category I parameters, our attacks remain efficient even when less than 25% of the key material is leaked. Interestingly, our attacks lead to a natural improvement of the best generic attack on RYDE without partial knowledge , reducing security levels by up to 9 bits. For MIRA and MiRitH our attacks remain efficient as long as roughly 57–60% of the secret key material is leaked. Additionally, we initiate the study of partial exposure of the witness in constructions following the popular MPCitH (MPC-in-the-Head) paradigm. We show a generic reduction from recovering RYDE and MIRA’s witness to the MinRank problem, which again leads to efficient key recovery from constant fractions of the secret witness in both cases. Giuseppe D'Alconzo, Andre Esser 0001, Andrea Gangemi, Carlo Sanna |
Des. Codes Cryptogr. | 3 |
| 2023 | Non-interactive Commitment from Non-transitive Group Actions
Giuseppe D'Alconzo, Andrea Flamini, Andrea Gangemi |
ASIACRYPT (7) | 3 |