Demo Data from VLDB 2026 / reviewers in the wild / expert
Mingqi Lu 0001
dblp:384/2110-1
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0007-3830-0825ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author · 2 since 2021Theory of computation · 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.
| Network and information security
2 papers |
Cryptographic primitives and cryptanalysis · 77% Cryptographic protocols and secure computation · 23% | |
| Theoretical computer science
2 papers |
Computational complexity · 100% |
Topics — the 7 heaviest of 7, 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
learning with errors |
1.8 | 2 | 2026 | SNARKs from LWE via Non-black-Box Reductions · STOC 2026 Memory-Sample Lower Bounds for LWE · CRYPTO (5) 2024 |
Cryptographic protocols and secure computation › proof systems
succinct non-interactive arguments of knowledge |
1.0 | 1 | 2026 | SNARKs from LWE via Non-black-Box Reductions · STOC 2026 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography |
0.8 | 1 | 2024 | Memory-Sample Lower Bounds for LWE · CRYPTO (5) 2024 |
Cryptographic primitives and cryptanalysis
post-quantum cryptography |
0.8 | 1 | 2024 | Memory-Sample Lower Bounds for LWE · CRYPTO (5) 2024 |
Computational complexity › proof complexity › frege systems
extended frege |
0.3 | 1 | 2026 | SNARKs from LWE via Non-black-Box Reductions · STOC 2026 |
Computational complexity
proof complexity |
0.3 | 1 | 2026 | SNARKs from LWE via Non-black-Box Reductions · STOC 2026 |
Computational complexity › learning theory
memory-sample tradeoffs |
0.2 | 1 | 2024 | Memory-Sample Lower Bounds for LWE · CRYPTO (5) 2024 |
Methods — techniques the papers use, named apart from their topics
lower bound · 1.5non-black-box reductions · 1.0non-black-box reduction · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Succinct Non-interactive Arguments for Distributions
Zhengzhong Jin, Mingqi Lu 0001, Bo Peng 0030 |
CRYPTO (9) | 2 |
| 2026 | SNARKs from LWE via Non-black-Box ReductionsabstractWe construct the first succinct non-interactive arguments of knowledge (SNARKs) from the polynomial-hardness of Learning with Errors (LWE) for a subclass of UP languages whose witness unambiguity has a polynomial-size Extended Frege (EF) proof. Our construction achieves the following soundness guarantee: Zhengzhong Jin, Mingqi Lu 0001, Bo Peng 0030 |
STOC | 2 |
| 2024 | Memory-Sample Lower Bounds for LWE
Mingqi Lu 0001, Junzhao Yang |
CRYPTO (5) | 1 |