Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chuankun Zhao

dblp:403/9264 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none

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

Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 56% Cyber-physical and IoT security · 28% Cryptographic primitives and cryptanalysis · 17%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection › data aggregation › privacy-preserving data aggregation
multi-dimensional data aggregation
1.012026
Fault-Tolerant and Key-Leakage Resilient Lightweight Multidimensional Privacy-Preserving Data Aggregation Scheme in Smart Grid · IEEE Trans. Dependable Secur. Comput. 2026
Privacy and data protection › data aggregation
privacy-preserving data aggregation
1.012026
Fault-Tolerant and Key-Leakage Resilient Lightweight Multidimensional Privacy-Preserving Data Aggregation Scheme in Smart Grid · IEEE Trans. Dependable Secur. Comput. 2026
Cyber-physical and IoT security
smart grid security
1.012026
Fault-Tolerant and Key-Leakage Resilient Lightweight Multidimensional Privacy-Preserving Data Aggregation Scheme in Smart Grid · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis › homomorphic encryption
additive homomorphic encryption
0.312026
Fault-Tolerant and Key-Leakage Resilient Lightweight Multidimensional Privacy-Preserving Data Aggregation Scheme in Smart Grid · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.312026
Fault-Tolerant and Key-Leakage Resilient Lightweight Multidimensional Privacy-Preserving Data Aggregation Scheme in Smart Grid · IEEE Trans. Dependable Secur. Comput. 2026

Methods — techniques the papers use, named apart from their topics

secret sharing · 1.0random masking · 1.0data packaging · 1.0
YearPublicationVenuePosition
2026 Fault-Tolerant and Key-Leakage Resilient Lightweight Multidimensional Privacy-Preserving Data Aggregation Scheme in Smart Grid
abstract
Efficient power management in smart grid relies on collecting fine-grained power consumption data from users. However, these data may reveal sensitive information about individuals' habits and lifestyles. Various multidimensional data aggregation schemes leveraging public key encryption (PKE) algorithms have been proposed to address this problem. Never theless, most of these schemes come with significant performance costs. In addition, if the secret key of a smart meter was leaked, the confidentiality of encrypted user power data could be at risk. In this article, we propose a lightweight, multidimensional, and privacy-preserving data aggregation scheme with fault-tolerance and key-leakage resilience for smart grid without relying on a trusted third party (TTP), named FKLM-PDA, in which a novel data packaging method that transforms users' multidimensional data into a one-dimensional format is designed, enabling data center parse aggregated results in each dimension, reducing computation and communication costs. For better efficiency, an effective encryption algorithm is proposed to replace the expensive additive homomorphic PKE, like the Paillier cryptosystem, which combines a random masking with secret-sharing based key separation, ensuring threshold key-leakage resilience under a bounded, non-colluding leakage model. Furthermore, not only does FKLM-PDA enhance the fault tolerance mechanism of data transmission from smart meters to a corresponding fog node, but also it supports dynamic user management for joining and exiting improving scalability. Security analysis confirms that FKLM-PDA is privacy-preserving and secure while guaranteeing key-leakage resilience, fault tolerance, authentication, and data integrity. Through performance evaluations, FKLM-PDA outper forms the existing schemes and is superior in computation and functional in communication.
Liangliang Wang 0001, Chuankun Zhao, Zhiquan Liu 0001, Kai Zhang 0016, Mingze He, Weiwei Li 0007
IEEE Trans. Dependable Secur. Comput.2
2025 BPRM: Blockchain-Based Privacy Preserving and Robust Data Aggregation Supporting Multifunctionality for Fog-Assisted Smart Grid
abstract
While the collection of users’ live or periodic electricity consumption data brings significant advantages for the operation of smart grids, it also heightens the risk of user privacy leakage. Numerous data aggregation schemes have been proposed to address this issue. However, most of these schemes either fail to accommodate the need for multifunctional data analysis or rely on a trusted third party (TTP). Given the efficient data processing capabilities offered by fog computing, we propose a blockchain-based privacy-preserving data aggregation (BPRM) scheme supporting multifunctionality for fog-assisted smart grid without TTP. This scheme ensures data confidentiality and data integrity while providing various statistical functions. In addition, we implement a consensus mechanism between smart meters, further enhancing the security and robustness of the smart grid system. Moreover, not only does the proposed the batch verification reduce the authentication costs but also support error detection in signatures. With BPRM, data center can calculate multiple statistical functions, achieving a win-win strategy. Extensive security and performance analyses demonstrate that BPRM can withstand various security threats and effectively protect user privacy while maintaining efficiency in both computational and communication overhead.
Chuankun Zhao, Liangliang Wang 0001, Zhiquan Liu 0001, Kai Zhang 0016, Weiwei Li 0007, Kefei Chen
IEEE Internet Things J.1