CN111756823A - Open permit chain applied to public security system based on simplified Byzantine fault-tolerant algorithm - Google Patents
Open permit chain applied to public security system based on simplified Byzantine fault-tolerant algorithm Download PDFInfo
- Publication number
- CN111756823A CN111756823A CN202010536351.XA CN202010536351A CN111756823A CN 111756823 A CN111756823 A CN 111756823A CN 202010536351 A CN202010536351 A CN 202010536351A CN 111756823 A CN111756823 A CN 111756823A
- Authority
- CN
- China
- Prior art keywords
- public security
- chain
- open
- byzantine fault
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 230000007246 mechanism Effects 0.000 claims abstract description 22
- 238000000034 method Methods 0.000 claims abstract description 17
- 230000008569 process Effects 0.000 claims description 9
- 230000001360 synchronised effect Effects 0.000 claims description 3
- 238000013475 authorization Methods 0.000 claims description 2
- 238000005516 engineering process Methods 0.000 abstract description 16
- 230000000694 effects Effects 0.000 abstract description 4
- 238000005457 optimization Methods 0.000 abstract description 3
- 206010033799 Paralysis Diseases 0.000 abstract description 2
- 238000011160 research Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 8
- 238000004891 communication Methods 0.000 description 4
- 238000012795 verification Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 230000009466 transformation Effects 0.000 description 2
- 241000760358 Enodes Species 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000010076 replication Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0677—Localisation of faults
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
- H04L9/3255—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures using group based signatures, e.g. ring or threshold signatures
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Hardware Redundancy (AREA)
Abstract
The invention belongs to the field of block chains and network security, and particularly relates to an open permission chain applied to a public security system based on a simplified Byzantine fault-tolerant algorithm. An open permission chain applied to a public security system based on a simplified Byzantine fault-tolerant algorithm perfectly applies a block chain technology to the field of public security by using an efficient simplified Byzantine fault-tolerant algorithm as a consensus mechanism, solves the problem of information isolated island of the public security system and improves the survivability of the public security system under malicious attack, ensures the normal operation of the system when the system is in error, fault or under attack, and reduces the huge loss of the public security department caused by the system paralysis. The method mainly researches a core technology of a block chain, namely a consensus mechanism, compares a mainstream consensus algorithm, finally selects a simplified Byzantine fault-tolerant algorithm as the consensus mechanism, constructs a safe and efficient open permission chain, achieves the effects of performance optimization and high safety, and is applied to the background of the public security field.
Description
Technical Field
The invention belongs to the field of block chains and network security, and particularly relates to an open permission chain applied to a public security system based on a simplified Byzantine fault-tolerant algorithm.
Background
In the next place, the block chain technology becomes a new network security technology by virtue of the characteristics of decentralization, tamper resistance, traceability and trustiness. Due to the superiority and great prospect of the technology, the technology is widely concerned at home and abroad. The block chain technology is continuously developed and perfected, becomes an important component of the internet, is considered as subversive innovation, and brings a brand new technical revolution on the global scale. The block chain technology has been applied in a plurality of fields and has achieved considerable effects, and the application of the block chain technology in the public security field is very deficient after understanding and finding, so that the block chain technology mainly explores the application prospect of the block chain technology in the public security field.
Through comprehensive consideration of the background of the public security system, the discovery shows that if only one split alliance chain or private chain is built, huge resource waste is caused, and the formation of an innovative gathering effect is not facilitated to a certain extent. The public link has low performance, and any node is opened to anyone, and complete anonymity causes supervision loss and illegal application flooding and leaves outside the real application all the time. Therefore, in the current context, opening a license chain (federation chain or private chain) is a completely new direction for blockchain technology to be applied in the public security domain.
The specific meaning of the opening of an open-allowed chain is three layers:
the first layer is data open. Digital transformation is a necessary trend of social development, and the public security field also faces the challenge of digital upgrading. Nowadays, with the active promotion of 'sharing' and 'opening' of public data resources by governments at all levels, public security data assets are activated and data islands are broken, and the public security data assets and the data islands are already important targets of informatization transformation in the public security field.
The second layer is application open. And multiple applications are aggregated in a license chain ecological platform, so that the superposition benefits of services and values are easier to generate. Even the internet rarely produces a positive competition on personalized citizen services, applies an open license chain, and produces a more compact form of cooperation between and among government agencies such as the citizen and the public security, and draws close distance to the citizen.
The third level is node open. The permission chain is opened for individual individuals or entities, and is applied to the field of public security, the authority of each node in the system can be organized and distributed by the public security system, the access authority can be controlled, the traceability of the system is improved, and the trust risk of public security information is solved.
However, the license chain system also has many problems:
(1) and (3) identity authentication: it is challenging to adopt the license chain technology in the public security domain, and the basic principle of enabling the authentication function and decentralizing the block chain technology in the application of the license chain creates friction and contradiction points.
(2) The performance requirements are as follows: the problems of scalability, throughput and latency are less severe for the public chain that is commonly applied to financial systems and digital currency transactions, but there is a strong demand for high scalability, high throughput and low latency for the license chain applied in the public security domain.
(3) Safety: the open license chain architecture is highly demanding on security. The requirements for security mainly originate from two aspects: on one hand, the self safety of the license chain comprises network communication safety, data safety, emergency treatment and the like; on the other hand, distributed nodes of the public security system may have serious faults, downtime, malicious attacks from external entities and the like, and have great potential safety hazards.
In order to solve the above problems, the present invention provides a safe and efficient open license chain based on a simplified byzantine fault-tolerant algorithm, aiming to realize two aspects: on one hand, data opening, application opening and node opening in the public security field are realized, public security data sharing is realized, a data island is broken, and the public security information trust risk is solved; and on the other hand, the survivability of the public security system under the malicious attack is improved.
Disclosure of Invention
The invention aims to provide an open permission chain applied to a public security system based on a Simplified Byzantine fault-tolerant algorithm, and a block chain technology is perfectly applied to the public security field by using an efficient Simplified Byzantine fault-tolerant algorithm (SBFT) as a consensus mechanism, so that the information island problem of the public security system is solved, the survivability of the public security system under malicious attack is improved, the normal operation of the system is ensured when the system is in error, fault or attack, and the huge loss of the public security department caused by system paralysis is reduced.
The invention is realized by adopting the following technical scheme: the open permit chain applied to the public security system based on the simplified Byzantine fault-tolerant algorithm is implemented according to the following steps:
(1) building an open permission chain: an open permission chain is built on a public security system server to realize distributed node deployment;
(2) node authentication and authorization: firstly, carrying out identity authentication on nodes in an open permission chain, and setting permission nodes according to requirements in advance by a public security system after the nodes are qualified;
(3) deploying a simplified Byzantine fault-tolerant algorithm on an open license chain: the simplified Byzantine fault-tolerant algorithm comprises a quick consensus mechanism and a Linear-PBFT mechanism, wherein when all permission nodes of an open permission chain have no errors and are synchronous, the quick consensus mechanism is used, and when the quick consensus mechanism cannot achieve consensus due to the failed nodes, a Linear-PBFT mode is used.
When a license node on an open license chain is in error, fails or is under attack, the license node becomes a failed node, and the system is broken down. The method selects the simplified Byzantine fault-tolerant algorithm, and can use the Linear-PBFT mode after a fault node occurs, so that the survivability of the public security system under the malicious attack is improved on the basis of realizing data opening, application opening and node opening in the public security field.
The simplified Byzantine fault-tolerant algorithm is applied to an open permit chain of a public security system, and the identification process of a fault node is as follows: and (4) calculating the hash value of the allowed node in the open allowed chain in real time, wherein if the hash value of a certain allowed node is different from the hash values of other allowed nodes, the allowed node is a fault node.
The simplified Byzantine fault-tolerant algorithm is applied to an open permit chain of a public security system, and an intelligent contract is integrated in the simplified Byzantine fault-tolerant algorithm.
The simplified Byzantine fault-tolerant algorithm is applied to an open permit chain of a public security system, the permit chain is built on an ethereum platform, and the used programming language is the GO language.
The method mainly researches a core technology of a block chain, namely a consensus mechanism, compares a mainstream consensus algorithm, finally selects a simplified Byzantine fault-tolerant algorithm as the consensus mechanism, constructs a safe and efficient open permission chain, achieves the effects of performance optimization and high safety, and is applied to the background of the public security field.
Drawings
FIG. 1 is a diagram illustrating the operation concept of the method of the present invention.
FIG. 2 is a block flow diagram of the method of the present invention.
FIG. 3 is a block diagram of a license chain construction process.
Fig. 4 is a schematic diagram of the constructed license chain.
FIG. 5 is a schematic diagram of deploying an intelligent contract.
FIG. 6 is a schematic diagram of the consensus process of the SBFT algorithm.
FIG. 7 is a diagram illustrating dual mode handover of the SBFT algorithm.
Detailed Description
The flow block diagram of the efficient and safe open permission chain based on the simplified Byzantine fault-tolerant algorithm provided by the invention is shown in figure 2, and the method comprises the following steps:
(1) and building an open permission chain. An open permission chain is built on a public security system server to realize distributed node deployment, as shown in fig. 4, the built permission chain comprises nodes a to F, and the nodes a to F are data nodes of each part of the public security system. The method mainly builds the license chain on the ethereum platform, the used programming language is the GO language, the method has higher development efficiency than other languages, and is suitable for the field of high-performance distributed systems.
(2) The node authenticates and authorizes. The consensus forming process in the open permission chain is controlled by a series of preselected nodes A-F, so that the nodes A-F in the open permission chain are subjected to identity verification firstly, and after the verification, the permission nodes are set by a public security system according to requirements in advance, as shown in fig. 4, the nodes B, C, E and F are set as the permission nodes, the permission nodes can perform access control authority setting, and the permission nodes in the open permission chain have higher application expandability. In order to realize cooperative processing and data sharing among a plurality of nodes, the permission nodes are connected with each other by sharing an enode address, so that multi-node access is realized.
(3) And deploying the intelligent contract. As the licensing nodes in the open license chain system operate, the next step is to sign up the intelligent contracts. An intelligent contract is a set of code and data stored at a particular address in a blockchain network, in the form of an Ethernet Virtual Machine (EVM) bytecode, interpreted by the Ethernet Virtual Machine (EVM) for execution. The deployment will be developed using the identity, the programming language in which the intelligent contracts are developed. The flow chart is shown in FIG. 5:
(4) a simplified byzantine fault tolerance algorithm is deployed.
The consensus process of the SBFT algorithm comprises the following steps:
compared with other Byzantine fault-tolerant algorithms, the simplified Byzantine fault-tolerant algorithm only needs to send 1/3 messages, and consensus is achieved more efficiently. The maximum number of messages sent by the traditional Byzantine fault-tolerant algorithm is calculated according to the following formula: m =1+3f + (3f) (3f +1) +3f + 1; the calculation formula of the number of the sent messages of the simplified Byzantine fault-tolerant algorithm is as follows: m = (3f +1) (2f +1) +1, where f is the number of fault-capable nodes for a given open grant chain size n, and the formula for f is as follows: f = (n-1)/3; assuming an open grant chain (node B, node C, node E, node F) with 4 granted nodes can accommodate 1 failed node, applying the traditional byzantine fault tolerance algorithm, 23 messages need to be sent. And a simplified Byzantine fault-tolerant algorithm is used as a consensus mechanism, and only 13 messages need to be sent.
The consensus process of the SBFT algorithm is illustrated by taking node B as an example, in this example, node B is the leader node and has the highest priority, H is the hash value of each node, e.g., H (B) is the hash value of node B, and node F is the failed node, whose hash value is inconsistent with the hash value verification of other allowed nodes. In an open license chain with 4 licensed nodes, the consensus can be achieved only if at least 3 nodes are successfully verified, and the flow chart is shown in fig. 6.
(II) double-view mode:
the SBFT algorithm realizes correct and practical dual-mode view replacement, can switch between a quick consensus mechanism and a Linear-PBFT mechanism, and improves consensus efficiency. In a public security system, SBFT allows the use of a standard fast consensus mechanism when there are F byzantine nodes (licensed nodes) and all node devices are error free and synchronous (sync). And a threshold signature (threshold signature) is used, a two-phase protocol is initiated as soon as all the licence nodes (replica) participating in the provision of the service receive the block of acknowledgements (committed): sign-state, execute-proof. When any node fails, the system is switched from the fast consensus mechanism to the Linear-PBFT mechanism. The Linear-PBFT is an improvement on a Practical Byzantine Failure Tolerance (PBFT), threshold signatures and Linear communication are used after optimization, and each client only needs to receive a reply (reply) under normal conditions, so that the communication load pressure is greatly reduced, the high consensus efficiency is kept, the communication load force is reduced, and the Linear-PBFT is a fallback protocol. The consensus process of the SBFT algorithm is flexible and mobile, the throughput is high, the delay is low, the cost overhead and the resource consumption can be greatly reduced by deploying the consensus process in an open permit chain under a public security scene, and a flow chart is shown in fig. 7.
(5) Double security: other intelligent contract languages are integrated in a Simplified Byzantine Fault Tolerant (SBFT) consensus mechanism. The SBFT common recognition mechanism provides an extensible state machine replication service, and an merckel Tree (Merkle Tree) is used for realizing authenticable key value storage, so that the safety and the efficiency of the duplicate message authentication are increased. And a layer of intelligent contract engine (smart contract engine) is arranged on the intelligent contract engine, and other intelligent contract languages can be integrated, so that the safety and the survivability of the system are further improved, and the normal operation of the service is ensured.
Claims (4)
1. An open permit chain applied to a public security system based on a simplified Byzantine fault-tolerant algorithm is characterized by being implemented according to the following steps:
(1) building an open permission chain: an open permission chain is built on a public security system server to realize distributed node deployment;
(2) node authentication and authorization: firstly, carrying out identity authentication on nodes in an open permission chain, and setting permission nodes according to requirements in advance by a public security system after the nodes are qualified;
(3) deploying a simplified Byzantine fault-tolerant algorithm on an open license chain: the simplified Byzantine fault-tolerant algorithm comprises a quick consensus mechanism and a Linear-PBFT mechanism, wherein when all permission nodes of an open permission chain have no errors and are synchronous, the quick consensus mechanism is used, and when the quick consensus mechanism cannot achieve consensus due to the failed nodes, a Linear-PBFT mode is used.
2. The open permit chain for public security systems based on the simplified byzantine fault-tolerant algorithm of claim 1, wherein: the identification process of the fault node comprises the following steps: and (4) calculating the hash value of the allowed node in the open allowed chain in real time, wherein if the hash value of a certain allowed node is different from the hash values of other allowed nodes, the allowed node is a fault node.
3. The open permit chain for public security systems based on the simplified byzantine fault-tolerant algorithm of claim 2, wherein: intelligent contracts are integrated in a simplified Byzantine fault-tolerant algorithm.
4. The open license chain for public security systems based on the simplified byzantine fault-tolerant algorithm according to claims 1-3, characterized in that: and (4) constructing a license chain on the ethereum platform, wherein the used programming language is GO.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010536351.XA CN111756823A (en) | 2020-06-12 | 2020-06-12 | Open permit chain applied to public security system based on simplified Byzantine fault-tolerant algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010536351.XA CN111756823A (en) | 2020-06-12 | 2020-06-12 | Open permit chain applied to public security system based on simplified Byzantine fault-tolerant algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111756823A true CN111756823A (en) | 2020-10-09 |
Family
ID=72675967
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010536351.XA Pending CN111756823A (en) | 2020-06-12 | 2020-06-12 | Open permit chain applied to public security system based on simplified Byzantine fault-tolerant algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111756823A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113783947A (en) * | 2021-08-26 | 2021-12-10 | 浙商银行股份有限公司 | Adaptive block link point fault tolerance improving method, equipment and storage medium |
| WO2023185045A1 (en) * | 2022-03-29 | 2023-10-05 | 蚂蚁区块链科技(上海)有限公司 | Method and system for generating random seed on blockchain, and consensus node |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109547211A (en) * | 2018-11-29 | 2019-03-29 | 浙江大学 | Using the concurrent Byzantium's common recognition method and system of the classification of digital signature technology |
| WO2019072263A2 (en) * | 2018-11-07 | 2019-04-18 | Alibaba Group Holding Limited | Facilitating practical byzantine fault tolerance blockchain consensus and node synchronization |
| CN109964446A (en) * | 2018-06-08 | 2019-07-02 | 北京大学深圳研究生院 | A kind of common recognition method based on ballot |
| US20190268351A1 (en) * | 2018-02-27 | 2019-08-29 | Alibaba Group Holding Limited | Method, apparatus, system, and electronic device for cross-blockchain interaction |
| CN110445619A (en) * | 2017-03-30 | 2019-11-12 | 腾讯科技（深圳）有限公司 | Block catenary system, message treatment method and storage medium |
-
2020
- 2020-06-12 CN CN202010536351.XA patent/CN111756823A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110445619A (en) * | 2017-03-30 | 2019-11-12 | 腾讯科技（深圳）有限公司 | Block catenary system, message treatment method and storage medium |
| US20190268351A1 (en) * | 2018-02-27 | 2019-08-29 | Alibaba Group Holding Limited | Method, apparatus, system, and electronic device for cross-blockchain interaction |
| CN109964446A (en) * | 2018-06-08 | 2019-07-02 | 北京大学深圳研究生院 | A kind of common recognition method based on ballot |
| WO2019072263A2 (en) * | 2018-11-07 | 2019-04-18 | Alibaba Group Holding Limited | Facilitating practical byzantine fault tolerance blockchain consensus and node synchronization |
| CN109547211A (en) * | 2018-11-29 | 2019-03-29 | 浙江大学 | Using the concurrent Byzantium's common recognition method and system of the classification of digital signature technology |
Non-Patent Citations (2)
| Title |
|---|
| SAQIB ALI等: "A_Blockchain-Based_Decentralized_Data_Storage_and_Access_Framework_for_PingER", 《2018 17TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS/ 12TH IEEE INTERNATIONAL CONFERENCE ON BIG DATA SCIENCE AND ENGINEERING (TRUSTCOM/BIGDATASE)》 * |
| 链得得: "蚂蚁金服推出"开放联盟链"，全民上链的时代来了", 《搜狐》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113783947A (en) * | 2021-08-26 | 2021-12-10 | 浙商银行股份有限公司 | Adaptive block link point fault tolerance improving method, equipment and storage medium |
| CN113783947B (en) * | 2021-08-26 | 2024-05-31 | 浙商银行股份有限公司 | Adaptive block chain link point fault tolerance lifting method, device and storage medium |
| WO2023185045A1 (en) * | 2022-03-29 | 2023-10-05 | 蚂蚁区块链科技(上海)有限公司 | Method and system for generating random seed on blockchain, and consensus node |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| AU2019207312B2 (en) | Distributed key management for trusted execution environments | |
| AU2018348335B2 (en) | Performing a recovery process for a network node in a distributed system | |
| AU2018348334C1 (en) | Achieving consensus among network nodes in a distributed system | |
| AU2018348336B2 (en) | Performing a change of primary node in a distributed system | |
| CN109918878B (en) | Industrial Internet of things equipment identity authentication and safe interaction method based on block chain | |
| CN111406252B (en) | Consensus of error correction code based shared blockchain data storage | |
| TWI749488B (en) | Computer-implemented method, system, and non-transitory computer-readable storage medium for detecting disabling replay attacks | |
| CN111417930B (en) | Prioritizing shared blockchain data storage | |
| EP3769216B1 (en) | Data security of shared blockchain data storage based on error correction code | |
| EP3908932B1 (en) | Topology-driven byzantine fault-tolerant consensus protocol with vote aggregation | |
| CN111756823A (en) | Open permit chain applied to public security system based on simplified Byzantine fault-tolerant algorithm | |
| Fan et al. | DR-BFT: A consensus algorithm for blockchain-based multi-layer data integrity framework in dynamic edge computing system | |
| CN113225736A (en) | Unmanned aerial vehicle cluster node authentication method and device, storage medium and processor | |
| Bai et al. | Research on software defined network security model based on blockchain | |
| Almakki et al. | [Retracted] Fault Tolerance Byzantine Algorithm for Lower Overhead Blockchain | |
| Kabir et al. | A blockchain-based approach to secure cloud connected IoT devices | |
| Li et al. | A noninteractive multireplica provable data possession scheme based on smart contract | |
| Li et al. | Sepow: Secure and efficient proof of work sidechains | |
| Yang et al. | Review on variant consensus algorithms based on PBFT | |
| Ying et al. | LOPE: A Low‐Overhead Payment Verification Method for Blockchains | |
| Fu et al. | A New Network Intrusion Detection System based on Blockchain | |
| CN114615288B (en) | Novel block chain system based on quantum Byzantine consensus protocol | |
| CN115622788A (en) | Industrial Internet of things cross-domain trust management method based on block chain | |
| Nijhawan et al. | Blockchain internet of things | |
| Chu et al. | Credibility Management of Cloud-based Digital Forensic Data: A Decentralized Verification Mechanism |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20201009 |
|
| RJ01 | Rejection of invention patent application after publication |