Demo Data from VLDB 2026 / reviewers in the wild / expert
Kexi Huang
dblp:389/6119
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security 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.
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 87% Cryptographic protocols and secure computation · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic commitments
polynomial commitment |
0.9 | 1 | 2025 | DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs · USENIX Security Symposium 2025 |
Cryptographic primitives and cryptanalysis › coding theory › error-correcting codes
reed-solomon codes |
0.9 | 1 | 2025 | DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs · USENIX Security Symposium 2025 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
0.3 | 1 | 2025 | DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs · USENIX Security Symposium 2025 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs
Yanpei Guo, Xuanming Liu, Kexi Huang, Wenjie Qu 0001, Tianyang Tao, Jiaheng Zhang |
USENIX Security Symposium | 3 |