Yunwei Wang
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
Yunwei Wang has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Xinghua Li
Xidian University
16 shared publications - Yinbin Miao
Xidian University
11 shared publications - Robert Huijie Deng
Singapore Management University, Singapore, Singapore
8 shared publications - Ximeng Liu
College of Computer and Data Science, Fuzhou University, Fuzhou, China
7 shared publications - Qiuyun Tong
State Key Laboratory of Integrated Services Networks and the School of Cyber Engineering, Xidian University, Xian, China
5 shared publications - Zhan Zhang
Xidian University
4 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
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (3) , 6763-6779
Security-Enhanced Decentralized Conditional Privacy-Preserving Authentication in VANETs
To ensure the legitimacy of communicators while ad dressing the privacy concerns of vehicles in vehicular ad-hoc networks (VANETs), conditional privacy-preserving authentication (CPPA) schemes have been proposed. Given that existing schemes suffer from single point of failure due to centralized authorities, several distributed CPPA schemes have been proposed. However, these schemes all ignore the tight cementation between system secret keys and the authority, which could be a serious threat to system security, that the compromised authority may leak the system secret key. To address these issues, we propose a security enhanced decentralized conditional privacy-preserving authentication (DCPPA) scheme. DCPPA first introduces a decentralized system master key generation (DSMKG) mechanism without a centralized secret sharer, ensuring that the system secret key remains hidden from any single authority. Based on DSMKG, DCPPA then implements a lightweight verifiable pseudonym self-generation strategy without the system master secret key escrow problem, thus providing flexible pseudonym updating and reliable de-anonymization. Moreover, we implement DCPPA over a hyperelliptic curve cryptosystem (HECC) to balance the system performance. Considering the additional communication processes due to the decentralized feature, we introduce a symmetric balanced incomplete block design (SBIBD) to enhance the communication efficiency. We demonstrate the excellent security of DCPPA through an in-depth security analysis, while demonstrate that the overhead of DCPPA is at ms level through experiments.
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (3) , 6763-6779
Security-Enhanced Decentralized Conditional Privacy-Preserving Authentication in VANETs
To ensure the legitimacy of communicators while ad dressing the privacy concerns of vehicles in vehicular ad-hoc networks (VANETs), conditional privacy-preserving authentication (CPPA) schemes have been proposed. Given that existing schemes suffer from single point of failure due to centralized authorities, several distributed CPPA schemes have been proposed. However, these schemes all ignore the tight cementation between system secret keys and the authority, which could be a serious threat to system security, that the compromised authority may leak the system secret key. To address these issues, we propose a security enhanced decentralized conditional privacy-preserving authentication (DCPPA) scheme. DCPPA first introduces a decentralized system master key generation (DSMKG) mechanism without a centralized secret sharer, ensuring that the system secret key remains hidden from any single authority. Based on DSMKG, DCPPA then implements a lightweight verifiable pseudonym self-generation strategy without the system master secret key escrow problem, thus providing flexible pseudonym updating and reliable de-anonymization. Moreover, we implement DCPPA over a hyperelliptic curve cryptosystem (HECC) to balance the system performance. Considering the additional communication processes due to the decentralized feature, we introduce a symmetric balanced incomplete block design (SBIBD) to enhance the communication efficiency. We demonstrate the excellent security of DCPPA through an in-depth security analysis, while demonstrate that the overhead of DCPPA is at ms level through experiments.
- 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.
- 29 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 5521-5533
Oblivious Encrypted Keyword Search With Fine-Grained Access Control for Cloud Storage
With the rapid expansion of data volumes in cloud computing, more data owners are opting to outsource their data to cloud service providers to reduce local storage and management costs. However, data outsourcing deprives data owners of direct physical control over their data, increasing the risk of unauthorized access and exposure of sensitive information. To mitigate these risks, various privacy-preserving keyword search schemes with access control have been developed, but many are vulnerable to leakage-abuse attacks due to the exposure of access, search or volume patterns, which can lead to privacy breaches in outsourced data and queries. To solve this problem, we propose an oblivious encrypted keyword search scheme with fine-grained access control, called OEKA. It enables efficient oblivious keyword search over encrypted multi-maps by using the adapted XOR filter and distributed point function, ensuring protection of access, search and volume patterns. Moreover, OEKA enforces role-based access control by using polynomial-based access strategy and keyword-based private information retrieval, allowing access policies of retrieved objects to be detecting without revealing the objects themselves. A formal security analysis verifies the scheme’s robustness, and experimental results demonstrate its practical efficiency.
- 29 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 5521-5533
Oblivious Encrypted Keyword Search With Fine-Grained Access Control for Cloud Storage
With the rapid expansion of data volumes in cloud computing, more data owners are opting to outsource their data to cloud service providers to reduce local storage and management costs. However, data outsourcing deprives data owners of direct physical control over their data, increasing the risk of unauthorized access and exposure of sensitive information. To mitigate these risks, various privacy-preserving keyword search schemes with access control have been developed, but many are vulnerable to leakage-abuse attacks due to the exposure of access, search or volume patterns, which can lead to privacy breaches in outsourced data and queries. To solve this problem, we propose an oblivious encrypted keyword search scheme with fine-grained access control, called OEKA. It enables efficient oblivious keyword search over encrypted multi-maps by using the adapted XOR filter and distributed point function, ensuring protection of access, search and volume patterns. Moreover, OEKA enforces role-based access control by using polynomial-based access strategy and keyword-based private information retrieval, allowing access policies of retrieved objects to be detecting without revealing the objects themselves. A formal security analysis verifies the scheme’s robustness, and experimental results demonstrate its practical efficiency.
- 23 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (5) , 4183-4201
PLRQ: Practical and Less Leakage Range Query Over Encrypted Mobile Cloud Data
As a fundamental service in mobile cloud computing, range query has attracted extensive attention. But the existing secure range query schemes not only leak data privacy but also have low query efficiency. To address those issues, we first design a novel range-matched code to convert the range query into code set matching, which aims to hide the order relationship of outsourced data as well as the index of most significant different bit. Based on the designed range-matched code, we propose a P ractical and L ess Leakage R ange Q uery scheme over encrypted mobile cloud data (PLRQ) by integrating XOR filter and multiset hash function. Security analysis shows that PLRQ achieves semantic security and avoids data privacy leakage. Extensive experiments using real datasets demonstrate that, compared with two state-of-the-art solutions-RngMatch and LSRQ, our proposed PLRQ improves the query efficiency both by 2 orders of magnitude, and reduces the storage cost on Cloud Service Provider by about 79.5% and 73.6% respectively.
- 23 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (5) , 4183-4201
PLRQ: Practical and Less Leakage Range Query Over Encrypted Mobile Cloud Data
As a fundamental service in mobile cloud computing, range query has attracted extensive attention. But the existing secure range query schemes not only leak data privacy but also have low query efficiency. To address those issues, we first design a novel range-matched code to convert the range query into code set matching, which aims to hide the order relationship of outsourced data as well as the index of most significant different bit. Based on the designed range-matched code, we propose a P ractical and L ess Leakage R ange Q uery scheme over encrypted mobile cloud data (PLRQ) by integrating XOR filter and multiset hash function. Security analysis shows that PLRQ achieves semantic security and avoids data privacy leakage. Extensive experiments using real datasets demonstrate that, compared with two state-of-the-art solutions-RngMatch and LSRQ, our proposed PLRQ improves the query efficiency both by 2 orders of magnitude, and reduces the storage cost on Cloud Service Provider by about 79.5% and 73.6% respectively.
- 14 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (6) , 7652-7666
DCASR: Distributed Collaborative Authentication With Specified Security Strength and Resource Optimization Selection in AAV Networks
Collaborative authentication, boasting-enhanced accuracy, robust resilience, and optimized efficiency, holds immense promise for autonomous aerial vehicle (AAV) networks. However, existing collaborative authentication methods overlook both the credibility evaluation and incentives of participating nodes, thereby compromising authentication accuracy and resulting in failures. Furthermore, reliance on trusted decision-fusion institution introduces vulnerabilities and single points of failure. To address these issues, we design a credibility-weighted soft authentication approach specifically for AAV networks, thereby enhancing accuracy by effectively integrating the trustworthiness of collaborating nodes. To further encourage active participation from nodes, we introduce an incentive-based reputation system. Finally, based on the above approaches, we propose a distributed authentication method by leveraging blockchain technology and optimization theory that not only emphasizes security but also optimizes resource selection in AAV networks. Theoretical analysis demonstrates our scheme’s distributed authentication with minimized resource consumption under specified security strength, mitigating single points of failure and fulfilling efficient mutual authentication requirements. Experimental results show a remarkable 78.45% increase in authentication accuracy and a 44.51% reduction in resource consumption compared to advanced solution.
- 14 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (6) , 7652-7666
DCASR: Distributed Collaborative Authentication With Specified Security Strength and Resource Optimization Selection in AAV Networks
Collaborative authentication, boasting-enhanced accuracy, robust resilience, and optimized efficiency, holds immense promise for autonomous aerial vehicle (AAV) networks. However, existing collaborative authentication methods overlook both the credibility evaluation and incentives of participating nodes, thereby compromising authentication accuracy and resulting in failures. Furthermore, reliance on trusted decision-fusion institution introduces vulnerabilities and single points of failure. To address these issues, we design a credibility-weighted soft authentication approach specifically for AAV networks, thereby enhancing accuracy by effectively integrating the trustworthiness of collaborating nodes. To further encourage active participation from nodes, we introduce an incentive-based reputation system. Finally, based on the above approaches, we propose a distributed authentication method by leveraging blockchain technology and optimization theory that not only emphasizes security but also optimizes resource selection in AAV networks. Theoretical analysis demonstrates our scheme’s distributed authentication with minimized resource consumption under specified security strength, mitigating single points of failure and fulfilling efficient mutual authentication requirements. Experimental results show a remarkable 78.45% increase in authentication accuracy and a 44.51% reduction in resource consumption compared to advanced solution.
- 19 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (10) , 2405-2419
Hiding in Plain Sight: Adversarial Attack via Style Transfer on Image Borders
Deep Convolution Neural Networks (CNNs) have become the cornerstone of image classification, but the emergence of adversarial image attacks brings serious security risks to CNN-based applications. As a local perturbation attack, the border attack can achieve high success rates by only modifying the pixels around the border of an image, which is a novel attack perspective. However, existing border attacks have shortcomings in stealthiness and are easily detected. In this paper, we propose a novel stealthy border attack method based on deep feature alignment. Specifically, we propose a deep feature alignment algorithm based on style transfer to guarantee the stealthiness of adversarial borders. The algorithm takes the deep feature difference between the adversarial and the original borders as the stealthiness loss and thus ensures good stealthiness of the generated adversarial images. To ensure high attack success rates simultaneously, we apply cross entropy to design the targeted attack loss and use margin loss as well as Leaky ReLU to design the untargeted attack loss. Experiments show that the structural similarity between the generated adversarial images and the original images is 8.8% higher than the state-of-art border attack method, indicating that our proposed adversarial images have better stealthiness. At the same time, the success rate of our attack in the face of defense methods is much higher, which is about four times that of the state-of-art border attack under the adversarial training defense.
- 19 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (10) , 2405-2419
Hiding in Plain Sight: Adversarial Attack via Style Transfer on Image Borders
Deep Convolution Neural Networks (CNNs) have become the cornerstone of image classification, but the emergence of adversarial image attacks brings serious security risks to CNN-based applications. As a local perturbation attack, the border attack can achieve high success rates by only modifying the pixels around the border of an image, which is a novel attack perspective. However, existing border attacks have shortcomings in stealthiness and are easily detected. In this paper, we propose a novel stealthy border attack method based on deep feature alignment. Specifically, we propose a deep feature alignment algorithm based on style transfer to guarantee the stealthiness of adversarial borders. The algorithm takes the deep feature difference between the adversarial and the original borders as the stealthiness loss and thus ensures good stealthiness of the generated adversarial images. To ensure high attack success rates simultaneously, we apply cross entropy to design the targeted attack loss and use margin loss as well as Leaky ReLU to design the untargeted attack loss. Experiments show that the structural similarity between the generated adversarial images and the original images is 8.8% higher than the state-of-art border attack method, indicating that our proposed adversarial images have better stealthiness. At the same time, the success rate of our attack in the face of defense methods is much higher, which is about four times that of the state-of-art border attack under the adversarial training defense.
- 15 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 2746-2760
Beyond Result Verification: Efficient Privacy-Preserving Spatial Keyword Query With Suppressed Leakage
Boolean range query (BRQ) is a typical type of spatial keyword query that is widely used in geographic information systems, location-based services and other applications. It retrieves the objects inside the query range and containing all query keywords. Many privacy-preserving BRQ schemes have been proposed to support BRQ over encrypted data. However, most of them fail to achieve efficient retrieval and lightweight result verification while suppressing access and search pattern leakage. Thus, in this paper, we propose an efficient verifiable privacy-preserving Boolean range query with suppressed leakage. Firstly, we convert BRQ into multi-keyword query by using Gray code and Bloom filter. Then, we achieve efficient oblivious multi-keyword query by combining distributed point function and PRP-based Cuckoo hashing, which protects the access and search patterns. Moreover, we support lightweight and oblivious result verification based on oblivious query, aggregate MAC, keyed-hashing MAC and XOR-homomorphic pseudorandom function. It enables query users to verify the result integrity with a proof whose size is independent of the size of the outsourced dataset. Finally, formal security analysis and extensive experiments demonstrate that our proposed scheme is adaptively secure and efficient for practical applications, respectively.
- 15 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 2746-2760
Beyond Result Verification: Efficient Privacy-Preserving Spatial Keyword Query With Suppressed Leakage
Boolean range query (BRQ) is a typical type of spatial keyword query that is widely used in geographic information systems, location-based services and other applications. It retrieves the objects inside the query range and containing all query keywords. Many privacy-preserving BRQ schemes have been proposed to support BRQ over encrypted data. However, most of them fail to achieve efficient retrieval and lightweight result verification while suppressing access and search pattern leakage. Thus, in this paper, we propose an efficient verifiable privacy-preserving Boolean range query with suppressed leakage. Firstly, we convert BRQ into multi-keyword query by using Gray code and Bloom filter. Then, we achieve efficient oblivious multi-keyword query by combining distributed point function and PRP-based Cuckoo hashing, which protects the access and search patterns. Moreover, we support lightweight and oblivious result verification based on oblivious query, aggregate MAC, keyed-hashing MAC and XOR-homomorphic pseudorandom function. It enables query users to verify the result integrity with a proof whose size is independent of the size of the outsourced dataset. Finally, formal security analysis and extensive experiments demonstrate that our proposed scheme is adaptively secure and efficient for practical applications, respectively.
- 15 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (6) , 4591-4604
Privacy-Preserving and Verifiable Outsourcing Linear Inference Computing Framework
In machine learning (ML), the massive data processing and dense computations based on matrices make outsourced inference computation a growing trend. The unreliability of cloud platforms makes privacy protection and inference correctness increasingly important in outsourced computations. Unfortunately, current works cannot provide an effective verification mechanism and privacy protection for outsourcing linear computing simultaneously. To address the issue, in the service architectures with malicious behaviors (such as curiosity, dishonesty, and collusion), we propose privacy-preserving and verifiable outsourcing inference computing (PPVLC) for the most fundamental linear computations in ML. PPVLC uses secret sharing and blinding techniques to protect privacy and achieve secure computation of matrix linear computation. Meanwhile, bilinear mapping based on matrix digest is utilized to verify computation correctness, ensuring the trustworthiness of the service. Security analysis and experiments demonstrate the reliability of our scheme and service efficiency.
- 15 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (6) , 4591-4604
Privacy-Preserving and Verifiable Outsourcing Linear Inference Computing Framework
In machine learning (ML), the massive data processing and dense computations based on matrices make outsourced inference computation a growing trend. The unreliability of cloud platforms makes privacy protection and inference correctness increasingly important in outsourced computations. Unfortunately, current works cannot provide an effective verification mechanism and privacy protection for outsourcing linear computing simultaneously. To address the issue, in the service architectures with malicious behaviors (such as curiosity, dishonesty, and collusion), we propose privacy-preserving and verifiable outsourcing inference computing (PPVLC) for the most fundamental linear computations in ML. PPVLC uses secret sharing and blinding techniques to protect privacy and achieve secure computation of matrix linear computation. Meanwhile, bilinear mapping based on matrix digest is utilized to verify computation correctness, ensuring the trustworthiness of the service. Security analysis and experiments demonstrate the reliability of our scheme and service efficiency.