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

Zhuopu Han

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

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

Security and privacy · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Network and information security
1 paper
Blockchain and cryptocurrency security · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Energy systems and smart grids · 100%

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

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
consensus protocol
1.012026
No-Proof Consensus-Based Light Blockchain for Distributed Computing Scenarios · IEEE Trans. Dependable Secur. Comput. 2026
Distributed systems
blockchain
1.012026
No-Proof Consensus-Based Light Blockchain for Distributed Computing Scenarios · IEEE Trans. Dependable Secur. Comput. 2026
Distributed systems
consensus
1.012026
No-Proof Consensus-Based Light Blockchain for Distributed Computing Scenarios · IEEE Trans. Dependable Secur. Comput. 2026

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

oracle · 3.0off-chain computation · 3.0
YearPublicationVenuePosition
2026 No-Proof Consensus-Based Light Blockchain for Distributed Computing Scenarios
abstract
Distributed computing faces a persistent multi agent trust dilemma. In the computation process, participants may maliciously attack the system for personal gain by providing false data. Blockchain provides a possible solution for this problem with its immutability and multi-party consensus. However, existing blockchain data throughput has long been queried owing to its exorbitant time and energy costs by consensus mechanisms. This paper proposes a light blockchain structure in distributed computing scenarios. A No-Proof consensus (NPC) mechanism is designed for distributed computing problems with no extra proving process such as Proof-of-Work or Proof-of-Stake. This consensus mechanism notices that the distributed computing result has proven to be valid in the computation process automatically, which does not need to be verified again in the consensus mechanism. Further, the single-threaded data processing ability of the blockchain structure certainly leads to low efficiency when applied to distributed computation problems. An NPC-based blockchain is constructed in this paper to solve this problem. In this structure, the distributed computing is done off chain, and an oracle is designed to upload the computing results to the blockchain asynchronously. Upon the contribution in this paper, a distributed energy trading model is provided as a case study to verify the superiority of the designed blockchain in contrast with other similar structures.
Chenggang Mu, Tao Ding 0001, Zhuopu Han, Shanying Zhu, Mohammad Shahidehpour
IEEE Trans. Dependable Secur. Comput.3
2025 Local Projection and Global Tracking-Based Decentralized Optimization: Take Local Energy Trading as an Example
abstract
Optimization problems arise in various domains, ranging from power systems to resource allocation and large network management. An effective solution to these problems in a distributed manner has become a crucial research area due to the increasing scale and complexity of modern systems. In this article, we propose a novel local projection global tracking (LPGT) decentralized algorithm based on the Alternating Direction Method of Multipliers for general optimization problems. Unlike existing distributed methods that require problem-specific adaptations or centralized coordination, LPGT provides tailored solutions for handling generic local equality and inequality constraints, as well as global coupled equality and inequality constraints. Moreover, a projection-based analytical scheme is designed to handle generic local equality and inequality constraints without iterative subproblem solvers, and a fully decentralized deviation tracking mechanism is constructed to enforce both global coupled equalities and inequalities constraints via agent communications, eliminating the need for a central coordinator. Case studies for a local energy trading model are proposed to verify the feasibility and applicability of the algorithm.
Chenggang Mu, Tao Ding 0001, Xinyue Chang, Shanying Zhu, Yixun Xue, Zhuopu Han, Mohammad Shahidehpour
IEEE Trans. Syst. Man Cybern. Syst.6