Mechanism optimization and empirical analysis of blockchain technology empowering government data security
Abstract
Aiming at the problems of insufficient integrity assurance, high risk of privacy leakage, and low cross-departmental circulation efficiency in the field of government data security, this study proposes an optimized blockchain solution integrating an improved Practical Byzantine Fault Tolerance (PBFT) consensus algorithm and dynamic Attribute-Based Encryption (ABE). By constructing a government data security storage model, the data layer's hash verification mechanism (SHA-256 + Merkle Patricia Tree) and network layer's P2P protocol (with packet loss retransmission) are optimized based on typical government blockchain platforms (e.g., Nanjing Electronic License Sharing Platform). Experiments with 200 nodes simulated government networks, comparing TPS, data verification delay, and privacy protection before and after optimization. The results show that after optimization: TPS increased by 37.2% (from 89.6 to 123.0), cross-departmental data verification time was shortened to 0.42 seconds, and zero-knowledge proof was used to realize anonymized query of sensitive fields (such as ID card numbers and real estate information). The research indicates that this technical solution can effectively resolve the contradictions among integrity, privacy, and circulation of government data, providing technical references for the engineering implementation of government blockchain systems.
Community
0 commentsNo discussion yet
Be the first to share a question or observation.