EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

DC-PBFT: A Censorship-Resistant PBFT Consensus Algorithm Based on Power Balancing

Jiawei Lin, Jiali Zheng

Electronics · 24.04.2026 · 15 (9) · 1818

DOI: 10.3390/electronics15091818 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Electronics, online erschienen am 24.04.2026. Verfasst von Jiawei Lin und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Guangxi Science and Technology Base and Talent Special Project.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The classic design of the Practical Byzantine Fault Tolerance (PBFT) protocol relies on a centralized primary node, which not only creates a performance bottleneck but also introduces severe data censorship risks, threatening the data integrity and security of Edge Computing networks. To address this challenge, this paper proposes DC-PBFT (Decoupled PBFT), a censorship-resistant consensus protocol for Edge-Internet of Things (Edge-IoT) environments. The core innovation of DC-PBFT lies in the decoupling of the Proposer and Primary roles, supplemented by Verifiable Random Function (VRF)-based dynamic role rotation, which fundamentally eliminates the arbitrary power of a single node. Building on this, the protocol introduces a parallel group consensus mechanism: an elected Consensus Committee (CC) composed of Active Edge Nodes leads the consensus, while an independent Replica Network (RN) performs parallel validation. When a disagreement arises, the protocol triggers a global disagreement arbitration process involving all nodes to guarantee final consistency and attribute fault. To ensure long-term incentive compatibility, we also designed a hybrid election mechanism combining Proof-of-Stake and dynamic reputation, along with corresponding economic incentives and a tiered penalty system. Theoretical analysis proves that DC-PBFT satisfies Consistency and Liveness, and achieves strong censorship resistance guarantees. Simulation results demonstrate that DC-PBFT’s scalability significantly outperforms PBFT and RepChain; its reputation mechanism effectively improves long-term performance under sustained Byzantine attacks; and, compared to asynchronous censorship-resistant protocols like HoneyBadgerBFT, DC-PBFT achieves censorship resistance with over 45% lower transaction confirmation latency.

Förderung

  • National Natural Science Foundation of China
  • Guangxi Science and Technology Base and Talent Special Project

Zitieren

APA

Lin, J., & Zheng, J. (2026). DC-PBFT: A Censorship-Resistant PBFT Consensus Algorithm Based on Power Balancing. Electronics, 15(9), 1818. https://doi.org/10.3390/electronics15091818

Vancouver

Lin J, Zheng J. DC-PBFT: A Censorship-Resistant PBFT Consensus Algorithm Based on Power Balancing. Electronics. 2026;15(9):1818. doi:10.3390/electronics15091818

BibTeX
@article{Lin2026,
  author = {Lin, Jiawei and Zheng, Jiali},
  title = {DC-PBFT: A Censorship-Resistant PBFT Consensus Algorithm Based on Power Balancing},
  journal = {Electronics},
  year = {2026},
  volume = {15},
  number = {9},
  pages = {1818},
  doi = {10.3390/electronics15091818}
}
Kostenlos starten →