Demo Data from EDBT 2026 / reviewers in the wild / expert
Kefan Lv
dblp:245/7410
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-4198-8129ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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 protocols and secure computation · 87% Network security · 13% | |
| Theoretical computer science
1 paper |
Quantum computing and quantum information · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
key exchange |
0.6 | 1 | 2022 | Quantum Network: Security Assessment and Key Management · IEEE/ACM Trans. Netw. 2022 |
Cryptographic protocols and secure computation › key management › key distribution
quantum key distribution |
0.6 | 1 | 2022 | Quantum Network: Security Assessment and Key Management · IEEE/ACM Trans. Netw. 2022 |
Quantum computing and quantum information
quantum network |
0.6 | 1 | 2022 | Quantum Network: Security Assessment and Key Management · IEEE/ACM Trans. Netw. 2022 |
Network security › secure communication
quantum network security |
0.2 | 1 | 2022 | Quantum Network: Security Assessment and Key Management · IEEE/ACM Trans. Netw. 2022 |
Methods — techniques the papers use, named apart from their topics
graph theory · 1.1classical network theory · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Quantum Network: Security Assessment and Key ManagementabstractAs an extension of quantum key distribution, secure communication among multiple users is a basic task in a quantum network. When the quantum network structure becomes complicated with a large number of users, it is important to investigate network issues, including security, key management, latency, reliability, scalability, and cost. In this work, we utilize the classical network theory and graph theory to address two critical issues in a quantum network, security and key management. First, we design a communication scheme with the highest security level that trusts a minimum number of intermediate nodes. Second, when the quantum key is a limited resource, we design key management and data scheduling schemes to optimize the utility of data transmission. Our results can be directly applied to the current metropolitan and free-space quantum network implementations and can potentially be a standard approach for future quantum network designs. Hongyi Zhou, Kefan Lv, Longbo Huang, Xiongfeng Ma |
IEEE/ACM Trans. Netw. | 2 |