0
talks
2
posters
0
committee roles
0
leadership roles
2024–2024
years active
Posters
| Title | Conference | Co-authors |
|---|---|---|
| Differentiated Service Entanglement Routing for Quantum Networks | QCRYPT 2024 | Hui Han, Bo Liu, Bangying Tang, Siyu Xiong, Jinquan Huang, Wei Zhong, Wanrong Yu, Shuhui Chen |
The entanglement distribution networks with various topologies are mainly implemented by active wavelength multiplexing routing strategies. However, designing an entanglement routing scheme, which achieves the maximized network connections and the optimal overall network efficiency simultaneously, remains a huge challenge for quantum networks. In this article, we propose a differentiated service entanglement routing (DSER) scheme, which firstly finds out the lowest loss paths and supported wavelength channels with the tensor-based path searching algorithm, and then allocates the paired channels with the differentiated routing strategies. The evaluation results show that the proposed DSER scheme can be performed for constructing various large scale quantum networks. |
||
| Efficient Arbitrated Quantum Digital Signature with Multi-Receiver Verification | QCRYPT 2024 | Siyu Xiong, Bangying Tang, Hui Han, Jinquan Huang, Mingqiang Bai, Wanrong Yu, Zhiwen Mo, Bo Liu |
Quantum digital signature is used to authenticate the identity of the signer with information theoretical security, while providing non-forgery and non-repudiation services. In traditional multireceiver quantum digital signature schemes without an arbitrater, the transferability of one-to-one signature is always required to achieve unforgeability, with complicated implementation and heavy key consumption. In this article, we propose an arbitrated quantum digital signature scheme, in which the signature can be verified by multiple receivers simultaneously, and meanwhile, the transferability of the signature is still kept. Our scheme can be simplified performed to various quantum secure networks, due to the proposed efficient signature calculation procedure with low secure key consumption and low computation complexity, by employing one-time universal hashing algorithm and one-time pad encryption scheme. The evaluation results show that our scheme uses at least two orders of magnitude less key than existing signature schemes with transferability when signing files of the same length with the same number of receivers and security parameter settings. |
||
Collaborators
| Co-author | Joint talks |
|---|---|
| Bangying Tang | 2 |
| Bo Liu | 2 |
| Hui Han | 2 |
| Jinquan Huang | 2 |
| Siyu Xiong | 2 |
| Wanrong Yu | 2 |
| Mingqiang Bai | 1 |
| Shuhui Chen | 1 |
| Wei Zhong | 1 |
| Zhiwen Mo | 1 |