The communication complexity of the practical byzantine fault tolerance(PBFT)protocol is reduced with the threshold signature technique applied to the consensus process by phase voting PBFT(PV-PBFT).As most communicat...The communication complexity of the practical byzantine fault tolerance(PBFT)protocol is reduced with the threshold signature technique applied to the consensus process by phase voting PBFT(PV-PBFT).As most communication occurs between the primary node and replica nodes in PV-PVFT,consistency verification is accomplished through threshold signatures,multi-PV,and multiple consensus.The view replacement protocol introduces node weights to influence the election of a primary node,reducing the probability of the same node being elected primary multiple times.The experimental results of consensus algorithms show that compared to PBFT,the communication overhead of PV-PBFT decreases by approximately 90% with nearly one-time improvement in the throughput relative and approximately 2/3 consensus latency,lower than that of the scalable hierarchical byzantine fault tolerance.The communication complexity of the PBFT is O(N^(2)),whereas that of PV-PBFT is only O(N),which implies the significant improvement of the operational efficiency of the blockchain system.展开更多
The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols.In this framework,the security of protocols is maintained under a general protocol compositio...The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols.In this framework,the security of protocols is maintained under a general protocol composition operation.In the paper,we propose the universal composability framework for the analysis of proxy threshold signature and present a universally composable secure proxy threshold signature scheme which is the first one in this area.The proposed scheme is suitable for the mobile agents,which should migrate across different environment through network.Furthermore,we give the concrete analysis of the reduction to prove the security of the proposed scheme.展开更多
基金The National Key R&D Program of China(No.2020YFE0200600)。
文摘The communication complexity of the practical byzantine fault tolerance(PBFT)protocol is reduced with the threshold signature technique applied to the consensus process by phase voting PBFT(PV-PBFT).As most communication occurs between the primary node and replica nodes in PV-PVFT,consistency verification is accomplished through threshold signatures,multi-PV,and multiple consensus.The view replacement protocol introduces node weights to influence the election of a primary node,reducing the probability of the same node being elected primary multiple times.The experimental results of consensus algorithms show that compared to PBFT,the communication overhead of PV-PBFT decreases by approximately 90% with nearly one-time improvement in the throughput relative and approximately 2/3 consensus latency,lower than that of the scalable hierarchical byzantine fault tolerance.The communication complexity of the PBFT is O(N^(2)),whereas that of PV-PBFT is only O(N),which implies the significant improvement of the operational efficiency of the blockchain system.
基金the National Natural Science Foundation of China(Nos.60703031,60703004)the National High Technology Research and Development Program(863)of China(No.2006AA01Z4220the National Basic Research Program(973)of China(No.2007CB311201)
文摘The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols.In this framework,the security of protocols is maintained under a general protocol composition operation.In the paper,we propose the universal composability framework for the analysis of proxy threshold signature and present a universally composable secure proxy threshold signature scheme which is the first one in this area.The proposed scheme is suitable for the mobile agents,which should migrate across different environment through network.Furthermore,we give the concrete analysis of the reduction to prove the security of the proposed scheme.
