Routing and secret key assignment for secure multicast services in quantum satellite networks

Xinyi He; Lin Li; Dahai Han; Yongli Zhao; Avishek Nag; Wei Wang; Hua Wang; Yuan Cao; Jie Zhang

doi:10.1364/JOCN.445621

Journal of Optical Communications and Networking
Vol. 14,
Issue 4,
pp. 190-203
(2022)
•https://doi.org/10.1364/JOCN.445621

Routing and secret key assignment for secure multicast services in quantum satellite networks

Xinyi He, Lin Li, Dahai Han, Yongli Zhao, Avishek Nag, Wei Wang, Hua Wang, Yuan Cao, and Jie Zhang

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Xinyi He, Lin Li, Dahai Han, Yongli Zhao, Avishek Nag, Wei Wang, Hua Wang, Yuan Cao, and Jie Zhang, "Routing and secret key assignment for secure multicast services in quantum satellite networks," J. Opt. Commun. Netw. 14, 190-203 (2022)

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Citation alert
Save article

Check for updates

Abstract

Multicast is an important service type in both terrestrial and space communication networks but has security issues because more than one destination node can receive information. Point-to-point quantum key distribution can be achieved end-to-end over long distances by using a quantum satellite (e.g., Micius) as a relay node. Hence, how to provide secret keys for remote multicast services and efficiently distribute secret keys between the source node and multiple destination nodes for long-distance secure multicast services (SMSs) has become a critical problem. In this paper, a quantum satellite network with a special node structure is designed to complete point-to-multipoint key distribution, and a point-to-multipoint satellite relay scheme is proposed. The weight information of the link is dynamically described by the method of auxiliary topology, and a satellite relay tree is constructed. Finally, this paper proposes a satellite relay algorithm for multicast services to route and allocate key resources to solve the problem of long-distance point-to-multipoint key relay and improve the success probability of multicast service requests. Simulation results show that the proposed algorithm can improve the success probability of SMS requests by about 51.32% in a static scenario and 17.33% in a dynamic scenario.

Full Article | PDF Article

More Like This

Tree-topology-based quantum-key-relay strategy for secure multicast services

Kai Dong, Yongli Zhao, Tiancheng Yang, Yajie Li, Avishek Nag, Xiaosong Yu, and Jie Zhang
J. Opt. Commun. Netw. 12(5) 120-132 (2020)

Protection Schemes for Key Service in Optical Networks Secured by Quantum Key Distribution (QKD)

Hua Wang, Yongli Zhao, Xiaosong Yu, Zhangchao Ma, Jianquan Wang, Avishek Nag, Longteng Yi, and Jie Zhang
J. Opt. Commun. Netw. 11(3) 67-78 (2019)

Dynamic secret-key provisioning in quantum-secured passive optical networks (PONs)

Hua Wang, Yongli Zhao, Massimo Tornatore, Xiaosong Yu, and Jie Zhang
Opt. Express 29(2) 1578-1596 (2021)

Previous Article Next Article

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (16)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (3)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (13)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Yongli Zhao	https://orcid.org/0000-0003-3716-8248
Wei Wang	https://orcid.org/0000-0002-0503-2816
Yuan Cao	https://orcid.org/0000-0002-1037-6701

Notation	Definition
$K$	Global key generated by a random number generator
$N_{n o d e}$	Total number of nodes
$N_{l i n k}$	Total number of links
$C$	Number of secret keys consumed
$G (V, E)$	Substrate topology of QKD satellites network
$V = {L, S}$	Set of network nodes including LEO quantum satellites and ground stations
$L {L_{1}, L_{2}, \dots L_{i}, \dots L_{j}, \dots}$	Set of LEO quantum satellites
$S {S_{a}, S_{b}, S_{c}, S_{d}, S_{e}}$	Set of ground stations
$E {E_{1, 2}, \dots E_{i, j}, \dots}$	Set of network links ( $i \neq j$ )
$K_{ij}$	Number of available secret keys in the QKP of the link between $L_{i}$ and $L_{j}$ ( $i \neq j$ )
$D_{i, j}$	Link distance of $E_{i, j}$ ( $i \neq j$ )
$R_{ij}$	Secret key rate of $E_{i, j}$ ( $i \neq j$ )
$R_{max}$	Maximum secret key rate
$D_{min}$	Transmission distance that corresponds to the maximum secret key rate
$D_{max}$	Transmission distance when the key generation rate drops to zero
$C_{S_{a}, S_{b}}$	Number of secret keys consumed from $S_{a}$ to $S_{b}$
$N_{l i n k}^{S_{a}, S_{b}}$	Number of links between $S_{a}$ and $S_{b}$
$W_{ij} (t)$	Weight of link $E_{i, j}$ in $t$ moment ( $i \neq j$ )
$r$	SMS model
$S_{0}$	Source node
$S_{r}$	Destination node set
$k_{r}$	Number of keys required for each service
$t_{a r r i v a l}$	Arrival time
$t_{h o l d}$	Duration of service
$T$	Global key updating period
$N$	Initial key number in QKP
$N_{r e q}$	Total number of SMS requests
$N_{R}$	Number of relative success SMS requests
$N_{A}$	Number of full success SMS requests
${SP}_{A}$	Full success probability
${SP}_{R}$	Relative success probability

Notation	Definition
$K$	Global key generated by a random number generator
$N_{n o d e}$	Total number of nodes
$N_{l i n k}$	Total number of links
$C$	Number of secret keys consumed
$G (V, E)$	Substrate topology of QKD satellites network
$V = {L, S}$	Set of network nodes including LEO quantum satellites and ground stations
$L {L_{1}, L_{2}, \dots L_{i}, \dots L_{j}, \dots}$	Set of LEO quantum satellites
$S {S_{a}, S_{b}, S_{c}, S_{d}, S_{e}}$	Set of ground stations
$E {E_{1, 2}, \dots E_{i, j}, \dots}$	Set of network links ( $i \neq j$ )
$K_{ij}$	Number of available secret keys in the QKP of the link between $L_{i}$ and $L_{j}$ ( $i \neq j$ )
$D_{i, j}$	Link distance of $E_{i, j}$ ( $i \neq j$ )
$R_{ij}$	Secret key rate of $E_{i, j}$ ( $i \neq j$ )
$R_{max}$	Maximum secret key rate
$D_{min}$	Transmission distance that corresponds to the maximum secret key rate
$D_{max}$	Transmission distance when the key generation rate drops to zero
$C_{S_{a}, S_{b}}$	Number of secret keys consumed from $S_{a}$ to $S_{b}$
$N_{l i n k}^{S_{a}, S_{b}}$	Number of links between $S_{a}$ and $S_{b}$
$W_{ij} (t)$	Weight of link $E_{i, j}$ in $t$ moment ( $i \neq j$ )
$r$	SMS model
$S_{0}$	Source node
$S_{r}$	Destination node set
$k_{r}$	Number of keys required for each service
$t_{a r r i v a l}$	Arrival time
$t_{h o l d}$	Duration of service
$T$	Global key updating period
$N$	Initial key number in QKP
$N_{r e q}$	Total number of SMS requests
$N_{R}$	Number of relative success SMS requests
$N_{A}$	Number of full success SMS requests
${SP}_{A}$	Full success probability
${SP}_{R}$	Relative success probability

Routing and secret key assignment for secure multicast services in quantum satellite networks

Author Affiliations

ORCID

Abstract

Cited By

Figures (16)

Tables (3)

Equations (13)

Journal of Optical Communications and Networking