Demo Data from SIGIR 2026 / reviewers in the wild / expert
Marzio Mula
dblp:320/2397
· DBLP profile ↗
5ranked-venue papers
0as first author
5since 2021 · last 2026
0000-0002-5953-8724ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 5 · 5 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 · 75% Cryptographic protocols and secure computation · 25% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › post-quantum cryptography
isogeny-based cryptography |
2.4 | 3 | 2025 | More Efficient Isogeny Proofs of Knowledge via Canonical Modular Polynomials · CRYPTO (1) 2025 sfQlapoti: Simple and Efficient Translation of Quaternion Ideals to Isogenies · ASIACRYPT (4) 2025 Weak Instances of Class Group Action Based Cryptography via Self-pairings · CRYPTO (3) 2023 |
Cryptographic primitives and cryptanalysis
post-quantum cryptography |
1.1 | 2 | 2025 | sfQlapoti: Simple and Efficient Translation of Quaternion Ideals to Isogenies · ASIACRYPT (4) 2025 Tanuki: New Frameworks for (Concurrently Secure) Blind Signatures from Post-Quantum Group Actions · ASIACRYPT (4) 2025 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
blind signatures |
0.9 | 1 | 2025 | Tanuki: New Frameworks for (Concurrently Secure) Blind Signatures from Post-Quantum Group Actions · ASIACRYPT (4) 2025 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.9 | 1 | 2025 | Tanuki: New Frameworks for (Concurrently Secure) Blind Signatures from Post-Quantum Group Actions · ASIACRYPT (4) 2025 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
proofs of knowledge |
0.9 | 1 | 2025 | More Efficient Isogeny Proofs of Knowledge via Canonical Modular Polynomials · CRYPTO (1) 2025 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
0.9 | 1 | 2025 | More Efficient Isogeny Proofs of Knowledge via Canonical Modular Polynomials · CRYPTO (1) 2025 |
Methods — techniques the papers use, named apart from their topics
modular polynomials · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | On the Use of Atkin and Weber Modular Polynomials in Isogeny Proofs of Knowledge
Thomas den Hollander, Marzio Mula, Daniel Slamanig, Sebastian A. Spindler |
PQCrypto (2) | 2 |
| 2025 | sfQlapoti: Simple and Efficient Translation of Quaternion Ideals to Isogenies
Giacomo Borin, Maria Corte-Real Santos, Jonathan Komada Eriksen, Riccardo Invernizzi, Marzio Mula, Sina Schaeffler, Frederik Vercauteren |
ASIACRYPT (4) | 5 |
| 2025 | Tanuki: New Frameworks for (Concurrently Secure) Blind Signatures from Post-Quantum Group Actions
Lucjan Hanzlik, Yi-Fu Lai, Marzio Mula, Eugenio Paracucchi, Daniel Slamanig |
ASIACRYPT (4) | 3 |
| 2025 | More Efficient Isogeny Proofs of Knowledge via Canonical Modular Polynomials
Thomas den Hollander, Sören Kleine, Marzio Mula, Daniel Slamanig, Sebastian A. Spindler |
CRYPTO (1) | 3 |
| 2023 | Weak Instances of Class Group Action Based Cryptography via Self-pairings
Wouter Castryck, Marc Houben, Simon-Philipp Merz, Marzio Mula, Sam van Buuren, Frederik Vercauteren |
CRYPTO (3) | 4 |