Liang Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Liang Liu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Fagen Li
University of Electronic Science and Technology of China
4 shared publications - Jingting Xue
Southwest Petroleum University
4 shared publications - Xiaojun Zhang
Southwest Petroleum University
4 shared publications - Wenzheng Zhang
Institute of Southwestern Communication
3 shared publications Yu Zhou
Science and Technology on Communication Security Laboratory, Institute of Southwestern Communication, Chengdu, China
2 shared publications- Lingjie Shi
School of Computer Science, Research Center for Cyber Security, Southwest Petroleum University, Chengdu, China
1 shared publication
Latest Publications
- 13 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (15) , 29570-29583
Attribute-Based Policy-Hiding Redactable Blockchain With Authorizable Verification for Energy Internet
The goal of the energy internet is to enable communication between distributed energy endpoints to facilitate information exchange and trading matching. Blockchain, which ensures content consistency, bridges the gaps between multiple energy stakeholders and satisfies the need for universal trust. However, applying blockchain directly in peer-to-peer trading can result in the permanent inclusion of illegal or outdated data in blockchain databases, hindering efficient interaction. Driven by emerging application requirements and legal regulations, redactable blockchain (EuroS&P 2017) was introduced, allowing the block history to be rewritten via collisions in chameleon hash functions (CHFs). Nevertheless, current solutions still face challenges, including trapdoor security risks, privacy leakage, and indefinite redactions. This article presents a redactable energy blockchain scheme (REBS) with partially attribute-based policy hiding, which enables controlled multiauthority key generation and redactor attribute verification. To prevent the abuse of redaction permission, REBS employs time-updatable CHFs for redaction. Additionally, we design a delegation algorithm that adds dynamic flexibility to attribute verification nodes, permitting them to delegate key share distribution authority to other nodes on demand. The detailed security proofs and performance evaluations demonstrate the feasibility of REBS.
- 13 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (15) , 29570-29583
Attribute-Based Policy-Hiding Redactable Blockchain With Authorizable Verification for Energy Internet
The goal of the energy internet is to enable communication between distributed energy endpoints to facilitate information exchange and trading matching. Blockchain, which ensures content consistency, bridges the gaps between multiple energy stakeholders and satisfies the need for universal trust. However, applying blockchain directly in peer-to-peer trading can result in the permanent inclusion of illegal or outdated data in blockchain databases, hindering efficient interaction. Driven by emerging application requirements and legal regulations, redactable blockchain (EuroS&P 2017) was introduced, allowing the block history to be rewritten via collisions in chameleon hash functions (CHFs). Nevertheless, current solutions still face challenges, including trapdoor security risks, privacy leakage, and indefinite redactions. This article presents a redactable energy blockchain scheme (REBS) with partially attribute-based policy hiding, which enables controlled multiauthority key generation and redactor attribute verification. To prevent the abuse of redaction permission, REBS employs time-updatable CHFs for redaction. Additionally, we design a delegation algorithm that adds dynamic flexibility to attribute verification nodes, permitting them to delegate key share distribution authority to other nodes on demand. The detailed security proofs and performance evaluations demonstrate the feasibility of REBS.
- 21 April 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 18 (3) , 1-19
Incentive-assisted multi-keyword ranked searchable encryption with hidden attributes for community data sharing
- 21 April 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 18 (3) , 1-19
Incentive-assisted multi-keyword ranked searchable encryption with hidden attributes for community data sharing
- 30 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 12 (4) , 1232-1247
Attribute-Based Hierarchical Keyword Auditing With Batch Fault Localization Assisted by Smart Contracts
Keyword-based auditing (KA) provides a means for users to verify the integrity of only the outsourced data they are interested in. Existing KA schemes employ relation authentication labels to conduct targeted audits with keywords, which significantly improves the cost-effectiveness. However, such schemes typically support only a single-challenge scenario, which may not always be practical. To overcome this constraint, we introduce a hierarchical challenge mechanism grounded in user attributes. This mechanism leverages inequality and affiliation relationships to comply with a predefined tree structure for access policies. Incorporated during the challenge-response phase of the auditing model, it permits users to initiate cross-challenges. Expanding upon this hierarchical mechanism, we propose an attribute-based hierarchical keyword auditing scheme, abbreviated as ${\mathcal{AHKA}}$x . ${\mathcal{AHKA}}$x combines searchable encryption to conduct cross-targeted audits and benefits from the hash collision mapping of Bloom filters to safeguard against keyword guessing attacks. Moreover, we design a fault localization algorithm based on a variant of the binary search technique. It locates in batch the faulty cloud servers and damaged data blocks after an audit failure. As an integral part of ${\mathcal{AHKA}}$x , the algorithm significantly enhances our scheme's practicability. Security analyses indicate that ${\mathcal{AHKA}}$x can effectively withstand both forgery and replace attacks on audit proofs. The smart contract component ensures that our scheme's processes can be monitored and regulated. Experimental data corroborate that deploying ${\mathcal{AHKA}}$x on the client side and on the blockchain is both efficient and feasible.
- 30 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 12 (4) , 1232-1247
Attribute-Based Hierarchical Keyword Auditing With Batch Fault Localization Assisted by Smart Contracts
Keyword-based auditing (KA) provides a means for users to verify the integrity of only the outsourced data they are interested in. Existing KA schemes employ relation authentication labels to conduct targeted audits with keywords, which significantly improves the cost-effectiveness. However, such schemes typically support only a single-challenge scenario, which may not always be practical. To overcome this constraint, we introduce a hierarchical challenge mechanism grounded in user attributes. This mechanism leverages inequality and affiliation relationships to comply with a predefined tree structure for access policies. Incorporated during the challenge-response phase of the auditing model, it permits users to initiate cross-challenges. Expanding upon this hierarchical mechanism, we propose an attribute-based hierarchical keyword auditing scheme, abbreviated as ${\mathcal{AHKA}}$x . ${\mathcal{AHKA}}$x combines searchable encryption to conduct cross-targeted audits and benefits from the hash collision mapping of Bloom filters to safeguard against keyword guessing attacks. Moreover, we design a fault localization algorithm based on a variant of the binary search technique. It locates in batch the faulty cloud servers and damaged data blocks after an audit failure. As an integral part of ${\mathcal{AHKA}}$x , the algorithm significantly enhances our scheme's practicability. Security analyses indicate that ${\mathcal{AHKA}}$x can effectively withstand both forgery and replace attacks on audit proofs. The smart contract component ensures that our scheme's processes can be monitored and regulated. Experimental data corroborate that deploying ${\mathcal{AHKA}}$x on the client side and on the blockchain is both efficient and feasible.
- 13 October 2023
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 16 (6) , 2761-2774
Anonymity-enhancing decentralized protocol for coin mixing based on ring signatures and key derivation
- 13 October 2023
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 16 (6) , 2761-2774
Anonymity-enhancing decentralized protocol for coin mixing based on ring signatures and key derivation