CN115208817B - Trusted cross-link routing method based on cross-link gateway and Floyd algorithm - Google Patents
Trusted cross-link routing method based on cross-link gateway and Floyd algorithm Download PDFInfo
- Publication number
- CN115208817B CN115208817B CN202210595413.3A CN202210595413A CN115208817B CN 115208817 B CN115208817 B CN 115208817B CN 202210595413 A CN202210595413 A CN 202210595413A CN 115208817 B CN115208817 B CN 115208817B
- Authority
- CN
- China
- Prior art keywords
- cross
- link
- chain
- gateway
- task
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/66—Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- 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
- H04L63/0876—Network architectures or network communication protocols for network security for authentication of entities based on the identity of the terminal or configuration, e.g. MAC address, hardware or software configuration or device fingerprint
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a trusted cross-link routing method based on a cross-link gateway and a Floyd algorithm, belonging to the technical field of block chain cross-link routing. According to the method, information interaction between block chains is realized by using the cross-chain gateway, iteration times and intermediate data are reduced when the problem of shortest paths among cross-links is solved in a network, and a cross-chain shortest path of a cross-chain task route is selected by using a Floyd algorithm. The method has no limitation and centralization risk of heterogeneous blockchain, and improves the expandability of a blockchain system. Meanwhile, the method has good reliability, dynamic programming is added by using a Di Jie Style algorithm, and the executable performance can be ensured. The method has high efficiency, and is obviously optimized in space complexity and time complexity.
Description
Technical Field
The invention relates to a trusted cross-link routing method based on a cross-link gateway and a Floyd algorithm, belonging to the technical field of block chain cross-link routing.
Background
At present, the existing chain crossing modes mainly comprise the following steps:
1. notary mechanism. And introducing one or more trusted centralized entities to make credit endorsements to carry out information cross-linking. Notary mechanisms are technically simpler to implement, but because they require adequate trust for the notary, there is a risk of centralization.
2. Hash locking mechanism. The mechanism utilizes the low collision characteristic of the hash function and the characteristic of delay execution of the blockchain transaction, sets a hash puzzle through both transaction sides, and allows a user to pay the transaction by guessing the original value of the hash value in a specified time period, thereby realizing a cross-chain mechanism of the transaction.
3. Relay chain mechanism. The collection, endorsement and forwarding of transactions are responsible for the introduction of other blockchain systems, i.e., the construction of a third party public chain to connect with other chains in the blockchain network. The relay chain mechanism can delegate the verification and endorsement of the transaction to the relay chain, but the cross-chain implementation is complex, and depends on a set of cross-chain protocols to a certain extent, so that a certain difficulty exists in accessing heterogeneous chains.
Under the background of the existing cross-link mechanism, the gateway cross-link implementation mechanism is concise, and because the gateway cross-link essence is to realize data synchronization on a cross-link gateway of an access application chain, the limitation of heterogeneous chains is avoided. Meanwhile, in order to realize the problem of solving the large-scale route in the cross-chain process, the conventional Di-Jie-Tesla routing algorithm and dynamic programming are difficult to meet the requirements of large-scale application. The program execution time of the gateway node within 1000 is acceptable, however, the scale is continued to be 10 times and 100 times, and the energy consumption and the time cost are excessive. Therefore, in order to reduce the cost of time and energy consumption and improve the execution efficiency of the cross-chain task program, the iteration times are required to be reduced, and the storage of intermediate data is processed, so that the aim of optimizing in time and space is fulfilled.
Disclosure of Invention
The invention aims to overcome the defects in the prior art, and provides a trusted cross-link routing method based on a cross-link gateway and a Floyd algorithm, which aims to solve the technical problems of long large-scale cross-link routing time and low efficiency of a block chain system.
According to the method, information interaction between block chains is realized by using the cross-chain gateway, iteration times and intermediate data are reduced when the problem of shortest paths among cross-links is solved in a network, and a cross-chain shortest path of a cross-chain task route is selected by using a Floyd algorithm.
In order to achieve the above purpose, the present invention adopts the following technical scheme.
First, the conceptual contents related to the present invention will be described.
1. A cross-chain gateway. Is an interactive component connecting different blockchain systems, takes the role of collecting and propagating transactions among blockchains, and supports message interaction between application chains.
2. Gateway routing table. Generated, updated and maintained by the cross-chain gateway. The gateway routing table stores addresses of all cross-link gateways in the cross-link routing network, the best distances of the local cross-link gateway to other cross-link gateways, and the routing of the best distances (the routing at this time is the best routing). The optimal distance represents the minimum energy consumption in the information transfer between two cross-chain gateways.
In order to maintain the optimal distance between two cross-chain gateways in the gateway routing table, each cross-chain gateway periodically exchanges information with all its neighboring gateways. If the optimal distance from one gateway to any adjacent gateway changes after the switching is finished, the switching process is repeated until all the gateways finish updating the routing table.
Floyd algorithm. Also known as the interpolation method, is an algorithm for finding the shortest path between multiple source points in a given weighted graph. Initially, for any two nodes, if an edge exists between the nodes, taking the weight on the edge as the shortest path length between the nodes; if no directed edge exists, then +. then gradually try to add nodes in the original path as intermediate nodes, if the obtained path is shorter than the original path after adding the intermediate node, the new path is used for replacing the original path.
4. A chain of applications. The isomorphic application chains have similar block structures and transaction data storage formats and have the same consensus algorithm and encryption mechanism.
5. An intelligent contract. A computer protocol intended to propagate, verify or execute contracts in an informative manner. The smart contract accepts the user's business request, transfers the business to the distribution server, and links the data information of each business in the identity management and mortgage loan.
6. A cross-chain task. A cross-chain message or cross-chain transaction raised by an account on an application chain includes a local account address, a source application chain ID, a target account address, a target application chain ID, a timestamp of the occurrence of a cross-chain event, cross-chain task content, and cross-chain task attestation.
7. The cross-links are by the network. The P2P network consists of a plurality of cross-link gateways, including the cross-link gateways associated with application chains, and cross-link tasks are transferred and forwarded in the cross-link network.
The trusted cross-link routing method based on the cross-link gateway and the Floyd algorithm comprises the steps of cross-link task proposal and verification, cross-link routing selection and cross-link task receipt, and the method comprises the following steps of:
step 1: and accessing an application chain by the cross-chain gateway, and configuring application chain port information.
Step 2: registering addresses of the cross-link gateways so as to find the cross-link gateways of adjacent application chains; and according to the energy transfer value of the information transmission between the gateways, generating a Floyd algorithm and maintaining a gateway routing table.
Step 3: the cross-link gateway enters an initialized monitoring state and monitors user operation; and finding the optimal route selection of the cross-link task according to the source link ID, the target link ID and the gateway route table of the cross-link task.
Specifically, step 3 may include the steps of:
step 3.1: a local account on an application chain initiates a cross-chain task, and the cross-chain task is submitted to a cross-chain gateway associated with the application chain;
specifically, step 3.1 may comprise the steps of:
step 3.1.1: the local account submits a cross-link task request to an application chain through an intelligent contract;
step 3.1.2: after receiving the cross-link task request, the application chain verifies whether the structure and the content of the cross-link task are valid (whether the local account address is legal, etc.), if not, the execution of the cross-link task is refused, and if so, the step 3.1.3 is executed;
step 3.1.3: the application chain forwards the cross-chain task to the associated cross-chain gateway while the cross-chain task is stored on the blockchain.
Step 3.2: the cross-link gateway detects the validity of the account cross-link task (including whether the local account has authority, whether the account asset is sufficient, etc.); if the cross-link task lifted by the local account is illegal, refusing to execute the cross-link task, and if the cross-link task is legal, executing the step 3.3;
step 3.3: inquiring a target cross-link gateway associated with a target application chain in a locally stored gateway routing table according to a target application chain ID of the cross-link task by the cross-link gateway, finding an optimal route from the local cross-link gateway to the target cross-link gateway according to the information of the gateway routing table, and forwarding the cross-link task to the target cross-link gateway according to optimal route selection;
step 4: the target cross-link gateway detects a cross-link task, firstly detects whether the cross-link task target account address is legal, refuses to execute if the target account address is illegal, and sends back a refusal receipt; if the target account address is legal, the target cross-link gateway receives a cross-link task and forwards the cross-link task to a target application chain;
step 5: and the target application chain forwards the cross-link task to the target account for execution according to the target account address in the cross-link task, and returns a receipt of successful execution of the cross-link task.
Specifically, step 5 may include the steps of:
step 5.1: the target application chain sends the determined execution of the cross-link task to the target account through the intelligent contract according to the target account address in the cross-link task;
step 5.2: each node of the target application chain carries out consensus on the cross-chain task;
step 5.3: after the target application chain nodes succeed in consensus, adding a cross-chain task on the block chain;
step 5.4: the target application chain returns a receipt of successful execution of the cross-chain task.
Step 6: after detecting that the execution of the cross-link task is successful, the cross-link gateway sends back an execution success receipt to the application chain, and the cross-link task is completed once at the moment.
Advantageous effects
Compared with the prior art, the method has the following advantages:
1. according to the method, information interaction among different blockchains is performed by adopting the cross-chain gateway, the limitation and the centralization risks of heterogeneous blockchains are avoided, and the expandability of a blockchain system is improved.
2. The method has good reliability, adopts the idea of adding dynamic programming by using the Di Jie Style algorithm, and can ensure the executable performance.
3. The method has high efficiency, and is obviously optimized in space complexity and time complexity.
Drawings
FIG. 1 is a schematic flow chart of the method of the present invention.
Detailed Description
The invention is described in further detail below with reference to the drawings and the detailed description. The described embodiments are only some, but not all, embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
As shown in fig. 1, a trusted cross-link routing method based on a cross-link gateway and a Floyd algorithm.
The present embodiment details cross-chain gateway routing in a blockchain enabled information interaction scenario. In the recruitment scene, a recruiter A company has the business requirements of collecting and authenticating the information of the student of the corresponding recruiter B. Aiming at the information authentication service request of the student level of the first company, the university of the student level of the second is required to provide the student level certification of the student level of the second.
The embodiment describes that the method of the invention is adopted to transmit the position certificate in the recruitment scene from the university C to the first company in a cross-chain manner, and the method comprises the following steps:
step 1: accessing a university of C application chain through a cross-chain gateway A, and configuring university of C application chain port information; the cross-chain gateway B accesses an A company application chain and configures the port information of the A company application chain.
Step 2: registering addresses of the inter-link gateways so as to find operation inter-link gateways of adjacent application links, and respectively generating and maintaining a gateway routing table A and a gateway routing table B based on a Floyd algorithm according to energy consumption values of information transfer between the gateways by the inter-link gateway A and the inter-link gateway B.
Specifically, the method utilizes energy consumption of message transfer between the cross-chain gateways, and generates a gateway routing table based on a Floyd algorithm for cross-chain gateway selection during information forwarding. In a graph formed by a network in a cross-link mode, nodes represent cross-link gateways, edges between two nodes represent the two cross-link gateways and can be used for information interaction, and weights of the edges represent the distance between the two nodes, namely energy consumption cost when information is transferred between the two cross-link gateways.
The characters involved in the method in this embodiment are as shown in table 1:
table 1 the method in this embodiment relates to character description
Input G, i
Output Gop
First, each node generates a local initial routing matrix that records the initial distances between the local node and all other nodes.
Taking the initial route matrix generated by the node i as an example, for any node j, if an edge exists between i and j, taking the weight g [ i ] [ j ] of the edge as the initial distance between the two nodes, if no directed edge exists, the initial distance between the two nodes is infinite, namely g [ i ] [ j ] = infinity, at the moment, the optimal route between the i and j is from the node i to the node j, and the optimal route between the i and j is set to be-1, thereby generating the initial route matrix.
Then, updating the initial routing matrix, generating a gateway routing table through the insertion point, and performing the following operations on the initial distance from the local node i to each other node: if node i to node j pass through node k and gj [ i ] [ j ] > gi ] +gk [ j ], the optimal distance from i to j is gi ] +gk [ j ], and the optimal route from i to j is updated from i to k to j. Thereby generating a gateway routing table for the local node;
similarly, for each node of the cross-link routing network, a gateway routing table is generated according to the above procedure.
Step 3: the cross-chain gateway A enters an initialized monitoring state, monitors the operation of the second student on the application chain of the third university, and selects the optimal route to the cross-chain gateway B according to the source chain ID of the second student cross-chain task, the target chain ID and the gateway routing table A.
Step 3.1: initiating a academic proof cross-chain task by an account of an student of the university of C, wherein the academic proof cross-chain task is submitted to a cross-chain gateway A associated with the application chain of the university of C, and the academic proof cross-chain task comprises an account address of the student of C, an application chain ID of the university of C, an application chain ID of the company of A, a recruitment unit account address of the company of A, a timestamp of occurrence of a cross-chain event, the academic proof of the student of B and a cross-chain task proof;
step 3.1.1: the second student account submits the academic evidence cross-chain task request to the third university application chain through an intelligent contract;
step 3.1.2: after receiving the request of the academic-proving cross-chain task, the application chain of the university of C verifies whether the structure and the content of the academic-proving cross-chain task are valid (whether the account address of the college of B is legal or not, etc.), if not, the execution of the academic-proving cross-chain task is refused, and if so, the step 3.1.3 is executed;
step 3.1.3: the university of c application chain forwards the degree proof cross-chain task to the associated cross-chain gateway a, while the degree proof cross-chain task is stored on the university of c application chain.
Step 3.2: the cross-chain gateway A detects the validity of the cross-chain task of the student account degree proof (whether the student account has authority, whether the account assets are sufficient, and the like) and refuses the execution of the cross-chain task if the degree proof lifted by the student account is illegal; if the degree proves that the cross-chain transaction is legal, executing the step 3.3;
step 3.3: the method comprises the steps that a cross-link gateway A inquires a cross-link gateway B related to an A company application chain in a gateway routing table A stored locally in the cross-link gateway A according to a degree proof cross-link task A company application chain ID, and forwards the cross-link task to the cross-link gateway B according to optimal distances and optimal routes of the cross-link gateways A and B recorded in the gateway routing table A;
step 4: the inter-chain gateway B detects that the academic position proves the inter-chain task, firstly detects whether the academic position proves that the recruitment unit account address of the inter-chain task A company is legal or not, refuses to execute if the recruitment unit account address of the A company is illegal, and returns a refusal receipt; if the recruitment unit account address of the A company is legal, the cross-chain gateway B receives the academic evidence cross-chain task and forwards the academic evidence cross-chain task to the A company application chain;
step 5: the first company application chain forwards the academic position evidence to the first company recruitment unit account for execution according to the first company recruitment unit account address in the cross-chain task, and returns a receipt of successful execution of the academic position evidence to the cross-chain gateway B;
step 5.1: the first company application chain sends the confirmed executed academic proof cross-chain task to a first company recruitment unit through an intelligent contract according to the target account address in the academic proof cross-chain task;
step 5.2: each node of the recruitment unit of the A company carries out consensus on the academic position evidence cross-chain task;
step 5.3: after the node consensus of the recruitment unit of the first company is successful, adding the academic evidence cross-chain task on an application chain of the first company;
step 5.4: the A company application chain returns a degree proof of successful receipt of the cross-chain task execution to the cross-chain gateway B.
Step 6: after detecting that the academic degree proves that the execution of the cross-chain task is successful, the cross-chain gateway B sends back an execution success receipt to the cross-chain gateway A, and the cross-chain gateway A sends back an execution success receipt to the university of C application chain to complete the cross-chain task once.
Claims (4)
1. The trusted cross-link routing method based on the cross-link gateway and the Floyd algorithm is characterized by comprising the following steps of:
step 1: accessing an application chain by a cross-chain gateway and configuring application chain port information;
step 2: registering addresses of the inter-link gateways so as to find the inter-link gateways of adjacent application links, and generating and maintaining a gateway routing table based on a Floyd algorithm according to energy consumption values of information transfer between the gateways;
step 3: the cross-link gateway enters an initialized monitoring state, monitors user operation, and finds out the optimal route selection of the cross-link task according to the source link ID, the target link ID and the gateway route table of the cross-link task;
step 3.1: a local account on an application chain initiates a cross-chain task, and the cross-chain task is submitted to a cross-chain gateway associated with the application chain;
step 3.2: the method comprises the steps that a cross-link gateway detects the effectiveness of an account cross-link task, and if the cross-link task lifted by a local account is illegal, execution of the cross-link task is refused; if the cross-link task is legal, executing the step 3.3;
step 3.3: inquiring a target cross-link gateway associated with a target application chain in a locally stored gateway routing table according to a target application chain ID of the cross-link task by the cross-link gateway, finding an optimal route from the local cross-link gateway to the target cross-link gateway according to the information of the gateway routing table, and forwarding the cross-link task to the target cross-link gateway according to optimal route selection;
step 4: the target cross-link gateway detects a cross-link task, firstly detects whether the cross-link task target account address is legal, refuses to execute if the target account address is illegal, and sends back a refusal receipt; if the target account address is legal, the target cross-link gateway receives a cross-link task and forwards the cross-link task to a target application chain;
step 5: the target application chain forwards the cross-link task to a target account for execution according to the target account address in the cross-link task, and returns a receipt of successful execution of the cross-link task;
step 6: after detecting that the execution of the cross-link task is successful, the cross-link gateway sends back an execution success receipt to the application chain, and the cross-link task is completed once at the moment.
2. The method of trusted cross-link routing based on cross-link gateway and Floyd algorithm of claim 1, wherein step 3.1 comprises the steps of:
step 3.1.1: the local account submits a cross-link task request to an application chain through an intelligent contract;
step 3.1.2: after receiving the cross-link task request, the application chain verifies whether the structure and the content of the cross-link task are valid, if not, the execution of the cross-link task is refused, and if not, the step 3.1.3 is executed;
step 3.1.3: the application chain forwards the cross-chain task to the associated cross-chain gateway while the cross-chain task is stored on the blockchain.
3. The method of trusted cross-link routing based on cross-link gateway and Floyd algorithm of claim 1, wherein step 5 comprises the steps of:
step 5.1: the target application chain sends the determined execution of the cross-link task to the target account through the intelligent contract according to the target account address in the cross-link task;
step 5.2: each node of the target application chain carries out consensus on the cross-chain task;
step 5.3: after the target application chain nodes succeed in consensus, adding a cross-chain task on the block chain;
step 5.4: the target application chain returns a receipt of successful execution of the cross-chain task.
4. The method of claim 1, wherein the method for generating and maintaining the gateway routing table based on the Floyd algorithm based on the energy consumption value of the information transfer between the gateways is as follows:
firstly, each node generates a local initial routing matrix, and the initial routing matrix records initial distances between the local node and all other nodes;
in a graph formed by a network in a cross-link mode, nodes represent cross-link gateways, and edges between two nodes represent the two cross-link gateways and can carry out information interaction; the weight g of the edge represents the distance between two nodes, namely the energy consumption cost when information is transferred between two cross-chain gateways; i, j, k represent nodes in a graph composed of networks across links;
when the node i generates an initial route matrix, for any node j, if an edge exists between i and j, taking the weight g [ i ] [ j ] of the edge as the initial distance between the two nodes, if no directed edge exists, the initial distance between the two nodes is infinite, namely g [ i ] [ j ] = infinity, at the moment, the optimal route between the i and j is from the node i to the node j, and the optimal route between the i and j is set to be-1, so that the initial route matrix is generated;
then, updating the initial routing matrix, generating a gateway routing table through the insertion point, and performing the following operations on the initial distance from the local node i to each other node: if node i to node j pass through node k and gi j > gi k+gk j, the optimal distance from i to j is gi k+gk j, and the optimal route from i to j is updated from i to k to j; thereby generating a gateway routing table for the local node;
similarly, for each node of the cross-link routing network, a gateway routing table is generated according to the above procedure.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210595413.3A CN115208817B (en) | 2022-05-29 | 2022-05-29 | Trusted cross-link routing method based on cross-link gateway and Floyd algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210595413.3A CN115208817B (en) | 2022-05-29 | 2022-05-29 | Trusted cross-link routing method based on cross-link gateway and Floyd algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115208817A CN115208817A (en) | 2022-10-18 |
| CN115208817B true CN115208817B (en) | 2023-10-10 |
Family
ID=83576697
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210595413.3A Active CN115208817B (en) | 2022-05-29 | 2022-05-29 | Trusted cross-link routing method based on cross-link gateway and Floyd algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115208817B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110266655A (en) * | 2019-05-30 | 2019-09-20 | 中国工商银行股份有限公司 | A kind of across chain interconnected method, equipment and system based on block chain |
| CN112887380A (en) * | 2021-01-15 | 2021-06-01 | 杭州链网科技有限公司 | Cross-chain intercommunication method and system |
| WO2021136251A1 (en) * | 2019-12-30 | 2021-07-08 | 北京金山云网络技术有限公司 | Cross-blockchain communication method and apparatus, cross-chain service system and cross-chain transaction system |
| WO2021218459A1 (en) * | 2020-04-28 | 2021-11-04 | 北京邮电大学 | Cross-chain interaction method, apparatus and system |
| CN113807960A (en) * | 2021-03-04 | 2021-12-17 | 京东科技控股股份有限公司 | Cross-link processing method, device and system between heterogeneous chains and electronic equipment |
| CN113923044A (en) * | 2021-10-29 | 2022-01-11 | 博雅正链(北京)科技有限公司 | Chain crossing system and method based on trusted execution environment |
| CN113965329A (en) * | 2021-10-25 | 2022-01-21 | 浙江师范大学 | Cross-chain interoperation system, method, medium and data processing terminal |
-
2022
- 2022-05-29 CN CN202210595413.3A patent/CN115208817B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110266655A (en) * | 2019-05-30 | 2019-09-20 | 中国工商银行股份有限公司 | A kind of across chain interconnected method, equipment and system based on block chain |
| WO2021136251A1 (en) * | 2019-12-30 | 2021-07-08 | 北京金山云网络技术有限公司 | Cross-blockchain communication method and apparatus, cross-chain service system and cross-chain transaction system |
| WO2021218459A1 (en) * | 2020-04-28 | 2021-11-04 | 北京邮电大学 | Cross-chain interaction method, apparatus and system |
| CN112887380A (en) * | 2021-01-15 | 2021-06-01 | 杭州链网科技有限公司 | Cross-chain intercommunication method and system |
| CN113807960A (en) * | 2021-03-04 | 2021-12-17 | 京东科技控股股份有限公司 | Cross-link processing method, device and system between heterogeneous chains and electronic equipment |
| CN113965329A (en) * | 2021-10-25 | 2022-01-21 | 浙江师范大学 | Cross-chain interoperation system, method, medium and data processing terminal |
| CN113923044A (en) * | 2021-10-29 | 2022-01-11 | 博雅正链(北京)科技有限公司 | Chain crossing system and method based on trusted execution environment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115208817A (en) | 2022-10-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Nguyen et al. | Privacy-aware blockchain innovation for 6G: Challenges and opportunities | |
| CN109246211B (en) | Resource uploading and resource requesting method in block chain | |
| CN112418860A (en) | Block chain efficient management framework based on cross-chain technology and working method | |
| CN108616596A (en) | It is adaptively known together method based on the block chain that dynamic authorization and network environment perceive | |
| US20230316273A1 (en) | Data processing method and apparatus, computer device, and storage medium | |
| CN112583917B (en) | CSCP-based hybrid chain construction method | |
| CN111371905B (en) | Block chain layering consensus proving system and method based on cloud computing | |
| CN112907252B (en) | Block chain transaction method and system based on multi-person chain lower channel | |
| CN113328997B (en) | Alliance chain crossing system and method | |
| CN111294339B (en) | Homogeneous alliance chain cross-chain method and device based on Fabric architecture | |
| CN109245894B (en) | Distributed cloud storage system based on intelligent contracts | |
| CN110177109B (en) | Double-proxy cross-domain authentication system based on identification password and alliance chain | |
| CN113422733B (en) | Service processing method and device of block chain, computer equipment and storage medium | |
| CN111262860A (en) | Identity authentication method and device in cross-link mode | |
| CN111106940A (en) | Certificate transaction verification method of resource public key infrastructure based on block chain | |
| CN113255014B (en) | Data processing method based on block chain and related equipment | |
| KR20200081533A (en) | Blockchain Consensus Method based Improved Dynamic Blind Voting for Internet of Things Environment | |
| Le et al. | A lightweight block validation method for resource-constrained iot devices in blockchain-based applications | |
| Vairagade et al. | Enabling machine learning‐based side‐chaining for improving QoS in blockchain‐powered IoT networks | |
| CN115865418A (en) | Cross-domain access control scheme based on block chain and Byzantine fault-tolerant algorithm | |
| Lu et al. | CoinLayering: an efficient coin mixing scheme for large scale bitcoin transactions | |
| Xie et al. | HCVC: A high-capacity off-chain virtual channel scheme based on bidirectional locking mechanism | |
| CN115208817B (en) | Trusted cross-link routing method based on cross-link gateway and Floyd algorithm | |
| CN112950180A (en) | Community certificate method and system based on alliance chain, electronic device and storage medium | |
| CN115842676A (en) | Cross-chain transaction method, system and medium based on notary group |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |