EDBT 2026 Demo / reviewers in the wild / expert
Zikuan Huang
dblp:370/6908
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
0009-0001-4191-8809ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 2 since 2021Theory of computation · 2 · 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 · 70% Digital forensics and information hiding · 30% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Digital forensics and information hiding › digital rights management
copy-protection |
1.0 | 1 | 2026 | Copy-Protection from Unclonable Puncturable Obfuscation, Revisited · EUROCRYPT (1) 2026 |
Cryptographic primitives and cryptanalysis › obfuscation
indistinguishability obfuscation |
1.0 | 1 | 2026 | Copy-Protection from Unclonable Puncturable Obfuscation, Revisited · EUROCRYPT (1) 2026 |
Cryptographic primitives and cryptanalysis
obfuscation |
1.0 | 1 | 2026 | Copy-Protection from Unclonable Puncturable Obfuscation, Revisited · EUROCRYPT (1) 2026 |
Computational complexity
space complexity |
1.0 | 1 | 2026 | On the Need for (Quantum) Memory with Short Outputs · STOC 2026 |
Cryptographic primitives and cryptanalysis › quantum cryptography
unclonable cryptography |
0.3 | 1 | 2026 | Copy-Protection from Unclonable Puncturable Obfuscation, Revisited · EUROCRYPT (1) 2026 |
Computational complexity › query complexity
quantum query complexity |
0.3 | 1 | 2026 | On the Need for (Quantum) Memory with Short Outputs · STOC 2026 |
Methods — techniques the papers use, named apart from their topics
nested collision finding · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Copy-Protection from Unclonable Puncturable Obfuscation, Revisited
Prabhanjan Vijendra Ananth, Amit Behera, Zikuan Huang, Fuyuki Kitagawa, Takashi Yamakawa |
EUROCRYPT (1) | 3 |
| 2026 | On the Need for (Quantum) Memory with Short OutputsabstractIn this work, we establish the first separation between computation with bounded and unbounded space, for problems with short outputs (i.e., working memory can be exponentially larger than output size), both in the classical and the quantum setting. Towards that, we introduce a problem called nested collision finding, and show that optimal query complexity can not be achieved without exponential memory. Zihan Hao, Zikuan Huang, Qipeng Liu 0001 |
STOC | 2 |
| 2024 | Quantum Key-Revocable Dual-Regev Encryption, Revisited
Prabhanjan Vijendra Ananth, Zikuan Huang |
TCC (3) | 3 |