Demo Data from SIGIR 2026 / reviewers in the wild / expert
Federico Canale
dblp:296/3181
· DBLP profile ↗
6ranked-venue papers
3as first author
6since 2021 · last 2025
0000-0002-3030-334XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 6 · 3 first-author · 6 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
4 papers |
Cryptographic primitives and cryptanalysis · 93% Systems and software security · 7% |
Topics — the 5 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
block cipher |
0.7 | 1 | 2023 | SCARF - A Low-Latency Block Cipher for Secure Cache-Randomization · USENIX Security Symposium 2023 |
Cryptographic primitives and cryptanalysis › block cipher
low-latency block cipher |
0.7 | 1 | 2023 | SCARF - A Low-Latency Block Cipher for Secure Cache-Randomization · USENIX Security Symposium 2023 |
Cryptographic primitives and cryptanalysis › differential cryptanalysis
differential-linear cryptanalysis |
0.6 | 1 | 2022 | Improved Differential-Linear Attacks with Applications to ARX Ciphers · J. Cryptol. 2022 |
Cryptographic primitives and cryptanalysis
symmetric cryptography |
0.6 | 1 | 2022 | Simon's Algorithm and Symmetric Crypto: Generalizations and Automatized Applications · CRYPTO (3) 2022 |
Cryptographic primitives and cryptanalysis › symmetric cryptography › cipher design
ARX ciphers |
0.2 | 1 | 2022 | Improved Differential-Linear Attacks with Applications to ARX Ciphers · J. Cryptol. 2022 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Guessing less and better: improved attacks on GIFT-64abstractGIFT-64 is a block cipher that has received a lot of attention from the community since its proposal in 2017. The attack on the highest number of rounds is a differential related-key attack on 26 rounds. We studied this attack, in particular with respect to some recent generic frameworks for improving key recovery, and we realised that this framework, combined with an efficient parallel key guessing of interesting subsets of the key and a consequent list merging applied to the partial solutions, can improve the complexity of the attack. We propose two different trade-offs, as a result of the improved key-recovery. We believe that the techniques are quite generic and that it is possible to apply them to improve other differential attacks. Federico Canale, María Naya-Plasencia |
Des. Codes Cryptogr. | 1 |
| 2023 | SCARF - A Low-Latency Block Cipher for Secure Cache-Randomization
Federico Canale, Tim Güneysu, Gregor Leander, Jan Philipp Thoma, Yosuke Todo, Rei Ueno |
USENIX Security Symposium | 1 |
| 2022 | Simon's Algorithm and Symmetric Crypto: Generalizations and Automatized Applications
Federico Canale, Gregor Leander, Lukas Stennes |
CRYPTO (3) | 1 |
| 2022 | New Attacks from Old Distinguishers Improved Attacks on Serpent
Marek Broll, Federico Canale, Nicolas David 0001, Antonio Flórez-Gutiérrez, Gregor Leander, María Naya-Plasencia, Yosuke Todo |
CT-RSA | 2 |
| 2022 | Improved Differential-Linear Attacks with Applications to ARX Ciphers
Christof Beierle, Marek Broll, Federico Canale, Nicolas David 0001, Antonio Flórez-Gutiérrez, Gregor Leander, María Naya-Plasencia, Yosuke Todo |
J. Cryptol. | 3 |
| 2021 | Generic Framework for Key-Guessing Improvements
Marek Broll, Federico Canale, Antonio Flórez-Gutiérrez, Gregor Leander, María Naya-Plasencia |
ASIACRYPT (1) | 2 |