Zhe Ren
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
Research Subjects
Zhe Ren has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Xinghua Li
Xidian University
12 shared publications - Robert Huijie Deng
Singapore Management University, Singapore, Singapore
8 shared publications - Yinbin Miao
Xidian University
6 shared publications - Yunwei Wang
State Key Laboratory of Integrated Services Networks and the School of Cyber Engineering, Xidian University, Xian, China
4 shared publications - Zhan Zhang
Xidian University
4 shared publications - Zhuowen Li
State Key Laboratory of Integrated Services Networks and the School of Cyber Engineering, Xidian University, Xian, China
3 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (11) , 7564-7580
Hi-Chain: Hierarchical and Intelligent Blockchain Data Storage Scheme for UAV Networks
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (11) , 7564-7580
Hi-Chain: Hierarchical and Intelligent Blockchain Data Storage Scheme for UAV Networks
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (4) , 8388-8402
An Auction-Based Bilateral Bidding Privacy Protection Scheme in Multi-Platform MCS
With the advancement of smart terminals and communication technologies, the emergence of heterogeneous Service Subscribers (SSs) and diverse sensing demands has facilitated the development of multi-platform Mobile CrowdSensing (MCS) scenarios. However, unlike traditional single-platform scenarios, Mobile Users' (MUs) bidding privacy is hard to protect in multi platform MCS. Additionally, the privacy disclosure issue of SSs has not been well addressed. To tackle these issues, in this paper, we propose a bilateral, auction-based scheme to preserve bidding privacy in multi-platform MCS, thereby protecting the interests of both SSs and MUs. Specifically, since SSs and MUs strategically choose one another to maximize their utility, we construct the corresponding selection processes for both sides by taking advantage of auction pricing theory. We firstly design a user-oriented forward auction that integrates the 0-1 knapsack problem with the Paillier encryption algorithm to protect the bidding information of both SSs and MUs. Then, we employ the Chinese Remainder Theorem (CRT) to design a reverse auction that hides the bidding behaviors of MUs. Theoretical analysis demonstrates that our scheme can protect the bidding privacy of both parties while ensuring economic robustness. Extensive experiments on a real dataset demonstrate that, compared with existing works, our scheme enables both SSs and MUs to achieve satisfactory utility while maintaining low computational overhead.
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (4) , 8388-8402
An Auction-Based Bilateral Bidding Privacy Protection Scheme in Multi-Platform MCS
With the advancement of smart terminals and communication technologies, the emergence of heterogeneous Service Subscribers (SSs) and diverse sensing demands has facilitated the development of multi-platform Mobile CrowdSensing (MCS) scenarios. However, unlike traditional single-platform scenarios, Mobile Users' (MUs) bidding privacy is hard to protect in multi platform MCS. Additionally, the privacy disclosure issue of SSs has not been well addressed. To tackle these issues, in this paper, we propose a bilateral, auction-based scheme to preserve bidding privacy in multi-platform MCS, thereby protecting the interests of both SSs and MUs. Specifically, since SSs and MUs strategically choose one another to maximize their utility, we construct the corresponding selection processes for both sides by taking advantage of auction pricing theory. We firstly design a user-oriented forward auction that integrates the 0-1 knapsack problem with the Paillier encryption algorithm to protect the bidding information of both SSs and MUs. Then, we employ the Chinese Remainder Theorem (CRT) to design a reverse auction that hides the bidding behaviors of MUs. Theoretical analysis demonstrates that our scheme can protect the bidding privacy of both parties while ensuring economic robustness. Extensive experiments on a real dataset demonstrate that, compared with existing works, our scheme enables both SSs and MUs to achieve satisfactory utility while maintaining low computational overhead.
- 10 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (3) , 7226-7241
Traceable Cross-Domain Data Sharing With Expressive Keyword Search
The Internet of Vehicles (IoV) generates massive sensitive perception data, typically managed by manufacturer-specific domains. While encryption with domain-specific parameters protects confidentiality, many IoV applications require secure cross-domain data sharing to access complementary information, and expressive keyword search for efficient access. However, existing Attribute-Based Keyword Search (ABKS) schemes are designed for single-domain settings, and thus cannot address heterogeneous key management or provide traceability without a universally trusted authority. To address these issues, we propose TCroS, a traceable cross-domain data sharing scheme that generalizes CP-ABE via proxy re-encryption mechanism, enabling ciphertexts generated in one domain to be securely transformed for authorized requesters in another. To provide traceability, TCroS embeds requester identities into decryption keys using Boneh-Boyen signatures, allowing any party (rather than the universally trusted authority) to trace the source of a leaked key. We further extend TCroS to TCroSS, which incorporates privacy-preserving expressive keyword search supporting Boolean queries, thereby enabling efficient retrieval of authorized data while resisting keyword guessing attacks. Formal security analysis proves that our schemes achieve IND-SCPA and IND-SCKA security. Experimental results demonstrate their practicality, showing that cross-domain sharing can be realized with computation and storage overheads comparable to single-domain setting.
- 10 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (3) , 7226-7241
Traceable Cross-Domain Data Sharing With Expressive Keyword Search
The Internet of Vehicles (IoV) generates massive sensitive perception data, typically managed by manufacturer-specific domains. While encryption with domain-specific parameters protects confidentiality, many IoV applications require secure cross-domain data sharing to access complementary information, and expressive keyword search for efficient access. However, existing Attribute-Based Keyword Search (ABKS) schemes are designed for single-domain settings, and thus cannot address heterogeneous key management or provide traceability without a universally trusted authority. To address these issues, we propose TCroS, a traceable cross-domain data sharing scheme that generalizes CP-ABE via proxy re-encryption mechanism, enabling ciphertexts generated in one domain to be securely transformed for authorized requesters in another. To provide traceability, TCroS embeds requester identities into decryption keys using Boneh-Boyen signatures, allowing any party (rather than the universally trusted authority) to trace the source of a leaked key. We further extend TCroS to TCroSS, which incorporates privacy-preserving expressive keyword search supporting Boolean queries, thereby enabling efficient retrieval of authorized data while resisting keyword guessing attacks. Formal security analysis proves that our schemes achieve IND-SCPA and IND-SCKA security. Experimental results demonstrate their practicality, showing that cross-domain sharing can be realized with computation and storage overheads comparable to single-domain setting.
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 2147-2161
Efficient Revocable Conditional Anonymous Authentication With Verifiable Self-Generated Pseudonyms for VANETs
Pseudonym self-generation (PSG) is essential for Conditional Anonymous Authentication (CAA) in Vehicular Adhoc Networks (VANETs), enabling vehicles to autonomously create communication identities without centralized control. However, existing self-generation schemes face two problems: efficiently revoking malicious vehicles remains difficult, and hardware-independent solutions additionally struggle to verify the legitimacy of pseudonyms. To overcome these issues, we propose an efficient Revocable CAA scheme with Verifiable Self-generated Pseudonyms for VANETs (RCAAVSP). First, a Traceable Chameleon Hash (TCH) function is designed to implicit membership through TCH collision, enforcing verifiable and unlinkable pseudonym generation. And then a multi-parameter authentication mechanism leveraging dynamic accumulators, which achieves O(1)-complexity revocation via domain membership polynomial updates without system-wide reconfiguration. Formal security analysis demonstrates the semantic security of our proposed scheme under the random oracle model, with proven resilience against common attacks. Experimental evaluations demonstrate that RCAAVSP achieves a 76% relative improvement in pseudonym generation efficiency, while maintaining the overhead of anonymous authentication and malicious vehicle revocation at ms-level, providing a lightweight solution for secure VANET communication.
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 2147-2161
Efficient Revocable Conditional Anonymous Authentication With Verifiable Self-Generated Pseudonyms for VANETs
Pseudonym self-generation (PSG) is essential for Conditional Anonymous Authentication (CAA) in Vehicular Adhoc Networks (VANETs), enabling vehicles to autonomously create communication identities without centralized control. However, existing self-generation schemes face two problems: efficiently revoking malicious vehicles remains difficult, and hardware-independent solutions additionally struggle to verify the legitimacy of pseudonyms. To overcome these issues, we propose an efficient Revocable CAA scheme with Verifiable Self-generated Pseudonyms for VANETs (RCAAVSP). First, a Traceable Chameleon Hash (TCH) function is designed to implicit membership through TCH collision, enforcing verifiable and unlinkable pseudonym generation. And then a multi-parameter authentication mechanism leveraging dynamic accumulators, which achieves O(1)-complexity revocation via domain membership polynomial updates without system-wide reconfiguration. Formal security analysis demonstrates the semantic security of our proposed scheme under the random oracle model, with proven resilience against common attacks. Experimental evaluations demonstrate that RCAAVSP achieves a 76% relative improvement in pseudonym generation efficiency, while maintaining the overhead of anonymous authentication and malicious vehicle revocation at ms-level, providing a lightweight solution for secure VANET communication.
- 30 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 12173-12187
Efficient One-to-Many Authentication With Intelligent Illegal Request Identification for UAV Networks
In Unmanned Aerial Vehicle (UAV) networks, UAVs usually perform tasks in the form of groups. When tasks change, the Ground Control Station (GCS) will assign the complemental UAV to join the group for notification or reinforcement. Since UAVs communicate over open wireless channels, secure authentication is required for complemental UAV joining the group. However, one-by-one authentication between complemental UAV and the group members leads to high overhead and delays. At the same time, when the UAV group is far away from the coverage of the GCS, the GCS is unable to assist the authentication process in real-time. To solve the above problems, we propose a one-to-many UAV authentication scheme using Identity-Based Broadcast Encryption (IBBE) and batch authentication. This scheme does not require a trusted third party to be online in real time. We also design an algorithm based on reinforcement learning for identifying illegal requests during batch authentication, enhancing efficiency and ensuring successful authentication. Our scheme meets UAV networks’ security requirements, defending against various attacks. Experimental results show that it reduces computational overhead by 55.27% and communication overhead by 23.16% compared to similar schemes. Additionally, the illegal request identification algorithm reduces identification numbers by 15.44% to 25.72% and lowers latency by 14.64% to 25.12% compared to existing methods.
- 30 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 12173-12187
Efficient One-to-Many Authentication With Intelligent Illegal Request Identification for UAV Networks
In Unmanned Aerial Vehicle (UAV) networks, UAVs usually perform tasks in the form of groups. When tasks change, the Ground Control Station (GCS) will assign the complemental UAV to join the group for notification or reinforcement. Since UAVs communicate over open wireless channels, secure authentication is required for complemental UAV joining the group. However, one-by-one authentication between complemental UAV and the group members leads to high overhead and delays. At the same time, when the UAV group is far away from the coverage of the GCS, the GCS is unable to assist the authentication process in real-time. To solve the above problems, we propose a one-to-many UAV authentication scheme using Identity-Based Broadcast Encryption (IBBE) and batch authentication. This scheme does not require a trusted third party to be online in real time. We also design an algorithm based on reinforcement learning for identifying illegal requests during batch authentication, enhancing efficiency and ensuring successful authentication. Our scheme meets UAV networks’ security requirements, defending against various attacks. Experimental results show that it reduces computational overhead by 55.27% and communication overhead by 23.16% compared to similar schemes. Additionally, the illegal request identification algorithm reduces identification numbers by 15.44% to 25.72% and lowers latency by 14.64% to 25.12% compared to existing methods.
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 3645-3658
PIC-BI: Practical and Intelligent Combinatorial Batch Identification for UAV assisted IoT Networks
Unmanned Aerial Vehicle (UAV)-assisted IoT networks are receiving a lot of attention in academia and industry. For instance, a UAV can fly and hover over sensors, during which time the sensors simultaneously initiate batch access requests to the UAV. Typically, UAV employs batch authentication to efficiently handle these batch accesses. However, an attacker can initiate illegal requests, causing batch authentication to fail. There are various batch identification algorithms to find illegal requests, enabling legitimate sensors to establish service connections quickly. Existing work wants to choose a suitable one based on the specific attack scenario. However, existing work assumes that the percentage r% of illegal requests is known in advance, which is impractical in real-world scenarios. Besides, existing work only selects a suitable batch identification algorithm based on r%, limiting the performance of batch identification to the capabilities of the alternative algorithms. Drawing inspiration from the Kalman filter, we first propose an adaptive estimation algorithm for the number of illegal requests to address the above problems. Based on the estimated value e%, we design a combinatorial batch identification using reinforcement learning. This approach allows the combination of different algorithms to achieve superior performance. Extensive experiments demonstrate that, for the estimation algorithm, the relative error is less than 20% in 27 out of 40 experiments. Regarding the combinatorial algorithms, the delay can be reduced by approximately 7.15% to 30.86% compared to existing methods.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 3645-3658
Open AccessPIC-BI: Practical and Intelligent Combinatorial Batch Identification for UAV assisted IoT Networks
Unmanned Aerial Vehicle (UAV)-assisted IoT networks are receiving a lot of attention in academia and industry. For instance, a UAV can fly and hover over sensors, during which time the sensors simultaneously initiate batch access requests to the UAV. Typically, UAV employs batch authentication to efficiently handle these batch accesses. However, an attacker can initiate illegal requests, causing batch authentication to fail. There are various batch identification algorithms to find illegal requests, enabling legitimate sensors to establish service connections quickly. Existing work wants to choose a suitable one based on the specific attack scenario. However, existing work assumes that the percentage r% of illegal requests is known in advance, which is impractical in real-world scenarios. Besides, existing work only selects a suitable batch identification algorithm based on r%, limiting the performance of batch identification to the capabilities of the alternative algorithms. Drawing inspiration from the Kalman filter, we first propose an adaptive estimation algorithm for the number of illegal requests to address the above problems. Based on the estimated value e%, we design a combinatorial batch identification using reinforcement learning. This approach allows the combination of different algorithms to achieve superior performance. Extensive experiments demonstrate that, for the estimation algorithm, the relative error is less than 20% in 27 out of 40 experiments. Regarding the combinatorial algorithms, the delay can be reduced by approximately 7.15% to 30.86% compared to existing methods.
- 11 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 33 (2) , 570-582
Deep Reinforcement Learning Based Scheduling Strategy in Blockchain Payment Channel Networks
With the popularity of blockchains, low transaction throughput has become a significant bottleneck in applications such as cryptocurrencies. Payment channel networks (PCNs) have received attention as a way to improve throughput. However, due to the difficulty of predicting future transactions for nodes, the transactions are prone to failure when the channel balances do not meet required conditions. It has been shown that increasing buffers (queues) in PCNs can increase the success rate of transactions and throughput. Nevertheless, there is no effective transaction scheduling strategy in buffers when transaction values are flexible and variable. To solve this problem, we first formulate the Scheduling Problem in PCNs (named PSP), and then prove it is NP-hard. We design a neural network solver based on the Sequence to Sequence (Seq2Seq) architecture and train the solver using the reinforcement learning method. With the solver, we first give two scheduling strategies to maximize transaction throughput, and then design a PCN simulator for performance evaluation. Extensive experiments are conducted to show the superiority and various performances of our proposal and illustrate that our proposal can get a significant advantage in terms of the transaction throughput compared to the existing works.
- 11 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 33 (2) , 570-582
Deep Reinforcement Learning Based Scheduling Strategy in Blockchain Payment Channel Networks
With the popularity of blockchains, low transaction throughput has become a significant bottleneck in applications such as cryptocurrencies. Payment channel networks (PCNs) have received attention as a way to improve throughput. However, due to the difficulty of predicting future transactions for nodes, the transactions are prone to failure when the channel balances do not meet required conditions. It has been shown that increasing buffers (queues) in PCNs can increase the success rate of transactions and throughput. Nevertheless, there is no effective transaction scheduling strategy in buffers when transaction values are flexible and variable. To solve this problem, we first formulate the Scheduling Problem in PCNs (named PSP), and then prove it is NP-hard. We design a neural network solver based on the Sequence to Sequence (Seq2Seq) architecture and train the solver using the reinforcement learning method. With the solver, we first give two scheduling strategies to maximize transaction throughput, and then design a PCN simulator for performance evaluation. Extensive experiments are conducted to show the superiority and various performances of our proposal and illustrate that our proposal can get a significant advantage in terms of the transaction throughput compared to the existing works.
- 24 April 2024
- Published by Elsevier in Computer Networks
- Vol. 247
A new three-factor authentication scheme using Chebyshev chaotic map for peer-to-peer Industrial Internet of Things
- 24 April 2024
- Published by Elsevier in Computer Networks
- Vol. 247
A new three-factor authentication scheme using Chebyshev chaotic map for peer-to-peer Industrial Internet of Things