Lifeng Guo

dblp:56/1459 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
7since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3 · 3 first-author · 3 since 2021Theory of computation · 2 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Hostile, Compatible, or Free: A constant time classification of pairwise shortest path conflicts in obstacle-free MAPF
Lifeng Guo, Changhong Lu
Discret. Appl. Math.1
2025 TAR - PCH: Traceable and Revocable Blockchain Rewriting via Partial Policy-Hiding Chameleon Hashing under Cloud Assistance
abstract
The immutability of blockchain, while essential for ensuring data integrity and traceability, presents challenges in scenarios requiring data modification, such as regulatory compliance with the General Data Protection Regulation (GDPR) and correction of erroneous transactions. To address this, we propose TAR−PCH, a novel chameleon hash scheme that enables fine-grained, policy-controlled rewriting of blockchain data under cloud-assisted environments. Our construction extends the Policy-Based Chameleon Hash (PCH) framework by incorporating partial policy hiding, user-level and attribute-level revocation, and traceability of malicious users. Leveraging efficient attribute-based encryption and white-box tracing, TAR−PCH enforces strong access control and accountability while outsourcing costly operations to the cloud. We formalize its security via indistinguishability and collision-resistance models, and our implementation demonstrates practical performance and scalability compared to existing schemes.
Lifeng Guo, Jingjing Xie, Runtao Zhang, Wei-Chuen Yau
TrustCom1
2024 A Lightweight_PAEKS-based energy scheduling model considering priority in MicroGrid
Xialei Zhang, Yaoyang Wang, Tianjun Ma, Lifeng Guo, Zhiguo Hu
Ad Hoc Networks4
2023 A New Revocable Attribute Based Encryption on Lattice
Lifeng Guo, Lingxia Wang, Xueke Ma, Qianli Ma 0005
ProvSec1
2023 Approximation algorithms for a virtual machine allocation problem with finite types
Lifeng Guo, Changhong Lu, Guanlin Wu
Inf. Process. Lett.1
2023 Online/Offline Rewritable Blockchain With Auditable Outsourced Computation
abstract
Policy-based chameleon hash (PCH) is one of the techniques used for rewriting transaction-level data stored in blockchains. This technique integrates the access policy of the attribute-based encryption (ABE) in the transactions and only allows users with attributes set satisfying the access policy to modify the transactions. However, some operations in the PCH-based rewritable blockchain solution require high computational cost which may impact the performance of user systems, especially on resource-constrained devices. To solve this problem, we propose an online/offline rewritable blockchain with auditable outsourced computation (OO-RB-AOC) scheme. We utilize the ring signature to ensure the credibility of multiple attribute authorities, and adopt the online/offline technique for generating the hash of the rewritable transaction. In addition, expensive computations (e.g., pairings) required for rewriting the transactions can be outsourced to the clouds. The users can rest assured that the computations from the clouds are correct with the audit mechanism of the proposed scheme. On the other hand, the proposed scheme offers a desirable feature for commercial application where the clouds can limit the number of outsourced requests according to the subscription of the users. We also prove the security of the proposed OO-RB-AOC scheme. Finally, we present a theoretical comparison and experimental analysis of the proposed scheme.
Lifeng Guo, Wei-Chuen Yau
IEEE Trans. Cloud Comput.1
2022 One-Time Rewritable Blockchain with Traitor Tracing and Bilateral Access Control
abstract
One of the solutions for rewriting blockchain data is to replace the standard hash function with a chameleon hash function. This enables users with the trapdoor to generate hash collision for rewriting operation. However, such rewritable blockchain solution may allow users to have unlimited rewriting permissions. This is undesirable as rewritable blockchains should still maintain a certain degree of immutability. In this paper, we propose a fine-grained one-time rewritable blockchain scheme that supports traitor tracing and bilateral access control. The proposed solution is the first that combines one-time chameleon hash function and traceable attribute-based encryption to realize one-time rewriting blockchain at the same time tracking for malicious users who leak the private key. Furthermore, our solution offers bilateral access control by integrating with fog computing. We also verify the performance of the proposed scheme with experimental analysis.
Lifeng Guo, Huide Lei, Wei-Chuen Yau
TrustCom1