计算机科学
Byzantine容错
可扩展性
协议(科学)
戒指签名
签名(拓扑)
Schnorr签名
块链
数字签名
计算机网络
分布式计算
计算机安全
盲签名
容错
数学
替代医学
几何学
病理
数据库
医学
散列函数
作者
Xiaohua Wu,Hongji Ling,Huan Liu,Fangjian Yu
标识
DOI:10.1007/s12083-022-01317-4
摘要
The consortium blockchain has three challenges in terms of performance, security, and privacy when adopting the Practical Byzantine Fault Tolerance (PBFT) protocol. The throughput and scalability of consortium blockchain are focused on meanwhile the privacy protection can hardly be ignored. This work proposes a privacy-preserving multi-signature and hierarchical Byzantine consensus protocol. Specifically, the signature combines a ring signature and a Schnorr one to provide three levels of privacy protection. The consensus protocol layers the network nodes into different clusters, which overcomes the shortcomings of PBFT and Schnorr signature. The theoretical analysis proves the security and privacy of the protocol and expounds the application scenarios, and the efficiency evaluation shows that the signature verification speed is 6.28 times faster than the Schnorr scheme, and the consensus in a 250-nodes network is 51.3% faster than the Schnorr-based PBFT consensus.
科研通智能强力驱动
Strongly Powered by AbleSci AI