QDQingyun Du

Qingyun Du

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Qingyun Du has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Analysis on the Feasibility of D-FACTS Devices for Localizing FDI Attacks in Smart Grids

    by Qingyun Du, Mi Wen, Chonghua Wang, Beibei Li, Yan Zhang

    Proactive detection with distributed flexible AC transmission system (D-FACTS) devices has been extensively studied for identifying false data injection (FDI) attacks in smart grids, while their potential for localizing remains largely unexplored. To meet this gap, this paper systematically explores the feasibility of localizing FDI attacks with D-FACTS devices. Specifically, we first thoroughly study the rationale underlying FDI localization with D-FACTS devices. We prove that an activated D-FACTS device is capable of localizing FDI attacks targeted on its connected end buses once a bad data detection (BDD) alarm is triggered. In addition, we elaborately analyze the inherent localization limitations: (i) the unlocalizable adversary cases targeting one-degree buses or super-buses; (ii) the localization uncertainty introduced by the defender's blind spots, resulting in huge operational costs and insufficient precision. Following this, a data-prompting framework is designed to over-come the above limitations. This framework integrates a data driven injected error identifier for precise localization and cost reduction, followed by a perturbation strategy with D-FACTS devices that significantly lowers false positive rates. Extensive simulations validate our theoretical findings on the rationale and limitations, while also demonstrating the effectiveness of the proposed framework in addressing limitations and enhancing localization accuracy.

  • Chaos-Based Index-of-Min Hashing Scheme for Cancellable Biometrics Security

    by Wanying Dai, Beibei Li, Qingyun Du, Ziqing Zhu, Ao Liu

    Cancellable biometrics is essential for preserving sensitive biometric information from potential exposure. Existing studies usually convert real-valued biometric vectors into protected templates by randomly generated transformation keys. However, this way is realized by the built-in functions of the cancellable biometric system, which creates vulnerabilities for cancellable biometric schemes. In this paper, we propose a novel chaos-based Index-of-Min cancellable biometric scheme, named C-IoM, for privacy-preserving template updates in biometric technique. Specifically, we first design a chaos-based cancellable biometric framework to ensure the security and privacy of the biometric template. Second, we develop a secure random chaos seed generation algorithm, which non-linearly converts the biometric vectors into protected templates and conceals biometric dimensional information. Further, we craft a sliding window selection mechanism to choose the input biometric features, allowing each feature data to fully participate in the generation of protected templates through sliding intervals. Theoretical analysis confirms that the C-IoM satisfies the criteria of irreversibility, revocability, unlinkability, and performance preservation in cancellable biometrics. Extensive experiments on LFW, CFPW, and CASIA-V5 datasets demonstrate the security of the proposed framework in protecting biometric data as well as the superiorities over state-of-the-art schemes.


  • Incentive-Based Federated Learning for Digital-Twin-Driven Industrial Mobile Crowdsensing

    by Beibei Li, Yaxin Shi, Qinglei Kong, Qingyun Du, Rongxing Lu

    Mobile crowdsensing has empowered the Industrial Internet of Things (IIoT) in many ways, such as vehicle-aided traffic flow scheduling and drone-aided visual inspections, etc. However, dynamic perception and cooperative decision-making among these heterogeneous and resource-constrained mobile clients in IIoT remains a big challenge. In this paper, we propose an incentive-based federated learning scheme for digital twin driven industrial mobile crowdsensing. Specifically, we first design a digital twin driven industrial mobile crowdsensing architecture to achieve dynamic perception of the complex IIoT environment, among heterogeneous and resource-constrained mobile clients. Second, we develop a novel incentive-based federated learning framework incorporated with a contract-based reputation mechanism and a Stackelberg-based inter-client incentive mechanism, to optimize the model accuracy. Third, we devise a knowledge distillation algorithm for the federated learning framework, to address the heterogeneity of non-independent and identically distributed (Non-IID) data. Extensive experiments on both MNIST/FEMNIST and CIFAR10/100 datasets demonstrate the outperformance of our proposed scheme, in terms of model accuracy, incentive fairness, and data compatibility, compared to state-of-the-art studies.


  • $\bm {P}^{\bm {3}}$: Privacy-Preserving Prediction of Real-Time Energy Demands in EV Charging Networks

    by Beibei Li, Yuqing Guo, Qingyun Du, Ziqing Zhu, Xiaohui Li, Rongxing Lu

    Real-time and accurate prediction of charging pile energy demands in electric vehicle (EV) charging networks contributes significantly to load shedding and energy conservation. However, existing methods usually suffer from either data privacy leakage problems or heavy communication overheads. In this paper, we propose a novel blockchain-based personalized federated deep learning scheme, coined $P^{3}$, for privacy-preserving energy demands prediction in EV charging networks. Specifically, we first design an accurate deep learning-based energy demands prediction model for charging piles, by making use of the CNN, BiLSTM, and attention mechanism. Second, we develop a blockchain-based hierarchical and personalized federated learning framework with a consensus committee, allowing charging piles to collectively establish a comprehensive energy demands prediction model in a low-latency and privacy-preserving way. Last, a CKKS cryptosystem based secure communication protocol is crafted to guarantee the confidentiality of model parameters while model training. Extensive experiments on two real charging pile datasets demonstrate the superiorities of the proposed $P^{3}$ scheme in accurately predicting real-time energy demands over state-of-the-art schemes. Further, the $P^{3}$ scheme can achieve reasonably low computational costs, compared with other homomorphic-based schemes, such as Paillier and BFV.


  • Locating False Data Injection Attacks on Smart Grids Using D-FACTS Devices

    by Beibei Li, Qingyun Du, Jiarui Song, Aohan Li, Xiaoxia Ma