Demo Data from EDBT 2026 / reviewers in the wild / expert
Tyler Besselman
dblp:377/6099
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0009-1504-9943ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 first-author · 2 since 2021Security and privacy · 1 · 1 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.
| Theoretical computer science
2 papers |
Computational complexity · 82% Quantum computing and quantum information · 18% | |
| Network and information security
2 papers |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 9 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Quantum computing and quantum information
quantum algorithms |
1.0 | 1 | 2026 | Tight Quantum Time-Space Tradeoffs for Permutation Inversion · EUROCRYPT (1) 2026 |
Computational complexity › time-space tradeoffs
quantum time-space tradeoff |
1.0 | 1 | 2026 | Tight Quantum Time-Space Tradeoffs for Permutation Inversion · EUROCRYPT (1) 2026 |
Computational complexity › query complexity
decision tree complexity |
0.9 | 1 | 2025 | Direct Sums for Parity Decision Trees · CCC 2025 |
Computational complexity › communication complexity
direct sum |
0.9 | 1 | 2025 | Direct Sums for Parity Decision Trees · CCC 2025 |
Computational complexity › query complexity › decision tree complexity
parity decision trees |
0.9 | 1 | 2025 | Direct Sums for Parity Decision Trees · CCC 2025 |
Computational complexity
query complexity |
0.9 | 1 | 2025 | Direct Sums for Parity Decision Trees · CCC 2025 |
Cryptographic primitives and cryptanalysis › cryptographic assumptions › diffie-hellman assumption
decisional diffie-hellman assumption |
0.8 | 1 | 2024 | Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem · STOC 2024 |
Cryptographic primitives and cryptanalysis
discrete logarithm |
0.8 | 1 | 2024 | Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem · STOC 2024 |
Cryptographic primitives and cryptanalysis › generic attacks
time-space tradeoffs |
0.8 | 1 | 2024 | Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem · STOC 2024 |
Methods — techniques the papers use, named apart from their topics
quantum query complexity · 2.0direct sum · 0.9generic group model · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Tight Quantum Time-Space Tradeoffs for Permutation Inversion
Akshima, Tyler Besselman, Kai-Min Chung, Siyao Guo 0001, Tzu-Yi Yang |
EUROCRYPT (1) | 2 |
| 2025 | Direct Sums for Parity Decision Trees
Tyler Besselman, Mika Göös, Siyao Guo 0001, Gilbert Maystre, Weiqiang Yuan 0002 |
CCC | 1 |
| 2024 | Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman ProblemabstractIn the (preprocessing) Decisional Diffie-Hellman (DDH) problem, we are given a cyclic group G with a generator g and a prime order N, and want to prepare some advice of S, such that we can efficiently distinguish (gx,gy,gxy) from (gx,gy,gz) in time T for uniformly and independently chosen x,y,z from [N]. This is a central cryptographic problem whose computational hardness underpins many widely deployed schemes such as the Diffie–Hellman key exchange protocol. Akshima, Tyler Besselman, Siyao Guo 0001, Zhiye Xie, Yuping Ye |
STOC | 2 |