Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jeffrey Burdges
dblp:22/115 · also Jeff Burdges
· DBLP profile ↗
4ranked-venue papers
3as first author
3since 2021 · last 2025
0009-0009-4980-2251ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 2 first-author · 3 since 2021Theory of computation · 1 · 1 first-author
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 · 80% Cryptographic protocols and secure computation · 20% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.5 | 1 | 2021 | Two-Round Trip Schnorr Multi-signatures via Delinearized Witnesses · CRYPTO (1) 2021 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › multi-signature
schnorr multi-signatures |
0.5 | 1 | 2021 | Two-Round Trip Schnorr Multi-signatures via Delinearized Witnesses · CRYPTO (1) 2021 |
Cryptographic primitives and cryptanalysis › encryption
timed-release encryption |
0.5 | 1 | 2021 | Delay Encryption · EUROCRYPT (1) 2021 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › multi-signature
two-round multi-signatures |
0.5 | 1 | 2021 | Two-Round Trip Schnorr Multi-signatures via Delinearized Witnesses · CRYPTO (1) 2021 |
Methods — techniques the papers use, named apart from their topics
schnorr signatures · 0.5delinearization · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Sassafras: Efficient Batch Single Leader Election
Jeffrey Burdges, Elizabeth C. Crites, Handan Kilinç Alper, Alistair Stewart, Sergey Vasilyev |
ACNS (1) | 1 |
| 2021 | Two-Round Trip Schnorr Multi-signatures via Delinearized Witnesses
Handan Kilinç Alper, Jeffrey Burdges |
CRYPTO (1) | 2 |
| 2021 | Delay Encryption
Jeffrey Burdges, Luca De Feo |
EUROCRYPT (1) | 1 |
| 2002 | Borovik-Poizat Rank and StabilityabstractBorovik proposed an axiomatic treatment of Morley rank in groups, later modified by Poizat, who showed that in the context of groups the resulting notion of rank provides a characterization of groups of finite Morley rank [2]. (This result makes use of ideas of Lascar, which it encapsulates in a neat way.) These axioms form the basis of the algebraic treatment of groups of finite Morley rank undertaken in [1]. There are, however, ranked structures, i.e., structures on which a Borovik-Poizat rank function is defined, which are not ℵ0-stable [1, p. 376]. In [2, p. 9] Poizat raised the issue of the relationship between this notion of rank and stability theory in the following terms: “… ungroupede Borovik est une structure stable, alors qu'un univers rangé n'a aucune raison de l'être …” (emphasis added). Nonetheless, we will prove the following: Theorem 1.1.A ranked structure is superstable. An example of a non-ℵ0-stable structure with Borovik-Poizat rank 2 is given in [1, p. 376]. Furthermore, it appears that this example can be modified in a straightforward way to give ℵ0-stable structures of Borovik-Poizat rank 2 in which the Morley rank is any countable ordinal (which would refute a claim of [1, p. 373, proof of C.4]). We have not checked the details. This does not leave much room for strenghthenings of our theorem. On the other hand, the proof of Theorem 1.1 does give a finite bound for the heights of certain trees of definable sets related to unsuperstability, as we will see in Section 5. Jeffrey Burdges, Gregory L. Cherlin |
J. Symb. Log. | 1 |