Demo Data from SIGIR 2026 / reviewers in the wild / expert
Eamonn W. Postlethwaite
dblp:218/7300
· DBLP profile ↗
9ranked-venue papers
1as first author
6since 2021 · last 2026
0000-0003-2984-1332ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 9 · 1 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
7 papers |
Cryptographic primitives and cryptanalysis · 80% Cryptographic protocols and secure computation · 20% | |
| Theoretical computer science
2 papers |
Quantum computing and quantum information · 100% |
Topics — the 15 heaviest of 16, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography |
2.1 | 5 | 2026 | Cool + Cruel = Dual, and New Benchmarks for Sparse LWE · EUROCRYPT (4) 2026 Estimating Quantum Speedups for Lattice Sieves · ASIACRYPT (2) 2020 The General Sieve Kernel and New Records in Lattice Reduction · EUROCRYPT (2) 2019 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
learning with errors |
1.0 | 1 | 2026 | Cool + Cruel = Dual, and New Benchmarks for Sparse LWE · EUROCRYPT (4) 2026 |
Quantum computing and quantum information
quantum algorithms |
0.8 | 2 | 2020 | Estimating Quantum Speedups for Lattice Sieves · ASIACRYPT (2) 2020 Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving · ASIACRYPT (1) 2019 |
Cryptographic primitives and cryptanalysis
post-quantum cryptography |
0.7 | 3 | 2023 | Estimating Quantum Speedups for Lattice Sieves · ASIACRYPT (2) 2020 Finding Short Integer Solutions When the Modulus Is Small · CRYPTO (3) 2023 Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving · ASIACRYPT (1) 2019 |
Cryptographic primitives and cryptanalysis › cryptographic assumptions
short integer solution |
0.7 | 1 | 2023 | Finding Short Integer Solutions When the Modulus Is Small · CRYPTO (3) 2023 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.6 | 1 | 2022 | Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple · ASIACRYPT (4) 2022 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › post-quantum signatures
lattice-based signatures |
0.6 | 1 | 2022 | Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple · ASIACRYPT (4) 2022 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › post-quantum zero-knowledge
lattice-based zero-knowledge proofs |
0.6 | 1 | 2022 | Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple · ASIACRYPT (4) 2022 |
Cryptographic protocols and secure computation
proof systems |
0.6 | 1 | 2022 | Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple · ASIACRYPT (4) 2022 |
Cryptographic protocols and secure computation › key exchange › group key agreement
continuous group key agreement |
0.5 | 1 | 2021 | A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs · CCS 2021 |
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
multi-recipient encryption |
0.5 | 1 | 2021 | A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs · CCS 2021 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography › shortest vector problem
lattice sieving |
0.4 | 1 | 2020 | Estimating Quantum Speedups for Lattice Sieves · ASIACRYPT (2) 2020 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
lattice reduction |
0.4 | 1 | 2019 | The General Sieve Kernel and New Records in Lattice Reduction · EUROCRYPT (2) 2019 |
Cryptographic primitives and cryptanalysis › lattice attack
dual attack |
0.3 | 1 | 2026 | Cool + Cruel = Dual, and New Benchmarks for Sparse LWE · EUROCRYPT (4) 2026 |
Cryptographic protocols and secure computation › secure messaging
secure group messaging |
0.1 | 1 | 2021 | A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs · CCS 2021 |
Methods — techniques the papers use, named apart from their topics
lattice reduction · 1.0benchmark · 1.0module lattice · 0.6fiat-shamir · 0.6protocol optimization · 0.5multi-recipient PKE · 0.5quantum walks · 0.4quantum walk · 0.4general sieve kernel · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Hardness of Hinted ISIS from the Space-Time Hardness of Lattice Problems
Martin R. Albrecht, Russell W. F. Lai, Eamonn W. Postlethwaite |
CRYPTO (3) | 3 |
| 2026 | Preimage Sampleable Function Families Without Discrete Gaussians
Eamonn W. Postlethwaite, Filip Trenkic |
CRYPTO (3) | 1 |
| 2026 | Cool + Cruel = Dual, and New Benchmarks for Sparse LWE
Alexander Karenin, Elena Kirshanova, Julian Nowakowski, Eamonn W. Postlethwaite, Ludo N. Pulles, Fernando Virdia, Paul Vié |
EUROCRYPT (4) | 4 |
| 2023 | Finding Short Integer Solutions When the Modulus Is Small
Léo Ducas, Thomas Espitau, Eamonn W. Postlethwaite |
CRYPTO (3) | 3 |
| 2022 | Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple
Léo Ducas, Eamonn W. Postlethwaite, Ludo N. Pulles, Wessel P. J. van Woerden |
ASIACRYPT (4) | 2 |
| 2021 | A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEsabstractContinuous group key agreements (CGKAs) are a class of protocols that can provide strong security guarantees to secure group messaging protocols such as Signal and MLS. Protection against device compromise is provided by commit messages: at a regular rate, each group member may refresh their key material by uploading a commit message, which is then downloaded and processed by all the other members. In practice, propagating commit messages dominates the bandwidth consumption of existing CGKAs. Keitaro Hashimoto, Shuichi Katsumata, Eamonn W. Postlethwaite, Thomas Prest, Bas Westerbaan |
CCS | 3 |
| 2020 | Estimating Quantum Speedups for Lattice Sieves
Martin R. Albrecht, Vlad Gheorghiu, Eamonn W. Postlethwaite, John M. Schanck |
ASIACRYPT (2) | 3 |
| 2019 | Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving
Elena Kirshanova, Erik Mårtensson, Eamonn W. Postlethwaite, Subhayan Roy Moulik |
ASIACRYPT (1) | 3 |
| 2019 | The General Sieve Kernel and New Records in Lattice Reduction
Martin R. Albrecht, Léo Ducas, Gottfried Herold, Elena Kirshanova, Eamonn W. Postlethwaite, Marc Stevens 0001 |
EUROCRYPT (2) | 5 |