Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jonas Lindstrøm
dblp:367/4139
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2026
0000-0002-1989-3019ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 4 · 4 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
1 paper |
Authentication and access control · 67% Blockchain and cryptocurrency security · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Blockchain and cryptocurrency security › blockchain-based identity management
blockchain-based authentication |
0.8 | 1 | 2024 | zkLogin: Privacy-Preserving Blockchain Authentication with Existing Credentials · CCS 2024 |
Authentication and access control › user authentication
credential-based authentication |
0.8 | 1 | 2024 | zkLogin: Privacy-Preserving Blockchain Authentication with Existing Credentials · CCS 2024 |
Authentication and access control
privacy-preserving authentication |
0.8 | 1 | 2024 | zkLogin: Privacy-Preserving Blockchain Authentication with Existing Credentials · CCS 2024 |
Methods — techniques the papers use, named apart from their topics
zero-knowledge proofs · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Linear Operator Framework for Polynomial Divisions in CryptographyabstractSeveral cryptographic primitives, especially succinct proofs of various forms, transform the satisfaction of high-level properties to the existence of a polynomial quotient between a polynomial that interpolates a set of values with a cleverly arranged divisor. Some examples are SNARKs, like Groth16, and polynomial commitments, such as KZG. Such a polynomial division naively takes O (n log n) time with Fast Fourier Transforms, and is usually the asymptotic bottleneck for these computations. Varun Madathil, Arnab Roy 0001, Kostas Kryptos Chalkias, Charanjit S. Jutla, Jonas Lindstrøm |
AsiaCCS | 5 |
| 2024 | A New Approach to Efficient and Secure Fixed-Point Computation
Tore Kasper Frederiksen, Jonas Lindstrøm, Mikkel Wienberg Madsen, Anne Dorte Spangsberg |
ACNS (1) | 2 |
| 2024 | zkLogin: Privacy-Preserving Blockchain Authentication with Existing Credentialsabstractstatus: Published Foteini Baldimtsi, Kostas Kryptos Chalkias, Yan Ji 0001, Jonas Lindstrøm, Sai Krishna Deepak Maram, Ben Riva, Arnab Roy 0001, Mahdi Sedaghat, Joy Wang |
CCS | 4 |
| 2024 | Subset-Optimized BLS Multi-signature with Key Aggregation
Foteini Baldimtsi, Kostas Kryptos Chalkias, François Garillot, Jonas Lindstrøm, Ben Riva, Arnab Roy 0001, Mahdi Sedaghat, Alberto Sonnino, Pun Waiwitlikhit, Joy Wang |
FC (2) | 4 |