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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Julien Duman

dblp:305/8981 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2022
0000-0002-5195-1290ORCID · corroborated

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

Security and privacy · 2 · 2 first-author · 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
2 papers
Cryptographic primitives and cryptanalysis · 71% Cryptographic protocols and secure computation · 29%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography
key encapsulation mechanism		 1.122022
Group Action Key Encapsulation and Non-Interactive Key Exchange in the QROM · ASIACRYPT (2) 2022
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing · CCS 2021
Cryptographic protocols and secure computation
key exchange		 0.722022
Group Action Key Encapsulation and Non-Interactive Key Exchange in the QROM · ASIACRYPT (2) 2022
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing · CCS 2021
Cryptographic protocols and secure computation › key exchange
non-interactive key exchange		 0.612022
Group Action Key Encapsulation and Non-Interactive Key Exchange in the QROM · ASIACRYPT (2) 2022
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography		 0.512021
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing · CCS 2021
Cryptographic primitives and cryptanalysis › provable security
multi-user security		 0.512021
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing · CCS 2021
Cryptographic primitives and cryptanalysis
post-quantum cryptography		 0.512021
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing · CCS 2021
Cryptographic primitives and cryptanalysis
provable security		 0.512021
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing · CCS 2021
Cryptographic primitives and cryptanalysis › cryptographic transformations
fujisaki-okamoto transform		 0.112021
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing · CCS 2021

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

quantum random oracle model · 0.6group actions · 0.6prefix hashing · 0.5fujisaki-okamoto transform · 0.5
YearPublicationVenuePosition
2022 Group Action Key Encapsulation and Non-Interactive Key Exchange in the QROM
Julien Duman, Dominik Hartmann, Eike Kiltz, Sabrina Kunzweiler, Jonas Meers, Doreen Riepel
 ASIACRYPT (2)1
2021 Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing
abstract
Constructing an efficient CCA-secure KEM is generally done by first constructing a passively-secure PKE scheme, and then applying the Fujisaki-Okamoto (FO) transformation. The original FO transformation was designed to offer security in a single user setting. A stronger notion, known as multi-user security, considers the attacker's advantage in breaking one of many user's ciphertexts. Bellare et al. (EUROCRYPT 2000) showed that standard single user security implies multi-user security with a multiplicative tightness gap equivalent to the number of users.
Julien Duman, Kathrin Hövelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler
 CCS1