YI Luo

Dr. YI Luo


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 July 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
YLYI Luo
YI Luo
XCXi Cheng
Xi Cheng
Hao-Kun MaoHao-Kun Mao
Hao-Kun Mao
QLQiong Li
Qiong Li
Quantum key distribution (QKD) technology is a frontier in the field of secure communication, leveraging the principles of quantum mechanics to offer information-theoretically secure keys. Postprocessing is an important part of a whole QKD system because it directly impacts the secure key rate and the security of the system. In particular, with the fast increase in the photon transmission frequency in a QKD system, the processing speed of postprocessing becomes an essential issue. Our study embarks on a comprehensive review of the development of postprocessing of QKD, including five subprotocols, namely, parameter estimation, sifting, information reconciliation, privacy amplification, and channel authentication. Furthermore, we emphasize the issues raised in the implementation of these subprotocols under practical scenarios, such as limited computation or storage resources and fluctuations in channel environments. Based on the composable security theory, we demonstrate how enhancements in each subprotocol influence the secure key rate and security parameters, which can provide meaningful insights for future advancements in QKD.

29 May 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
YLYI Luo
YI Luo
HMHao-Kun Mao
Hao-Kun Mao
QLQiong Li
Qiong Li
NCNan Chen
Nan Chen
Information-theoretic secure (ITS) authentication is an essential part of a quantum key distribution (QKD) system. In the QKD network, the authentication scheme based on the ITS QKD keys pre-shared by the QKD system. However, such a scheme is subject to the limitation that consumes a significant amount of authentication keys when the scale and communication needs of QKD networks grow. To address the issue, we propose an ITS group authentication scheme for QKD networks that consumes considerably fewer keys. In our scheme, multiple QKD network nodes collaborate and complete the authentication as a group. Compared to the pre-shared keys authentication scheme, our scheme reduces the complexity of authentication key consumption from O ( N 2 d ) to O (N) , where N is the number of nodes and d is the average path length of the network topology. The security of the proposed scheme is analyzed in detail and simulation experiments are conducted to demonstrate our scheme’s effectiveness for varying networks scales and communication requirements.

23 June 2023 in IEEE Transactions on Sustainable Energy
Verified
Journal Article
Closed access
QZQinmin Zhong
Qinmin Zhong
JYJun Yao
Jun Yao
YLYI Luo
YI Luo
SHSen Huang
Sen Huang
SCShiyue Chen
Shiyue Chen
The synchronization stability and instability risk assessment of multi-paralleled wind farms during asymmetrical grid faults have received little attention to date. In this article, a simplified equivalent model of multi-paralleled wind farms is established based on the symmetrical components method to deal with the problem of dual-sequence synchronization stability during asymmetrical grid faults. Based on the model, the effects of multiple coupling characteristics such as sequence coupling and mutual coupling of wind farms on the stability of dual-sequence synchronization are studied in detail. Then, an assessment method is proposed to evaluate the dual-sequence synchronization stability of multi-paralleled wind farms under various asymmetrical grid faults. This assessment method can judge whether there are positive-sequence (PS) and negative-sequence (NS) steady-state equilibrium points for each wind farm in the system, and identify the wind farms that are instability due to the lack of a PS/NS equilibrium point. In addition, a current control strategy is derived to maximize the stability margin of dual-sequence synchronization. This strategy can ensure that each wind farm in the system has equilibrium point. Finally, the correctness of the theoretical analysis and the effectiveness of the proposed method are verified by simulation.

16 September 2024 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
YLYI Luo
YI Luo
QLQiong Li
Qiong Li
HMHao-Kun Mao
Hao-Kun Mao
Quantum key distribution (QKD) networks are expected to enable information-theoretical secure (ITS) communication over a large-scale network. Most research on relay-based QKD networks assumes all relays or nodes are completely trustworthy. However, this assumption is unreasonable because the malicious behavior of even a single node can undermine the security of the entire network. Currently, there is no method to directly distinguish between honest nodes and malicious nodes. Moreover, the status of nodes as honest or malicious can be dynamic. Therefore, a solution is needed that can withstand a certain proportion of malicious nodes in QKD networks. We propose a novel paradigm, inspired by distributed systems, to address the active and passive attacks by collaborating with malicious nodes in QKD networks. First, regarding security, we propose the ITS distributed authentication scheme, which additionally ensures two crucial security properties to QKD networks: identity unforgeability and non-repudiation. Second, concerning correctness, we propose an ITS fault-tolerant consensus scheme based on our ITS distributed authentication to ensure global consistency. This enables participating nodes to collaborate correctly and complete end-to-end key distribution within a constant number of communication rounds. Through our simulation, we have shown that our scheme exhibits a significantly lower growth trend in key consumption compared to the original end-to-end pre-shared keys scheme. For instance, in larger networks, such as when the number of nodes is 80, our scheme’s key consumption is only 13.1% of the pre-shared keys scheme.

27 February 2023
Verified
Conference Paper
Open access
GYGongzhu Yin
Gongzhu Yin
XWXing Wang
Xing Wang
HZHongli Zhang
Hongli Zhang
CMChao Meng
Chao Meng
YYYuchen Yang
Yuchen Yang
YLYI Luo
YI Luo
Link prediction is a core task in graph machine learning with wide applications. However, little attention has been paid to link prediction between two group entities. This limits the application of the current approaches to many real-life problems, such as predicting collaborations between academic groups or recommending bundles of items to group users. Moreover, groups are often ephemeral or emergent, forcing the predicting model to deal with challenging inductive scenes. To fill this gap, we develop a framework composed of a GNN-based encoder and neural-based aggregating networks, namely the Mutual Multi-view Attention Networks (MMAN). First, we adopt GNN-based encoders to model multiple interactions among members and groups through propagating. Then, we develop MMAN to aggregate members' node representations into multi-view group representations and compute the final results by pooling pairwise scores between views. Specifically, several view-guided attention modules are adopted when learning multi-view group representations, thus capturing diversified member weights and multifaceted group characteristics. In this way, MMAN can further mimic the mutual and multiple interactions between groups. We conduct experiments on three datasets, including two academic group link prediction datasets and one bundle-to-group recommendation dataset. The results demonstrate that the proposed approach can achieve superior performance on both tasks compared with plain GNN-based methods and other aggregating methods.