RLRuinian Li

Ruinian Li

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ruinian Li has a total of 84 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Mechanism Design for Utility-Aware Personalized Privacy Guarantees

    by Jiajun Chen, Chunqiang Hu, Yangrui Li, Ruinian Li, Pengfei Hu, Jiguo Yu

    The widespread adoption of data-driven services, including networked data collection and analysis systems, has greatly enhanced convenience and decision-making, but it has also raised growing concerns about the trade-off between fine-grained utility and personalized privacy guarantees. Personalized Differential Privacy (PDP) offers a flexible framework by allowing users to specify individualized privacy budgets. However, existing sampling-based PDP mechanisms often rely on coarse risk modeling assumptions that treat individual data characteristics uniformly, leading to suboptimal utility and inefficient privacy expenditure. In this paper, we propose the Utility-Aware Sampling Mechanism (UASM), a principled PDP implementation that enables fine-grained, user-centric privacy control while explicitly optimizing utility. First, UASM formalizes policy-assisted secret specifications, allowing confidentiality to be determined through a combination of baseline protection rules and personalized privacy preferences, and combines them with individualized privacy budgets. Second, UASM employs a two-stage utility-aware sampling strategy to calibrate noise: (i) an optimal global threshold selected to reduce unnecessary privacy-budget wastage while respecting users’ declared budgets, and (ii) a sensitivity-aware refinement stage that allocates privacy loss according to each record’s influence on query accuracy. Formal privacy analysis demonstrates that UASM provides rigorous privacy guarantees and promotes fairer privacy expenditure under heterogeneous privacy requirements. Extensive experiments on synthetic and real-world datasets, including network-oriented downstream tasks, show that UASM achieves a superior privacy-utility trade-off over state-of-the-art PDP baselines, underscoring its practical effectiveness.


  • Differential Privacy at a TechnologySociety Lens: The Critical Role of Privacy Policies

    by Chunqiang Hu, Jiajun Chen, Ruinian Li, Pengfei Hu, Tao Xiang, Jiguo Yu

    The rapid expansion of data collection and analysis has intensified societal concerns regarding personal privacy. Although differential privacy (DP) provides rigorous mathematical guarantees, its practical deployment requires closer alignment with user rights, evolving privacy norms, and public policy principles. This article addresses the gap between DP’s technical mechanisms and broader socio-ethical expectations by introducing user-defined privacy and secret specifications as formalized representations of personalized privacy requirements. Building on this foundation, we propose the policy-driven DP (PDDP) model, which integrates these specifications directly into the DP framework, enabling user-centric and policy-responsive privacy protection. We develop a tailored randomized response mechanism to operationalize PDDP, providing fine-grained and adaptable privacy protection. Experimental results on real datasets demonstrate that PDDP delivers improved privacy-utility tradeoffs while accommodating heterogeneous user preferences. Beyond technical results, we discuss how PDDP strengthens user trust and promotes alignment between privacy technologies and regulatory and societal trends. Finally, we outline several future research directions, including extending PDDP to decentralized settings, expanding supported query types, and examining its role in adaptive governance and evolving privacy policies.


  • Enhancing Federated Learning in IoV: Robust Client Selection and Bandwidth Allocation With Reservoir Computing

    by Xiangqing Su, Yan Huo, Ruinian Li, Xiaoxuan Wang, Jian Mao, Tao Jing, Xin Fan

    Federated Learning (FL) in the Internet of Vehicles (IoVs) facilitates vehicle collaboration while ensuring user privacy. However, FL’s reliance on communication resources presents significant challenges in IoV environments, where limited resources and rapid vehicle mobility hinder deployment. In addition, the presence of malicious nodes further complicates these issues. To address these challenges, we introduce a client selection algorithm based on Reservoir Computing (RC) to improve both client selection reliability and communication efficiency. In particular, we first develop a trust value calculation method to address unreliable communication behaviors and model transmissions from malicious vehicles. We define an optimization criterion, “Federated Model Satisfaction,” which comprehensively evaluates client drift and trustworthiness in IoV-based FL. Next, the problem of maximizing federated model satisfaction is formulated as a Partially Observable Markov Decision Process (POMDP) that incorporates IoV-specific characteristics. We also propose a novel algorithm, MD-DESQN, which integrates the Echo State Network (ESN) and the Double Deep Q-Network (DDQN) for client selection and bandwidth allocation. This algorithm considers vehicle mobility, trust values, and communication conditions, enhancing both communication robustness and FL security. Simulation results demonstrate that the proposed trust value calculation method effectively integrates historical information and current behaviors, providing reliable guidance for client selection. The algorithm demonstrates superior efficiency and effectiveness compared to traditional methods across various scenarios with varying ratios of malicious vehicles and system sizes.


  • Fog-Assisted Composite Attribute-Based Encryption for Secure Personal Health Data Sharing

    by Junze Lu, Chunqiang Hu, Ruinian Li, Yuwen Chen, Jiguo Yu

    The exponential growth of wearable medical devices (WMDs) and the increasing demand for real-time health data sharing necessitate secure and fine-grained access control mechanisms. However, existing ciphertext-policy attribute-based encryption (CP-ABE) schemes suffer from computational and storage overheads that grow linearly with policy complexity. To address this challenge, we propose fog-assisted composite attribute-based encryption (FA-CABE), a novel scheme that integrates composite attributes with fog computing to enhance efficiency. FA-CABE leverages the subset sum problem (SSP) to map conjunctive policy clauses to composite attributes, substantially reducing both encryption and decryption overhead. A dualfog-node architecture offloads cryptographic computations from WMDs, enabling lightweight local processing. Rigorous security analysis under the Decisional Bilinear Diffie-Hellman (DBDH) assumption demonstrates that FA-CABE achieves replayable chosen ciphertext attack (RCCA) security. Experimental results show that FA-CABE achieves encryption speeds that are 22.13×–145.02× faster and decryption speeds that are 6.71×–161.83× faster than existing schemes, while requiring only a constant number of operations for decryption. Additionally, experimental validation on the Raspberry Pi 4B shows that the energy consumption is as low as 0.72 W per core, with data processing speed reaching 23.38 MB/s.


  • A Trust-Based Personalized Differential Privacy Guarantees for Online Social Networks

    by Jiajun Chen, Chunqiang Hu, Weihong Sheng, Ruinian Li, Ruifeng Zhao, Jiguo Yu

    Online social networks have emerged as a significant data source, but the extensive collection and utilization of personal information have given rise to profound concerns regarding privacy. From a legislative and policy perspective, and in alignment with the concept of privacy as control, users have the right to control their personal privacy information. However, users often encounter challenges in terms of understanding and effectively managing their privacy settings to align with their specific privacy requirements. To address this issue, in this paper, we incorporate the concept of trust and propose a trust-based personalized differential privacy model for online social networks, denoted as TPDP, which relies on a trusted central server to facilitate its operation. Specifically, when a user requests access to another user’s personal information, the TPDP mechanism provides a privacy response, where the privacy level is determined based on the direct and indirect trust values among users, calculated automatically by the trusted central server. Furthermore, the proposed TPDP model offers user-to-user personalized differential privacy protection from the perspectives of network structures, trust-related factors, and trust propagation patterns. Finally, we validate the model’s feasibility and assess the privacy-utility trade-off, as well as its robustness against attacks, through theoretical analysis and performance evaluation.


  • Self-Learning Based Dependable Offloading Optimization in Semi-Trusted Vehicular Edge Computing and Networks

    by Xuehan Li, Tao Jing, Ruinian Li, Xiaoxuan Wang, Yu Yan, Xin Fan, Yan Huo, Fei Richard Yu

    As vehicular edge computing and networks (VECONs) emerge, Internet of vehicles (IoVs) is gaining significant advantages. To provide users with dependable services, VECONs need to offer efficient and secure task offloading services. Unfortunately, little effort has been put into addressing security issues such as the risk of privacy exposure when offloading data. Modeling and optimizing offloading dependability are affected by these issues. To address these concerns, a dependable three-layer offloading framework involving blockchain technology is presented in this paper, with fully homomorphic encryption (FHE) algorithm incorporated in order to mitigate privacy exposure risks. The framework divides tasks reasonably and introduces a novel measure of offloading dependability called cost from energy consumption, delay, and privacy exposure risk (cEDP) for constructing dependable offloading optimization. Additionally, a self-learning based dependable privacy preservation offloading (SDPPO) algorithm is presented that is capable of solving the optimal offloading problem in a decentralized manner. Simulation results show that the SDPPO algorithm outperforms its counterparts in terms of faster convergence speed, better cEDP convergence results, and improved scalability and tunability characteristics.


  • A Soft-Handoff-Based Cooperative Jamming Scheme for Security in Mobility Scenarios

    by Haidong Huang, Yan Huo, Ruinian Li, Qinghe Gao, Yingzhen Wu, Zhiwei Yang

    Physical layer security has attracted significant attention in the field of wireless communications. The application of artificial noise can reduce the eavesdropping ability of illegal eavesdroppers without affecting legitimate users. However, most current physical layer security schemes only consider static scenarios and do not account for mobility. Some schemes analyze security performance in mobile scenarios with friendly jammers but do not consider the handoff and cooperation of friendly jammers due to mobility. To address this challenge, we propose a scheme for soft-handoff-based cooperative jamming (CJSH) in mobility scenarios. Initially, we consider a common scenario where a base station communicates with a legitimate mobile user, alongside a mobile passive eavesdropper and multiple friendly jammers emitting artificial noise in the circular area covered by the base station’s signal. Next, We measure the connection outage probability (COP) and secrecy outage probability (SOP) under the influence of multiple friendly jammers in the proposed scheme. We also design two corresponding thresholds for jammers to join and exit. To balance security and energy consumption, we define the Power Average Security Gain (PASG) as a measure of system performance. Finally, we provide numerical simulation results to verify the rationality of the proposed handoff scheme, demonstrating its effective improvement of the system’s security performance and power utilization.


  • Smart Contract Assisted Privacy-Preserving Data Aggregation and Management Scheme for Smart Grid

    by Chunqiang Hu, Zewei Liu, Ruinian Li, Pengfei Hu, Tao Xiang, Meng Han

    Data aggregation plays a crucial role in smart grid communication as it enables the collection of data in an energy-efficient manner. However, the widespread deployment of smart meters has raised significant concerns regarding the privacy of users' personal data. Therefore, in this paper, we present an efficient and privacy-preserving data aggregation and trust management scheme (PATM) for an IoT-enabled smart grid based on smart contract. Firstly, we propose a five-layer architecture for smart grid communication to support secure and efficient data aggregation and management. Under the architecture, the Boneh-Goh-Nissim cryptosystem with blind factor is improved to facilitate privacy protection. In addition, the tamper-evident nature of blockchain is utilized for effective data management. Our designs also enhance the resistance to differential attack and prevent privacy breaches during the aggregation process. Detailed security proof and theoretical analysis confirm that our PATM can satisfies the necessary security and privacy requirements while maintaining the required efficiency for smart grid operations. Furthermore, comparative experiments demonstrate that PATM outperforms other proposed work in terms of storage cost, computational complexity, and utility of differential privacy.