CN112448817A - Decentralization consensus scheme - Google Patents
Decentralization consensus scheme Download PDFInfo
- Publication number
- CN112448817A CN112448817A CN201910834253.1A CN201910834253A CN112448817A CN 112448817 A CN112448817 A CN 112448817A CN 201910834253 A CN201910834253 A CN 201910834253A CN 112448817 A CN112448817 A CN 112448817A
- Authority
- CN
- China
- Prior art keywords
- resource
- proposal
- consensus
- addressable
- list
- 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
Images
Classifications
-
- 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
-
- 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
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
-
- 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/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Abstract
The traditional decentralized consensus mode supporting massive nodes needs to introduce workload certification, and the issuing right of a proposal is obtained by submitting required computation. Such consensus approaches can result in a large amount of energy being consumed to satisfy unlimited computational power inputs. The invention provides a new consensus mode, which realizes the workload certification with low energy consumption under the conditions of supporting mass nodes and non-permission access. The invention adopts addressable resources, makes the value of the correlation function of the resource address and the proposal meet the set requirement by selecting proper resources, adds the signature verification identification of the selected resources, combines a plurality of identifications as workload certification by adopting a serial connection mode, and uses the combined identification as a common identification means of a plurality of nodes in the network on the basis of the combined identification.
Description
Technical Field
The invention relates to a decentralized system, which comprises a block chain and other distributed systems, in particular to an innovative decentralized consensus mode.
Background
The traditional method for decentralized consensus is PBFT, and a voting mode is adopted to vote for a certain proposal among network nodes, so that the proposal agreed by most nodes is written into a consensus system. There are many improved methods based on PBFT: the threshold signature adopts a BLS algorithm, so that the size of the message when the node votes can be effectively reduced; hotsff improves the amount of traffic when the view (view) changes; dPOS (rights and interests) adopts the owned equity of each participating node, votes by proxy or realizes consensus by combining with POW.
For decentralized systems with a large number of nodes, a workload proof approach (POW) is often used to achieve consensus. The specific process is that each participated node obtains a result meeting the requirement by solving a mathematical problem with large operation amount, usually in a brute force cracking mode. The first node to obtain the result submits the result to the network, along with a proposal for decentralized system updates. After the validity of the operation result is verified, other nodes receive the proposal and update the local system state, thereby realizing the global consistency of the decentralized system. Bitcoin is a consensus using this workload proof.
Disclosure of Invention
The invention consists of the following parts:
a decentralized tandem addressing workload proof, comprising:
an addressable list of resources;
calculating the resource addresses in the resource list by adopting a set correlation function and taking the proposal and the resource addresses as parameters to obtain a result;
comparing the calculation result with the set requirement;
submitting the proposal to the resource address if the requirement is met, and obtaining the signature identification of the resource to the proposal;
repeating the following steps 0 or more times according to the defined series number: taking the signature identifier or an identifier derived from the signature identifier as a new proposal, and calculating the resource address in the resource list by adopting a set correlation function and taking the new proposal and the resource address as parameters to obtain a result; comparing the calculation result with the set requirement; submitting the new proposal to the resource address if the requirement is met, and obtaining the signature identification of the resource to the new proposal;
and after the defined series stages are reached, the signature identification set of each stage is the workload proof.
A decentralized tandem addressing workload proof, comprising:
an addressable list of resources;
calculating the resource addresses in the resource list by adopting a set correlation function and taking the proposal and the resource addresses as parameters to obtain a result;
comparing all the results to obtain a preferred result and a corresponding preferred resource;
submitting the proposal to the preferred resource address and obtaining the signature identification of the preferred resource to the proposal;
repeating the following steps 0 or more times according to the defined series number: taking the signature identifier or an identifier derived from the signature identifier as a new proposal, and calculating the resource address in the resource list by adopting a set correlation function and taking the new proposal and the resource address as parameters to obtain a result; comparing all the results to obtain a preferred result and a corresponding new preferred resource; submitting the new proposal to the new preferred resource address and obtaining the signature identification of the new preferred resource to the new proposal;
after the defined series stages are reached, calculating to obtain a final result by adopting a target function taking the optimal result of each stage as a parameter;
comparing the final result with a set requirement;
if the requirement is met, the signature identification set of each level is the workload certification.
According to the above preferred procedure, one or more preferred resources may be selected, and each preferred resource is processed according to the procedure described above.
A decentralised consensus scheme comprising:
a plurality of consensus nodes participating in consensus;
an addressable list of resources;
use of the tandem addressing workload specification of any of the preceding claims 1 to 3;
submitting a proposal and a tandem addressing workload certificate to a network;
the other nodes of the network verify acceptance of the proposal and tandem addressing workload proof, thereby achieving consensus.
The resource list is characterized in that:
a plurality of resource owners register information of addressable resources owned by the resource owners with a resource list;
a maintenance system for the resource table;
the resource table maintenance system verifies the validity and addressable accessibility of the registered resources;
the resource maintenance system realizes the management, addition and deletion operations of the resource list in a decentralized consensus mode.
The resource maintenance system is characterized in that:
the operation on the addressable list of resources is implemented by intelligent contracts based on block chains.
The addressable resource is characterized in that:
a resource owner maintains addressability of the resource;
the resource owner provides a signature identifier for the request content of the node;
the resource owner returns the signature identification to the requestor.
Such addressable resources include, but are not limited to, the network address of the resource owner.
Such addressable resources include, but are not limited to, the address of the resource owner in earth's surface space.
The node participating in consensus is characterized in that:
a network interface; a memory; and a processor coupling the network interface and the memory;
the processor is configured to:
receiving a plurality of transactions through a network interface; processing each transaction acquisition result, and combining the transaction results into a proposal;
searching the resource meeting the requirement from the addressable resource list;
inquiring the resource to obtain a verification identifier;
submitting a proposal and a verification identifier to other consensus nodes;
accepting proposal and verification identification from other consensus nodes;
verifying that the proposal and the verification identifier meet the predetermined requirements;
the proposal is accepted and the local state is updated.
Drawings
An example process for a consensus node to obtain a signature for a valid resource is shown in fig. 1. 107 is a decentralized resource list comprising a number of addressable resources 101, each addressable resource maintaining addressability and serviceability. The consensus node constructs a proposal 103. the consensus node finds the addressable resources in the resource list that meet the requirements. The consensus node submits a request to said addressable resource 102, the request comprising a proposal 103. After receiving the request, the resource 102 generates a signature 104 for the requested content, and returns the signature 104 to the requesting party. The requestor combines the original proposal 103 with the signature identity 104 into a new proposal 105. And the consensus node searches new resources meeting the requirements in the resource list for the second time. The consensus node submits a request to said new resource 106, the request comprising a new proposal 105. After receiving the request, the new resource 106 generates a signature 108 for the requested content and returns the signature 108 to the requestor. The consensus node repeats this series verification process until the series progression reaches a predetermined requirement. The consensus node submits the final proposal 109 to the consensus network 110, and each consensus node 111 in the consensus network 110 can receive the final proposal and verify the validity. And if the verification is successful, updating the local state to achieve consensus.
Detailed description of the preferred embodiments
The common identification mode of PBFT has high requirement on the communication volume of the network, and increases in a stage level (O (n ^2) -O (n ^ 3)) along with the increase of the number of nodes. Therefore, this approach limits the number of network nodes that can participate (< 100). Furthermore, the availability of the nodes participating in the consensus must be determined in advance, so that the consensus system is a closed, admission-allowed network.
The workload-certified consensus approach (POW) supports a large number of networks without admission permission. However, POW requires a large amount of calculation power, that is, a large amount of electric power. The total power consumption of the bitcoin network currently exceeds the power consumption of a medium country. Also, this power consumption is continuously increasing.
The invention is a decentralization consensus scheme which supports massive nodes, has no admission permission and has low energy consumption.
The traditional POW energy consumption problem is rooted in the parallelism and indistinguishability of computational power. The consensus node can arbitrarily increase the controlled calculation power and process the calculation in parallel, thereby increasing the probability of obtaining the result meeting the requirement. Thus, resulting in a need for more computing resources for competitors.
The invention adopts addressable resources, sequentially queries the resources meeting the requirements in a serial connection mode, obtains the signature of the resources, and uses the resource signature as a workload for proving, thereby avoiding unnecessary energy consumption.
A first embodiment of the invention is to use widely available addressable resources: an IP address.
Any user with an IP address can become a resource provider. The resource provider submits his own resource information, including IP address, port to receive query and signature services, to a decentralized resource list. The resource provider needs to maintain the addressability, serviceability of the resource IP address.
The decentralized resource list records and maintains the validity of resources: addressability, serviceability. One implementation of the resource table may be to use an intelligent contract in the block chain to implement the operation on the resource table. The specific operation comprises the following steps:
defining a set of resource verification nodes in an intelligent contract;
each resource verification node periodically performs addressing access on the registered resource, submits a request, obtains a signature identifier and verifies the signature identifier;
each resource verification node records the verification result into an intelligent contract;
the intelligent contract manages the resources according to predefined rules: and updating and deleting.
The resource table can be implemented in other decentralized manners, and in another manner, each operation of the resource table is implemented through the p2p network protocol.
The consensus process is as follows: each consensus node constructs a proposal. This proposal may include a set of transactions that are not joined to the consensus system. The consensus node may sign the transaction set to obtain a unique hash value. This hash value may also be proposed.
The consensus node finds an addressable resource in the resource list. For each addressable resource, the value of some correlation function is computed. One implementation of a correlation function may be, but is not limited to, the hash distance of the signature of the transaction set to the resource address: dist = hash _ distance (hash ({ tx }), resource _ addr)
The consensus node finds the resource corresponding to the preferred hash distance Dist _1 and then submits a request to the addressable resource. This request may be a service port that the TCP connects to the resource. This request contains the proposal. And after the resource receives the TCP request, generating a signature identifier for the request content. This signature identification may be a signature of the request with the resource owner using its own private key. The resource returns a signature identification to the requestor (consensus node) over the established TCP connection.
The consensus node can combine the original proposal and the signature into a new proposal in a certain form according to the defined number of series stages. The consensus node searches for a new resource meeting the requirements in the resource list for the second time, and the preferred hash distance Dist _ 2. The consensus node submits a request to the new resource. This request may be a service port that the TCP connects to the resource. This request contains the new proposal. And after the new resource TCP requests, generating a signature identifier for the request content. This signature identification may be a signature of the request with the resource owner using its own private key. The new resource returns a signature identification to the requestor over the established TCP connection.
The consensus node repeats this series verification process until the series progression reaches a predetermined requirement. And recording the optimal hash distance { Dist _ i } obtained at each level by the consensus node. The consensus node calculates a certain function of all series hash distances. One such functional implementation may be the product of all distances: distance _ all = Dist _1 Dist _2 Dist _ … Dist _ i if this product value meets the defined requirements, the consensus node gets a proof of the serial addressing workload.
And the consensus node submits the proposal and the workload certificate to a consensus network, and each consensus node in the consensus network can receive the proposal and verify the validity. If the verification is successful, the other nodes accept the proposal and update the local states of the other nodes at the same time, thereby achieving consensus.
Another implementation of this embodiment may be to compute the value of a certain correlation function for each addressable resource. One implementation of a correlation function may be, but is not limited to, the hash distance of the signature of the transaction set to the resource address: dist = hash _ distance (hash ({ tx }), resource _ addr)
And the consensus node compares whether the hash distance corresponding to the resource meets the set requirement, and if so, submits a request to the addressable resource. This request may be a service port that the TCP connects to the resource. This request contains the proposal. And after the resource receives the TCP request, generating a signature identifier for the request content. This signature identification may be a signature of the request with the resource owner using its own private key. The resource returns a signature identification to the requestor (consensus node) over the established TCP connection.
The consensus node can combine the original proposal and the signature into a new proposal in a certain form according to the defined number of series stages. And the consensus node searches new resources meeting the requirements in the resource list for the second time, and if the new resources meet the requirements, the consensus node submits a request to the new resources. This request may be a service port that the TCP connects to the resource. This request contains the new proposal. And after the new resource TCP requests, generating a signature identifier for the request content. This signature identification may be a signature of the request with the resource owner using its own private key. The new resource returns a signature identification to the requestor over the established TCP connection.
The consensus node repeats this series verification process until the series progression reaches a predetermined requirement. Thus, the final resource signature identification is a tandem addressing workload proof.
The embodiment has no admission requirement on the resource owner and the consensus node, and any qualified user can participate. The consensus node uses resources to obtain the signature identity requires two parts of operations: 1. inquiring a resource list and calculating a correlation function; 2. establishing a link with the preferred resource, sending a request and obtaining a signature. Neither of these two operations requires a large number of operations. The computation amount does not increase with the number of resource nodes. The network communication volume is not increased along with the increase of the number of the resource nodes. Therefore, according to the scheme, decentralized consensus of a large number of nodes can be achieved without consuming too much energy.
The embodiment adopts multi-stage series resource verification, and can effectively reduce the bias obtained by controlling a large amount of resources by a single entity.
In the embodiment, multi-level serial resource verification is adopted, so that each consensus node cannot predict and obtains workload proofs in advance, and the workload proofs must be obtained step by step through serial TCP connection. Thus, the probability of the consensus node obtaining the proof of the workload is uncertain, which is a very important basis for the decentralized system to work.
A second embodiment of the invention is to use land resources as addressable resources. This land resource may be an area of the earth's surface or a solid space.
Each land resource owner may determine the addressing of the land according to a defined grid. An owner of a land resource may install a satellite positioning hardware system within a defined grid. This hardware location system may respond to requests addressed by the grid. One such implementation is to submit the exact RTK information where the hardware is located via RTK (real time dynamics). This RTK information can be verified by other resource nodes as to the grid address where it is located. Meanwhile, the hardware positioning system provides a service for signing and identifying the request content of the consensus node. The specific consensus steps are similar to those of the first embodiment.
Claims (10)
1. A decentralized tandem addressing workload proof, comprising:
an addressable list of resources;
calculating the resource addresses in the resource list by adopting a set correlation function and taking the proposal and the resource addresses as parameters to obtain a result;
comparing the calculation result with the set requirement;
submitting the proposal to the resource address if the requirement is met, and obtaining the signature identification of the resource to the proposal;
repeating the following steps 0 or more times according to the defined series number: taking the signature identifier or an identifier derived from the signature identifier as a new proposal, and calculating the resource address in the resource list by adopting a set correlation function and taking the new proposal and the resource address as parameters to obtain a result; comparing the calculation result with the set requirement; submitting the new proposal to the resource address if the requirement is met, and obtaining the signature identification of the resource to the new proposal;
and after the defined series stages are reached, the signature identification set of each stage is the workload proof.
2. A decentralized tandem addressing workload proof, comprising:
an addressable list of resources;
calculating the resource addresses in the resource list by adopting a set correlation function and taking the proposal and the resource addresses as parameters to obtain a result;
comparing all the results to obtain a preferred result and a corresponding preferred resource;
submitting the proposal to the preferred resource address and obtaining the signature identification of the preferred resource to the proposal;
repeating the following steps 0 or more times according to the defined series number: taking the signature identifier or an identifier derived from the signature identifier as a new proposal, and calculating the resource address in the resource list by adopting a set correlation function and taking the new proposal and the resource address as parameters to obtain a result; comparing all the results to obtain a preferred result and a corresponding new preferred resource; submitting the new proposal to the new preferred resource address and obtaining the signature identification of the new preferred resource to the new proposal;
after the defined series stages are reached, calculating to obtain a final result by adopting a target function taking the optimal result of each stage as a parameter;
comparing the final result with a set requirement;
if the requirement is met, the signature identification set of each level is the workload certification.
3. Preferred procedure according to claim 2, characterised in that one or more preferred resources can be selected, each of which is processed according to the procedure of claim 2.
4. A decentralised consensus scheme comprising:
a plurality of consensus nodes participating in consensus;
an addressable list of resources;
use of the tandem addressing workload specification of any of the preceding claims 1 to 3;
submitting a proposal and a tandem addressing workload certificate to a network;
the other nodes of the network verify acceptance of the proposal and tandem addressing workload proof, thereby achieving consensus.
5. An addressable resource list as claimed in claims 1 to 4, wherein:
a plurality of resource owners register information of addressable resources owned by the resource owners with a resource list;
a maintenance system for the resource table;
the resource table maintenance system verifies the validity and addressable accessibility of the registered resources;
the resource maintenance system realizes the management, addition and deletion operations of the resource list in a decentralized consensus mode.
6. The resource maintenance system of claim 5, wherein:
the management, addition and deletion operations of the addressable resource list are realized through intelligent contracts based on block chains.
7. The addressable resource of claim 5, wherein:
a resource owner maintains addressability of the resource;
the resource owner provides a signature identifier for the request content of the node;
the resource owner returns the signature identification to the requestor.
8. The addressable resource of claim 5, the resource including but not limited to a network address of a resource owner.
9. The addressable resource of claim 5, the resource comprising but not limited to an address of a resource owner in Earth's surface space.
10. A node participating in a consensus as claimed in claim 3 wherein:
a network interface; a memory; and a processor coupling the network interface and the memory;
the processor is configured to:
receiving a plurality of transactions through a network interface; processing each transaction acquisition result, and combining the transaction results into a proposal;
searching the resource meeting the requirement from the addressable resource list;
inquiring the resource to obtain a verification identifier;
submitting a proposal and a verification identifier to other consensus nodes;
accepting proposal and verification identification from other consensus nodes;
verifying that the proposal and the verification identifier meet the predetermined requirements;
the proposal is accepted and the local state is updated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910834253.1A CN112448817A (en) | 2019-09-05 | 2019-09-05 | Decentralization consensus scheme |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910834253.1A CN112448817A (en) | 2019-09-05 | 2019-09-05 | Decentralization consensus scheme |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112448817A true CN112448817A (en) | 2021-03-05 |
Family
ID=74732982
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910834253.1A Pending CN112448817A (en) | 2019-09-05 | 2019-09-05 | Decentralization consensus scheme |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112448817A (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106060036A (en) * | 2016-05-26 | 2016-10-26 | 布比（北京）网络技术有限公司 | Decentralized consenting method and apparatus |
| US20170344987A1 (en) * | 2016-05-24 | 2017-11-30 | Mastercard International Incorporated | Method and system for an efficient consensus mechanism for permssioned blockchains using bloom filters and audit guarantees |
| CN109005208A (en) * | 2018-06-11 | 2018-12-14 | 北京京东尚科信息技术有限公司 | Method and apparatus for pushed information |
| CN109035012A (en) * | 2018-06-11 | 2018-12-18 | 西安纸贵互联网科技有限公司 | A kind of across the chain processing method and computer readable storage medium of block catenary system |
| CN109067553A (en) * | 2018-10-17 | 2018-12-21 | 杭州趣链科技有限公司 | A kind of management method of the block chain distributed certificate based on intelligent contract |
| CN109508982A (en) * | 2018-11-21 | 2019-03-22 | 北京蓝石环球区块链科技有限公司 | REPB common recognition based on the more subchains of block chain main chain adduction row |
| WO2019125814A1 (en) * | 2017-12-21 | 2019-06-27 | Eland Blockchain Fintech Inc. | Blockchain based information security system and method |
| US20190253239A1 (en) * | 2018-11-30 | 2019-08-15 | Alibaba Group Holding Limited | Blockchain smart contract updates using decentralized decision |
| CN110176998A (en) * | 2019-05-17 | 2019-08-27 | 北京众享比特科技有限公司 | A kind of common recognition method, apparatus, equipment and the storage medium of proof of work |
-
2019
- 2019-09-05 CN CN201910834253.1A patent/CN112448817A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170344987A1 (en) * | 2016-05-24 | 2017-11-30 | Mastercard International Incorporated | Method and system for an efficient consensus mechanism for permssioned blockchains using bloom filters and audit guarantees |
| CN106060036A (en) * | 2016-05-26 | 2016-10-26 | 布比（北京）网络技术有限公司 | Decentralized consenting method and apparatus |
| WO2019125814A1 (en) * | 2017-12-21 | 2019-06-27 | Eland Blockchain Fintech Inc. | Blockchain based information security system and method |
| CN109005208A (en) * | 2018-06-11 | 2018-12-14 | 北京京东尚科信息技术有限公司 | Method and apparatus for pushed information |
| CN109035012A (en) * | 2018-06-11 | 2018-12-18 | 西安纸贵互联网科技有限公司 | A kind of across the chain processing method and computer readable storage medium of block catenary system |
| CN109067553A (en) * | 2018-10-17 | 2018-12-21 | 杭州趣链科技有限公司 | A kind of management method of the block chain distributed certificate based on intelligent contract |
| CN109508982A (en) * | 2018-11-21 | 2019-03-22 | 北京蓝石环球区块链科技有限公司 | REPB common recognition based on the more subchains of block chain main chain adduction row |
| US20190253239A1 (en) * | 2018-11-30 | 2019-08-15 | Alibaba Group Holding Limited | Blockchain smart contract updates using decentralized decision |
| CN110176998A (en) * | 2019-05-17 | 2019-08-27 | 北京众享比特科技有限公司 | A kind of common recognition method, apparatus, equipment and the storage medium of proof of work |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kouicem et al. | Decentralized blockchain-based trust management protocol for the Internet of Things | |
| CN110991622A (en) | Machine learning model processing method based on block chain network and node | |
| CN108769230B (en) | Transaction data storage method, device, server and storage medium | |
| Hassanzadeh-Nazarabadi et al. | Lightchain: A dht-based blockchain for resource constrained environments | |
| CN110177109B (en) | Double-proxy cross-domain authentication system based on identification password and alliance chain | |
| CN115510494B (en) | Multiparty safety data sharing method based on block chain and federal learning | |
| US11687562B2 (en) | Apparatus and method for adaptively managing sharded blockchain network based on deep Q network | |
| Kong et al. | A reliable and efficient task offloading strategy based on multifeedback trust mechanism for IoT edge computing | |
| CN113806699B (en) | Cross-blockchain identity verification method and system in inter-cloud computing environment | |
| CN112702402A (en) | System, method, device, processor and storage medium for realizing government affair information resource sharing and exchange based on block chain technology | |
| CN108197959A (en) | A kind of fast verification pond based on block chain, fast verification system and operating method | |
| CN111951108A (en) | Chain structure design method with intelligent contract block chain with complete picture | |
| CN113922957B (en) | Virtual cloud wallet system based on privacy protection calculation | |
| CN112291354B (en) | Privacy protection method for participants of crowd sensing MCS based on block chain | |
| CN101374159A (en) | Credible control method and system for P2P network | |
| JP2022523447A (en) | How to elect a leader node using a role-based consensus protocol in a blockchain network | |
| CN115412374B (en) | Safe data sharing method based on credit consensus mechanism | |
| CN112036886A (en) | Block chain-based power big data exchange method and system | |
| Hong et al. | A secure peer to peer multiparty transaction scheme based on blockchain | |
| Zhao et al. | Security risk and response analysis of typical application architecture of information and communication blockchain | |
| Tong et al. | Chchain: Secure and parallel crowdsourcing driven by hybrid blockchain | |
| CN115052286A (en) | User privacy protection and target query method and system based on location service | |
| CN116303767A (en) | Medical data multistage management and sharing method based on CP-ABE | |
| CN117171801B (en) | Efficient space query method and system with adjustable privacy protection intensity | |
| CN110910110A (en) | Data processing method and device and computer storage medium |
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 |