Luqi Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Luqi Huang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Fuchun Guo
University of Wollongong
5 shared publications - Willy Susilo
Institute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong, Wollongong, NSW 2522, Australia
5 shared publications - Chunhe Xia
Beihang University
2 shared publications - Ni Li
College of Computer Science and Technology, Xi’an University of Science and Technology, Xi’an, China
2 shared publications - Tianbo Wang
Beihang University
2 shared publications - Wenchao Li
School of Cyber Science and Technology, Beihang University, Beijing, China
2 shared publications
Latest Publications
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (1) , 437-448
IoT-Cloud Data Sharing and Access Control System With Efficient Policy Updating
The integration of the Internet of Things (IoT) with cloud computing has expanded the scope of IoT applications but also introduced challenges in dynamic data management. Attribute-Based Encryption (ABE) serves as a crucial technology for constructing access control systems in data sharing environ ments. ABE schemes with policy updating capabilities allow data owners to dynamically and frequently modify access policies. Existing ABE schemes typically outsource the task of policy updating to a cloud server; however, the size of the update keys remains linear with the number of updated attributes and depends on the types of updated gates. The resulting updating costs are not less than generating a new ciphertext for data owners, especially when updating multiple attributes and threshold gates. Therefore, in this paper, we propose a novel ABE scheme, termed Policy Updatable Ciphertext-Policy ABE (PU CP-ABE), which enables efficient and flexible policy updating. Our construction ensures that the size of update keys depends only on the number of updating gates, independent of both the number of attributes and the gate types. Furthermore, PU-CP ABE provides a unified update mechanism that supports AND, OR, and threshold gates without requiring distinct update keys for different gate types.
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (1) , 437-448
IoT-Cloud Data Sharing and Access Control System With Efficient Policy Updating
The integration of the Internet of Things (IoT) with cloud computing has expanded the scope of IoT applications but also introduced challenges in dynamic data management. Attribute-Based Encryption (ABE) serves as a crucial technology for constructing access control systems in data sharing environ ments. ABE schemes with policy updating capabilities allow data owners to dynamically and frequently modify access policies. Existing ABE schemes typically outsource the task of policy updating to a cloud server; however, the size of the update keys remains linear with the number of updated attributes and depends on the types of updated gates. The resulting updating costs are not less than generating a new ciphertext for data owners, especially when updating multiple attributes and threshold gates. Therefore, in this paper, we propose a novel ABE scheme, termed Policy Updatable Ciphertext-Policy ABE (PU CP-ABE), which enables efficient and flexible policy updating. Our construction ensures that the size of update keys depends only on the number of updating gates, independent of both the number of attributes and the gate types. Furthermore, PU-CP ABE provides a unified update mechanism that supports AND, OR, and threshold gates without requiring distinct update keys for different gate types.
- 23 October 2025
- Published by Springer Nature
- p. 62-81
Public Verifiable Server-Aided Revocable Attribute-Based Encryption
- 23 October 2025
- Published by Springer Nature
- p. 62-81
Public Verifiable Server-Aided Revocable Attribute-Based Encryption
- 10 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (9) , 14483-14500
Fine-Grained Access Control With Privacy-Preserving Data Retrieval for Cloud-Assisted IoV
In addition to the autonomous driving technology of single vehicles, the inter-group control algorithm serving the data sharing of multi-vehicle cooperative driving has also attracted widespread attention. To ensure secure communication, many encryption schemes have been proposed to protect the interaction data between vehicles. Nevertheless, traditional public key encryption schemes hinder the sharing of encrypted data. Based on the premise of ensuring the confidentiality of encrypted information, in order to facilitate efficient data sharing, conduct data searches across extensive cloud-based datasets, and authorize access under specified conditions, we introduce Fine-Grained Access Control with Privacy-Preserving Data Retrieval (FGAC-PPDR) for the Internet of Vehicles. This scheme offers a secure, flexible, and privacy-centric approach to data sharing for groups of vehicles in the IoV. Our proposed scheme enables encrypted data to be retrieved at the group level by the cloud server, and prevents vehicles outside the group from performing equality tests on the ciphertext. Furthermore, the data owner can create an authorization token with defined conditions to specify how the data is shared. During the process of data search and sharing, intensive computing tasks are undertaken by cloud servers with abundant computational resources. We also demonstrate that our scheme is secure against chosen ciphertext attacks (CCA). Finally, we provide security and performance analyses that verify the feasibility and effectiveness of our proposal.
- 10 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (9) , 14483-14500
Fine-Grained Access Control With Privacy-Preserving Data Retrieval for Cloud-Assisted IoV
In addition to the autonomous driving technology of single vehicles, the inter-group control algorithm serving the data sharing of multi-vehicle cooperative driving has also attracted widespread attention. To ensure secure communication, many encryption schemes have been proposed to protect the interaction data between vehicles. Nevertheless, traditional public key encryption schemes hinder the sharing of encrypted data. Based on the premise of ensuring the confidentiality of encrypted information, in order to facilitate efficient data sharing, conduct data searches across extensive cloud-based datasets, and authorize access under specified conditions, we introduce Fine-Grained Access Control with Privacy-Preserving Data Retrieval (FGAC-PPDR) for the Internet of Vehicles. This scheme offers a secure, flexible, and privacy-centric approach to data sharing for groups of vehicles in the IoV. Our proposed scheme enables encrypted data to be retrieved at the group level by the cloud server, and prevents vehicles outside the group from performing equality tests on the ciphertext. Furthermore, the data owner can create an authorization token with defined conditions to specify how the data is shared. During the process of data search and sharing, intensive computing tasks are undertaken by cloud servers with abundant computational resources. We also demonstrate that our scheme is secure against chosen ciphertext attacks (CCA). Finally, we provide security and performance analyses that verify the feasibility and effectiveness of our proposal.
- 20 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 2621-2631
A New Functional Encryption Scheme Supporting Privacy-Preserving Maximum Similarity for Web Service Platforms
As a common metric, maximum similarity between two objects is widely employed by web platforms to provide matching services. However, the calculation of maximum similarity involves numerous sensitive or confidential users’ data, and the web platform server is often not trusted who might peep these data out of curiosity, or even worse sell them to unauthorized entities to make profits. Therefore, many research lines on functional encryption have been suggested and studied on how to calculate the maximum similarity while ensure the privacy of users’ data. Unfortunately, all of them will divulge some intermediate results to the web platform server when processing this issue. In this paper we present a new functional encryption scheme supporting privacy-preserving maximum similarity, which enables the web service platforms to figure out the maximum similarity without learning anything else about their data. Moreover, we provide a formal analysis to prove the security of the proposed scheme, followed by some experimental evaluations and comprehensive comparisons with the related works. It shows that, our scheme is the first functional encryption realization on maximum similarity without divulging the intermediate result and meanwhile achieve a higher security-function privacy, as well as a traditional data privacy.
- 20 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 2621-2631
A New Functional Encryption Scheme Supporting Privacy-Preserving Maximum Similarity for Web Service Platforms
As a common metric, maximum similarity between two objects is widely employed by web platforms to provide matching services. However, the calculation of maximum similarity involves numerous sensitive or confidential users’ data, and the web platform server is often not trusted who might peep these data out of curiosity, or even worse sell them to unauthorized entities to make profits. Therefore, many research lines on functional encryption have been suggested and studied on how to calculate the maximum similarity while ensure the privacy of users’ data. Unfortunately, all of them will divulge some intermediate results to the web platform server when processing this issue. In this paper we present a new functional encryption scheme supporting privacy-preserving maximum similarity, which enables the web service platforms to figure out the maximum similarity without learning anything else about their data. Moreover, we provide a formal analysis to prove the security of the proposed scheme, followed by some experimental evaluations and comprehensive comparisons with the related works. It shows that, our scheme is the first functional encryption realization on maximum similarity without divulging the intermediate result and meanwhile achieve a higher security-function privacy, as well as a traditional data privacy.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (5) , 5148-5159
Two Practical Attribute-Based Encryption Schemes for Privacy-Preserving Mobile Location-Sharing Applications
Location sharing, as an essential component of mobile applications, helps mobile users share location information and enhance their community connections. However, users may be reluctant to share their locations with personal privacy concerns, as anyone including location server who knows these locations can infer much sensitive information about users through analyzing these locations’ information plus their background knowledge. Therefore, it poses a natural question for mobile location-sharing applications how to share users’ locations without any breach of their privacy. To answer this question, in this paper we describe two practical attribute based encryption schemes served privacy-preserving mobile location-sharing applications. Our proposals are quite suitable for such a mobile application – location sharing with common interests since in our designs users’ interests are also taken into consideration as well as location information. In particular, our two schemes have a higher performance in the sense that in our first construction both ciphertexts and private keys are of constant size simultaneously, and our second construction is an extension of the first that provides a tradeoff between ciphertext size and public key size. Therefore, the two schemes we designed in this work are quite practical in mobile applications which are often equipped with limited transmission or storage resources. Finally, we offer a formal security proof under a well-defined security model, followed by an experimental evaluation and a theoretical performance comparison.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (5) , 5148-5159
Two Practical Attribute-Based Encryption Schemes for Privacy-Preserving Mobile Location-Sharing Applications
Location sharing, as an essential component of mobile applications, helps mobile users share location information and enhance their community connections. However, users may be reluctant to share their locations with personal privacy concerns, as anyone including location server who knows these locations can infer much sensitive information about users through analyzing these locations’ information plus their background knowledge. Therefore, it poses a natural question for mobile location-sharing applications how to share users’ locations without any breach of their privacy. To answer this question, in this paper we describe two practical attribute based encryption schemes served privacy-preserving mobile location-sharing applications. Our proposals are quite suitable for such a mobile application – location sharing with common interests since in our designs users’ interests are also taken into consideration as well as location information. In particular, our two schemes have a higher performance in the sense that in our first construction both ciphertexts and private keys are of constant size simultaneously, and our second construction is an extension of the first that provides a tradeoff between ciphertext size and public key size. Therefore, the two schemes we designed in this work are quite practical in mobile applications which are often equipped with limited transmission or storage resources. Finally, we offer a formal security proof under a well-defined security model, followed by an experimental evaluation and a theoretical performance comparison.
- 16 July 2024
- Published by Springer Nature
- p. 241-260
Key Cooperative Attribute-Based Encryption
- 11 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (6) , 5359-5373
Secure Data Integrity Check Based on Verified Public Key Encryption With Equality Test for Multi-Cloud Storage
Cloud computing eliminates the need for local hardware, addressing the challenge of high computing expenses. However, entrusting data to the cloud may pose the risk of unintentional data loss. Using multiple copies and multi-cloud servers is promising because even if the data on one cloud storage server is compromised, the data proprietor can retrieve the information from alternate cloud storage servers. To protect data security, data needs to be encrypted before uploading to the cloud. However, users cannot directly confirm whether their encrypted documents and copies are stored securely and with integrity on cloud servers. To verify data copies on remote servers without downloading and decrypting, we propose Public Verification Public Key Encryption with Equality Test (PVPKEET). Under PVPKEET, users upload encrypted data to cloud servers, and then the test result and proof will be provided by the cloud server without decryption. The publicly verified proof can be examined by all users, allowing everyone to witness the copies stored correctly. Our approach is resistant to chosen-plaintext attacks and is verifiable. A comparison with prior research demonstrates the efficiency and feasibility of our design.
- 11 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (6) , 5359-5373
Secure Data Integrity Check Based on Verified Public Key Encryption With Equality Test for Multi-Cloud Storage
Cloud computing eliminates the need for local hardware, addressing the challenge of high computing expenses. However, entrusting data to the cloud may pose the risk of unintentional data loss. Using multiple copies and multi-cloud servers is promising because even if the data on one cloud storage server is compromised, the data proprietor can retrieve the information from alternate cloud storage servers. To protect data security, data needs to be encrypted before uploading to the cloud. However, users cannot directly confirm whether their encrypted documents and copies are stored securely and with integrity on cloud servers. To verify data copies on remote servers without downloading and decrypting, we propose Public Verification Public Key Encryption with Equality Test (PVPKEET). Under PVPKEET, users upload encrypted data to cloud servers, and then the test result and proof will be provided by the cloud server without decryption. The publicly verified proof can be examined by all users, allowing everyone to witness the copies stored correctly. Our approach is resistant to chosen-plaintext attacks and is verifiable. A comparison with prior research demonstrates the efficiency and feasibility of our design.