EDBT 2026 Demo / reviewers in the wild / expert
Zhengzhou Tu
dblp:411/5653
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0007-1749-8780ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author · 2 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 |
Cryptographic primitives and cryptanalysis · 83% Privacy and data protection · 8% Cryptographic protocols and secure computation · 8% |
Topics — the 5 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 › ring signature
linkable ring signature |
0.9 | 1 | 2025 | Efficient Constant-Size Linkable Ring Signatures for Ad-Hoc Rings via Pairing-Based Set Membership Arguments · CCS 2025 |
Cryptographic primitives and cryptanalysis
pairing-based cryptography |
0.9 | 1 | 2025 | Efficient Constant-Size Linkable Ring Signatures for Ad-Hoc Rings via Pairing-Based Set Membership Arguments · CCS 2025 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
ring signature |
0.9 | 1 | 2025 | Efficient Constant-Size Linkable Ring Signatures for Ad-Hoc Rings via Pairing-Based Set Membership Arguments · CCS 2025 |
Privacy and data protection
anonymity |
0.3 | 1 | 2025 | Efficient Constant-Size Linkable Ring Signatures for Ad-Hoc Rings via Pairing-Based Set Membership Arguments · CCS 2025 |
Cryptographic protocols and secure computation
electronic voting |
0.3 | 1 | 2025 | Efficient Constant-Size Linkable Ring Signatures for Ad-Hoc Rings via Pairing-Based Set Membership Arguments · CCS 2025 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Efficient Constant-Size Linkable Ring Signatures for Ad-Hoc Rings via Pairing-Based Set Membership ArgumentsabstractLinkable Ring Signatures (LRS) allow users to anonymously sign messages on behalf of ad-hoc rings, while ensuring that multiple signatures from the same user can be linked. This feature makes LRS widely used in privacy-preserving applications like e-voting and e-cash. To scale to systems with large user groups, efficient schemes with short signatures and fast verification are essential. Recent works, such as DualDory (ESORICS'22) and LLRing (ESORICS'24), improve verification efficiency through offline precomputations but rely on static rings, limiting their applicability in ad-hoc ring scenarios. Similarly, constant-size ring signature schemes based on accumulators face the same limitation. Zhengzhou Tu, Man Ho Au, Xuan Wang 0002, Zoe Lin Jiang |
CCS | 2 |
| 2025 | Lightweight Transparent Zero-Knowledge Proofs for Cross-Domain Statements
Zhengzhou Tu, Yong Yu 0002, Zoe Lin Jiang |
ICICS (1) | 1 |