Multimodal transport information management method and system based on block chain

Abstract

The invention provides a multimodal transport information management method and system based on a block chain, and relates to the technical field of information management, and the method comprises the steps: obtaining a transport information document of a corresponding participant through each side chain; carrying out desensitization on the intermodal information document in a coupling mode by combining a ring signature and zero-knowledge proof; under the condition that the desensitized combined transport information document changes, updating the combined transport information document through a dynamic fault-tolerant consensus mechanism, and recording a consensus forming moment; collecting network delay between each side chain and the main chain; carrying out predictive delay compensation on a consensus forming moment based on network delay; and judging whether the updated intermodal information document arrives at a target site or not through a preset smart contract, if so, sending the updated intermodal information document to a target user marked by the preset smart contract, and otherwise, collecting network delay to continue to maintain the intermodal information document. And the consistency, the accuracy and the security of the combined transport information are improved.

Description

Technical Field

[0001] The present invention relates to the field of information management technology, and in particular to a multimodal transport information management method and system based on blockchain. Background Art

[0002] Blockchain is a decentralized distributed ledger technology with the characteristics of data immutability, traceability, transparency and security. It ensures trust and reliable information flow under multi-party collaboration through a consensus mechanism. Multimodal transport information refers to the collection of all logistics, cargo status, document records and transaction information involved in the transportation of goods through different modes of transportation (such as rail, road, sea and air).

[0003] With the continuous development of global trade, multimodal transport, as an efficient way of transporting goods, combines different modes of transport (such as sea, land, and air transport) to achieve fast and safe transportation of goods. Multimodal transport involves multiple modes of transport and participants, and information is scattered and complex to transmit. Efficient management of multimodal transport information can improve logistics transparency, reduce information silos, prevent data tampering or loss, and achieve traceability of the entire transportation process, thereby improving transportation efficiency and reducing costs.

[0004] However, the existing multimodal transport information is not well circulated between different transport links, and the information management process is centralized, which makes it very easy for data to be tampered with and cannot be traced. The authenticity is difficult to guarantee, which increases the difficulty of managing multimodal transport information. Moreover, customer information is public during the multimodal transport process, which increases the risk of customer information leakage. Summary of the invention

[0005] In order to solve the problem that the information flow of multimodal transport information between different transport links is not smooth in the existing technology, the information management process is centralized, and it is very easy to have data tampering and untraceable data, and the authenticity is difficult to guarantee, which increases the difficulty of managing multimodal transport information. In addition, customer information is public during the multimodal transport process, which increases the risk of customer information leakage. The present invention provides a multimodal transport information management method and system based on blockchain.

[0006] The technical solution provided by the embodiment of the present invention is as follows:

[0007] First aspect

[0008] An embodiment of the present invention provides a multimodal transport information management method based on blockchain, which is applied to a multimodal transport information management platform, wherein the multimodal transport information management platform includes a plurality of side chains that are bridged to a main chain, the side chains are bridged to each other, and each side chain corresponds to a participant; the method includes:

[0009] S1: Obtain the intermodal information document of the corresponding participant through each side chain, wherein the intermodal information document is located at the current participant of the intermodal information record;

[0010] S2: Combine ring signature and zero-knowledge proof to desensitize intermodal information documents in a coupled manner;

[0011] S3: When the desensitized intermodal information document changes, the intermodal information document is updated through a dynamic fault-tolerant consensus mechanism, and the time when the consensus is formed is recorded;

[0012] S4: Collect the network delay between each side chain and the main chain;

[0013] S5: Based on network delay, predictive delay compensation is performed on the consensus formation moment;

[0014] S6: Determine whether the updated intermodal information document has arrived at the target site through the preset smart contract. If so, proceed to step S7; otherwise, return to step S3;

[0015] S7: Send the updated intermodal transport information document to the target user with the preset smart contract tag.

[0016] Second aspect

[0017] An embodiment of the present invention provides a multimodal transport information management system based on blockchain, including:

[0018] processor;

[0019] A memory having computer-readable instructions stored therein, wherein when the computer-readable instructions are executed by the processor, the multimodal transport information management method based on blockchain as in the first aspect is implemented.

[0020] The third aspect

[0021] An embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored. When the program is executed by a processor, the multimodal transport information management method based on blockchain as in the first aspect is implemented.

[0022] The beneficial effects brought about by the technical solution provided by the embodiment of the present invention include at least:

[0023] In the present invention, the blockchain platform in the form of main and side chains is combined to circulate the intermodal information in parallel, and the intermodal information is managed in a decentralized manner to avoid the risk of information tampering. In the process of circulation, the intermodal information is desensitized by coupling the ring signature and zero-knowledge proof, hiding the identity of the sender, protecting data privacy, and ensuring the authenticity and security of the information. In addition, in the process of the circulation of intermodal information, a dynamic fault-tolerant consensus mechanism is used to control the update of information. While ensuring the accuracy of information updates, it can tolerate malicious or faulty behaviors of some nodes in multi-party collaboration, and dynamically adjust the consensus conditions to ensure the accuracy and efficiency of information updates, effectively improve the security of data and the robustness of the system, and avoid conflicts or delays caused by inconsistent information during transportation. In addition, delay compensation is performed on the moment of consensus formation to avoid the problem of consensus verification delays and failures caused by the accumulation of network delays on multiple side chain platforms, thereby improving the efficiency, authenticity and security of intermodal information management. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0025] Figure 1 A flowchart of a multimodal transport information management method based on blockchain provided by an embodiment of the present invention;

[0026] Figure 2 A schematic diagram of the structure of a multimodal transport information management platform provided by an embodiment of the present invention;

[0027] Figure 3 A schematic diagram of the structure of a multimodal transport information management system based on blockchain provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0028] The technical solution of the present invention is described below in conjunction with the accompanying drawings.

[0029] In the embodiments of the present invention, words such as "exemplarily" and "for example" are used to indicate examples, illustrations or explanations. Any embodiment or design described as "example" in the present invention should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of the word "example" is intended to present the concept in a specific way. In addition, in the embodiments of the present invention, the meaning expressed by "and / or" can be both, or it can be either of the two.

[0030] In order to make the technical problems, technical solutions and advantages to be solved by the present invention more clear, a detailed description will be given below with reference to the accompanying drawings and specific embodiments.

[0031] Reference Manual Attached Figure 1 , showing a flow chart of a multimodal transport information management method based on blockchain provided by an embodiment of the present invention.

[0032] Reference Manual Attached Figure 2 , showing a structural schematic diagram of a multimodal transport information management method based on blockchain provided by an embodiment of the present invention.

[0033] Figure 2 In the blockchain, the number of side chains is consistent with the number of participants, and side chain n corresponds to the nth participant.

[0034] An embodiment of the present invention provides a multimodal transport information management method based on blockchain, which is applied to a multimodal transport information management platform, wherein the multimodal transport information management platform includes multiple side chains that are bridged to the main chain, the side chains are bridged to each other, and each side chain corresponds to a participant.

[0035] Among them, the main chain is the core chain in the blockchain system, which is mainly responsible for the security, data storage and global consensus of the entire network. It provides infrastructure support to ensure the credibility and consistency of multi-party collaboration. The side chain is an independent blockchain connected to the main chain, allowing different functions or participants to use personalized blockchain systems, while realizing data interaction and verification with the main chain through a bridging mechanism. Through the division of labor and collaboration between the main chain and the side chain architecture, the main chain ensures the credibility and consistency of global data, and the side chain provides independent computing and data management capabilities for different participants, thereby realizing efficient and secure multimodal transport information management.

[0036] It should be noted that the purpose of bridging the side chains is to achieve data interaction and verification between side chains and between the side chains and the main chain, ensuring that information can flow and share seamlessly on different chains. The bridging mechanism enables each independent side chain to maintain its personalized functions while achieving global consistency and security through the bridge provided by the main chain. Through bridging, each side chain can achieve cross-chain transactions, state synchronization and data intercommunication without sacrificing independence, thereby supporting multi-party collaboration and improving the overall efficiency and reliability of the system.

[0037] In a possible implementation, each bridging method is specifically a bridging mechanism based on a hash time lock contract, and the hash time lock contract is used to verify whether the transaction conditions between each chain are met.

[0038] Among them, the hash time lock contract is a smart contract mechanism that requires both parties to provide the correct hash value match within a preset time limit to complete the transaction, ensuring the atomicity and security of the transaction. The bridge mechanism is a technology that realizes the interaction of data or assets between blockchains, and ensures the secure and reliable data exchange between chains through smart contracts and other means. Through the bridge mechanism based on the hash time lock, each chain verifies whether the transaction conditions are met, ensuring the secure transmission of data or assets between multiple chains, and realizing the atomicity of the transaction, avoiding information loss or inconsistency.

[0039] In one possible implementation, the verification process of the hash time lock contract is as follows:

[0040] Receive transaction instructions about the sender and the receiver, where the sender and the receiver are both main chains or side chains.

[0041] In response to the transaction instruction, the sender generates a hash value of the random number R and discloses the random number to the receiver:

[0042] H(R)=Hash(R)

[0043] R=Hash(T lock ||S0)

[0044] T lock =T current +ΔT lock

[0045] Where Hash represents an irreversible hash algorithm, H(R) represents the hash value of the random number R, || represents concatenation, and T current Indicates the current timestamp, T lock Indicates the time lock value, ΔT lock It indicates the time length defined by the time lock, and S0 indicates the random seed.

[0046] Among them, an irreversible hash algorithm is an encryption algorithm that converts input data (such as random numbers, messages, etc.) into a fixed-length output (hash value) through fixed rules, and the original input cannot be reversed through the hash value. Common algorithms include SHA-256, etc., which are characterized by uniqueness, irreversibility and high efficiency.

[0047] In the process of hash value generation, random numbers are generated in combination with time locks. The random numbers are not only unpredictable, but also associated with the current time, which further improves security and uniqueness. The time lock ensures that the random numbers are valid within a specific time range, preventing replay attacks and transaction delays. This mechanism can enhance the atomicity and timeliness of transactions, while reducing the risk of data leakage and attacks, and ensuring the accuracy and reliability of cross-chain operations.

[0048] Save the sender's random number and time lock.

[0049] Within the agreed time range of the time lock, if the recipient's random number is received, the uniqueness of the recipient is determined by the number of random numbers.

[0050] Generate a hash value of the received random number while ensuring uniqueness.

[0051] When the hash values ​​of the sender and the receiver are consistent, the transaction instruction is determined to be verified.

[0052] It should be noted that in a hash time lock contract, the sender generates a hash value of a random number and makes it public to the receiver, while setting a time lock. Within the specified time, the receiver provides a random number to verify the validity of the transaction. This method uses an irreversible hash algorithm to ensure that the random number cannot be reversed, which improves security. If the hash values ​​of both parties are consistent, the transaction is confirmed to be completed. Otherwise, the transaction fails. This process ensures the atomicity, security, and credibility of inter-chain interactions of transactions.

[0053] In one possible implementation, the participating parties include railway transport parties, road transport parties, sea transport parties, and air transport parties.

[0054] The processing flow of the multimodal transport information management method based on blockchain may include the following steps:

[0055] S1: Obtain the intermodal information documents of the corresponding participants through each side chain.

[0056] Among them, the intermodal transport information document is located at the current participant of the intermodal transport information record.

[0057] Among them, intermodal information documents refer to documents that record key information such as cargo transportation data, logistics status, and operation records of each transport participant (such as railway, road, sea, and air transport) during the multimodal transport process. These documents may include documents such as freight bills, bills of lading, and packing lists, which reflect the specific process of cargo circulation. Obtaining the intermodal information documents of the current participants through each side chain can ensure that the data information of different modes of transportation is fully recorded and effectively traced, realize transparent management and efficient circulation of the entire process, and provide reliable data support for multi-party collaboration.

[0058] S2: Combine ring signature and zero-knowledge proof to desensitize intermodal information documents in a coupled manner.

[0059] Among them, the ring signature is an encryption algorithm that allows a user to sign on behalf of a user group while hiding the true identity of the signer. The verifier can only confirm that the signature comes from a member of the group, but cannot determine the specific signer. Zero-knowledge proof is an encryption technology used to prove that a specific statement is true, but does not reveal more information. For example, without exposing the content, it proves that the intermodal document meets certain constraints (such as valid timestamps, legality, etc.). The coupling method refers to the combination of ring signatures and zero-knowledge proofs in the desensitization process. The ring signature hides the identity of the sender, and the zero-knowledge proof verifies the authenticity and legality of the data, thereby achieving stronger privacy protection. The ring signature hides the identity of the signer, the zero-knowledge proof verifies the validity of the document, and combines the two to achieve data desensitization, effectively preventing the leakage of sensitive information in multi-chain interactions, and improving the security and privacy protection of data transmission.

[0060] In a possible implementation, the desensitization formula is specifically:

[0061] Σ sig =(σ,π)

[0062] σ=(L,c1,s1,s2,…,s N )

[0063] L = {pk1, pk2, ..., pk N}

[0064] c1=Hash(m||pk1||R c )

[0065] π=Prove(m,C(m))

[0066] Where σ represents the ring signature used to hide the identity of the sender, π represents the zero-knowledge proof of the intermodal information document m, Σ sig represents the desensitized signature about σ and m, pk i represents the public key of the ith participant, i.e., the public identity, i = 1, 2, ..., N, N represents the total number of participants, L represents the public key set, s i represents the pseudo-random number of the ith participant, s i With pk i Based on the one-to-one correspondence of label i, C(m) represents the constraint function used to verify whether the intermodal information document m is correct, c1 represents the initial hash value, R c Represents the random number generated in the c1 generation process, and Prove represents the zero-knowledge proof protocol.

[0067] Optionally, the zero-knowledge proof protocol can be zk-SNARK or zk-STARK. The public key can be an RSA public key or an ECC public key. The generation of public keys is entirely based on mathematical operations and has no direct connection with the specific identity of the participants (such as name, role, etc.). The generation of public and private keys does not consider "who generates them", but depends on who owns the generated key pair. π is a proof generated by the submitter, which contains evidence that m conforms to C(m), but does not disclose m.

[0068] Among them, the constraint function can be: whether the document contains a valid timestamp, whether the goods meet the transportation standards, and whether the submitter has legal transportation qualifications.

[0069] The initial hash value is the starting point of the entire verification chain, but it does not depend on the private key of the real signer. The signer constructs a loop structure through c1, so that the verifier can only confirm that the signature comes from a participant in L, but cannot know which one it is. The generation process of the ring signature σ is as follows: the real signer selects a random value and calculates the initial value c1 through the hash function. The calculation of the subsequent chain: the value of each ring is calculated by the following recursive method i+1 =H(m||pk i+1 ||s i ), pk i+1 is the public key of the next participant in the ring. When the calculation is complete, connect c1 to c N , ensure that c1 = c N , complete the ring signature. Recalculate c during verification i+1 , if c1=c N The verification is successful.

[0070] It should be noted that the desensitization formula achieves a balance between privacy protection and data verification through the coupling of ring signatures and zero-knowledge proofs. Ring signatures hide the true identity of the signer, making it impossible for the verifier to track the specific participants, while zero-knowledge proofs ensure the authenticity and compliance of intermodal information documents without exposing any sensitive information. The advantage of coupling the two is that while protecting the privacy of the sender, the data can be efficiently and reliably verified, and the dynamic generation of random numbers and public keys further enhances the tamper-resistance and security of desensitized data, making it suitable for high-privacy scenarios with multi-party collaboration.

[0071] S3: In the event of changes to the desensitized intermodal transport information document, the intermodal transport information document is updated through a dynamic fault-tolerant consensus mechanism, and the time when the consensus is formed is recorded.

[0072] Among them, the dynamic fault-tolerant consensus mechanism is a distributed consensus algorithm that can dynamically adjust the number of nodes and messages participating in the consensus in the presence of a certain number of malicious or faulty nodes to ensure that the system reaches consensus and maintains stability. It can adapt to changes in network status and improve the fault tolerance and efficiency of the system. The moment of consensus formation refers to the time point when all participating nodes reach a consensus on an event (such as data update). This time marks the consistent state record of the entire network in the distributed system, ensuring the uniqueness and credibility of the information. When the desensitized intermodal information document changes, the system updates the document and records the consensus time point through the dynamic fault-tolerant consensus mechanism to ensure the accuracy, real-time and network-wide consistency of the data under multi-node collaboration, and ensure the stability of the system even in the presence of malicious nodes.

[0073] In a possible implementation, S3 specifically includes:

[0074] S301: Initialize the node parameters of each participant as a node, where the node parameters include the malicious node ignore set, the current consensus round, the maximum fault tolerance rate, the total number of nodes and the maximum tolerated number of malicious nodes:

[0075] {I,r,ε,n,t}

[0076] ε>0

[0077]

[0078] Among them, I, r, ε, n, t represent the malicious node ignore set, the current consensus round, the maximum fault tolerance rate, the total number of nodes and the maximum tolerated number of malicious nodes, respectively. Indicates rounding down.

[0079] Among them, the total number of nodes refers to the sum of the number of nodes in all main chains and side chains in the entire system. These nodes can be representatives of different participants, such as transport parties, logistics parties or regulators in multimodal transport systems. The total number of nodes directly affects the fault tolerance and consensus efficiency of the system, because the system needs to dynamically adjust the fault tolerance threshold and the number of message transmissions according to the total number of nodes. Each participant may join the system through a side chain, and nodes are also needed on the main chain to coordinate the operation of these side chains. The total number of nodes directly affects the efficiency of consensus in the main chain and side chains. The system needs to dynamically adjust the fault tolerance threshold (such as the limit on the number of malicious nodes) and consensus algorithm parameters according to the total number of nodes to ensure consistency even when multiple side chains collaborate. The main chain and side chains work together through a bridging mechanism, and the total number of nodes is composed of the nodes of the main chain and all side chains. Malicious nodes may exist in the main chain or side chain, affecting data synchronization and consistency. The dynamic fault tolerance mechanism works separately at the main chain and side chain levels to ensure the security and stability of the system under the participation of multiple parties.

[0080] S302: Determine the lower limit of the number of cooperative messages to ensure the correctness of the fault-tolerant consensus mechanism based on the maximum fault tolerance rate, the current consensus round, and the total number of nodes:

[0081]

[0082] Among them, min means taking the minimum value, log means logarithmic function, f(ε) means function about ε, and g means the lower limit of the number of cooperative messages.

[0083] Among them, the formula By comprehensively considering the proportion of malicious nodes in the system, the total number of nodes, and the maximum fault tolerance rate, the lower limit of the number of cooperative messages is dynamically adjusted. Represents the adjustment factor related to the impact of malicious nodes, ensuring that the impact of malicious behavior between nodes on the system is minimized. The uncertainty caused by the fault tolerance rate is compensated, balancing the system security and efficiency. Through this design, the system can minimize the communication cost while ensuring the correctness of the consensus, and improve the robustness and adaptability of consensus in a multi-node distributed environment. It balances the fault tolerance requirements and communication overhead, ensuring the accuracy of consensus under high fault tolerance while avoiding unnecessary waste of communication resources. This dynamic adjustment mechanism adapts to changes in system scale and malicious node ratio, improves the elasticity and efficiency of distributed systems, and is particularly suitable for efficient consensus management in complex multi-party collaborative environments.

[0084] Specifically, the number of cooperative messages is a dynamically adjusted communication overhead indicator in a distributed system, which reflects how many messages need to be exchanged between nodes to ensure the correctness and efficiency of consensus. In the formula, f(ε) reflects the strictness of the fault tolerance requirement, while Reflects the resource constraints of the current round.

[0085] It should be noted that this consensus mechanism dynamically adjusts the number of cooperative messages to ensure that when the fault tolerance rate is low, an appropriate amount of communication is used to reduce the error probability while limiting the complexity of communication. It can not only ensure the correctness of consensus in the presence of malicious nodes, but also optimize resource usage through round adjustment and the lower limit of the number of messages, thereby improving system scalability and efficiency.

[0086] S303: Randomly select a command node from each node, and broadcast the changed broadcast intermodal transport information document to the remaining nodes through the command node.

[0087] S304: Compare the current intermodal information document of each node with the changed broadcast intermodal information document in the remaining nodes to see if they are consistent. If they are consistent, the number of cooperation messages is increased by 1. Otherwise, a report message about the desensitized signature is generated at the inconsistent node:

[0088] report=(G i ,G L ,Σ sig )

[0089] Among them, G i represents the reporting node, G L It indicates the command node, and report indicates the report message.

[0090] S305: If there is a report message, update the malicious node ignore set and return to step S303 until the current consensus round reaches the preset consensus round. Otherwise, return to step S303 until the current consensus round reaches the preset consensus round:

[0091] I, =I∪{G L}

[0092] Among them, I,represents the updated ignored set of malicious nodes.

[0093] It should be noted that those skilled in the art can set the size of the preset consensus round according to actual needs, and the present invention is not limited here.

[0094] S306: When the updated malicious node ignores the set and the current number of cooperation messages meets the constraint conditions, the intermodal information document is updated through the fault-tolerant consensus mechanism, and the consensus formation time is recorded. The specific constraint conditions are:

[0095]

[0096] Among them, |I`| represents the number of malicious nodes in the updated malicious node ignore set, and g` represents the current number of cooperation messages.

[0097] Specifically, first, through the node parameter initialization, key parameters such as the malicious node ignore set and the maximum fault tolerance rate are defined to establish the foundation for the fault-tolerant consensus mechanism. Then, based on the maximum fault tolerance rate and the current consensus round, the lower limit of the number of cooperative messages is dynamically calculated to ensure the balance between the correctness of the consensus and the communication efficiency. Then, the command node is randomly selected from the nodes, the information document changes are broadcast to other nodes, and the information consistency is compared between the nodes. If inconsistencies are found, a report message is generated and the malicious node set is updated. Through multiple rounds of consensus verification and adjustment, it is ensured that consensus is reached after the malicious nodes are filtered out, and the moment of consensus formation is recorded, and finally an efficient and fault-tolerant intermodal information document update process is realized. This mechanism not only ensures system security but also improves scalability and communication efficiency by dynamically adjusting the number of messages and filtering malicious nodes.

[0098] It should be noted that the dynamic fault-tolerant consensus mechanism described in this process can effectively identify and ignore malicious nodes in a distributed system with multiple nodes, and ensure the correctness and efficiency of the system consensus by dynamically adjusting the lower limit of the number of cooperative messages. Even in the presence of malicious nodes or network fluctuations, the system's fault tolerance can be improved by reporting and updating the malicious node set, reducing interference caused by erroneous nodes. At the same time, the random selection of command nodes reduces the risk of single point failures, and the multi-round mechanism enhances the stability and consistency of the system, providing an efficient and reliable data update mechanism for multi-chain collaboration scenarios.

[0099] S4: Collect the network delay between each side chain and the main chain.

[0100] Among them, network delay refers to the time required for data to be transmitted from the sender to the receiver, which is mainly composed of network transmission time, node processing time and other network jitter factors. In the blockchain system, network delay may cause problems such as data synchronization delay and reduced consensus efficiency. By obtaining network delay, evaluating and compensating for it, the problem of a sharp increase in network delay rate caused by the addition of side chains can be avoided, the delay problem can be alleviated, and the on-chain information can be updated in time after the participants confirm the information, reducing the delay period.

[0101] S5: Based on network delay, predictive delay compensation is performed on the moment of consensus formation.

[0102] It should be noted that the dynamic prediction mechanism of network delay can be used to compensate for the time of consensus formation and solve the time deviation problem caused by delay differences between nodes in the distributed system. Through the delay prediction algorithm, the time perception of the nodes for the same event can be adjusted to ensure the time synchronization of the entire network, avoid transaction sorting confusion, transaction timeout or consensus failure caused by time asynchrony, thereby improving the stability of the system and the accuracy of the consensus mechanism, and ensuring the efficient operation of multi-chain collaboration.

[0103] In a possible implementation, S5 specifically includes:

[0104] S501: Establish a historical network delay sequence between each side chain and the main chain.

[0105] S502: Training the long short-term memory network model through the historical network delay sequence.

[0106] S503: Predicting the historical network delay sequence through the trained long short-term memory network model to determine the prediction errors of multiple historical network delays.

[0107] S504: Based on the prediction error, correct the control parameters of the PID controller.

[0108] S505: Predicting network delay through trained LSTM network model and PID controller output:

[0109]

[0110] in, represents the predicted network delay at time t+1, LSTM represents the trained long short-term memory network model, and F i,j represents the historical network delay sequence between side chain i and main chain j, K p , K i and K d They represent the proportional coefficient, integral coefficient and differential coefficient respectively, and e(t) represents the actual network delay at time t. and the predicted network delay at time t The prediction error at time t between .

[0111] S506: Calculate the average compensation value of each side chain in the multimodal transport information management platform according to the predicted network delay:

[0112]

[0113] Where N represents the total number of side chains, ΔT comp Indicates the average compensation value.

[0114] S507: Adjust the synchronization timestamp of each side chain according to the average compensation value:

[0115] T sync,i =T local,i -ΔT comp

[0116] Among them, T local,i and T sync,i Respectively represent the local time and synchronization timestamp of the i-th side chain.

[0117] S508: Update the consensus formation time according to the obtained synchronization timestamp, and complete the delay compensation of the consensus formation time:

[0118]

[0119] Among them, T consensus Indicates the moment when consensus is reached.

[0120] Specifically, by combining the long short-term memory network (LSTM) and the PID controller, the network delay between the side chain and the main chain in the blockchain is dynamically predicted and adjusted to achieve delay compensation. First, the historical network delay sequence is established as the basic data, the LSTM model is used to train and predict the delay trend, and the prediction error of the model is corrected by the PID controller. Subsequently, the average compensation value of each side chain is calculated based on the predicted delay value, the synchronization timestamp of each side chain is dynamically adjusted, and finally the consensus formation moment is updated to achieve time synchronization. It can effectively solve the time deviation problem caused by the difference in network delay between nodes, ensure the time synchronization of the entire network, improve the accuracy and efficiency of the consensus mechanism, avoid transaction conflicts, sorting confusion or consensus failure caused by delays, and optimize the utilization of system resources.

[0121] S6: Determine whether the updated intermodal transport information document has arrived at the target site through the preset smart contract. If so, proceed to step S7; otherwise, return to step S3.

[0122] The target site and target user are recorded in the preset smart contract. The target site is the buyer's address. The target user is the buyer. The preset smart contract is a program pre-defined on the blockchain that contains the conditions and logic for performing specific operations. Through the smart contract, information can be automatically verified and related operations can be triggered without human intervention.

[0123] It is understandable that only the participating parties can obtain the encryption parameters of the desensitization process and the encryption process through the preset smart contract.

[0124] S7: Send the updated intermodal transport information document to the target user with the preset smart contract tag.

[0125] In a possible implementation manner, after S7, the method further includes:

[0126] Send reminders about the completion of intermodal transport to target users.

[0127] Specifically, first, the intermodal information documents of different modes of transport are obtained through various side chains to ensure complete recording and traceability of the information. After that, the information is desensitized by combining ring signatures and zero-knowledge proofs to protect privacy and verify authenticity. When the document changes, the information is updated and the moment of consensus formation is recorded through a dynamic fault-tolerant consensus mechanism to ensure data consistency and reliability. Then, based on the network delay data between the main chain and the side chain, time synchronization compensation is performed based on the delay prediction algorithm to avoid consensus deviation caused by delays. And through the preset smart contract, it is automatically determined whether the information has arrived at the target site. If it has arrived, the document will be sent to the target user. The overall process realizes the secure transmission, privacy protection, accurate update and efficient delivery of data, and improves the collaborative efficiency and transparency of multimodal transport.

[0128] In actual application, the blockchain-based multimodal transport information management method processes multimodal transport information in steps through the collaboration of the main chain and side chain architecture. Each side chain obtains and records the multimodal transport documents of the participants, and desensitizes the documents in combination with ring signatures and zero-knowledge proofs to ensure privacy protection and data authenticity. The dynamic fault-tolerant consensus mechanism updates the documents and records the consensus time when the information changes, while collecting network delays and ensuring system synchronization and accuracy through predictive delay compensation. The preset smart contract automatically determines whether the information has reached the target site and completes data verification and transmission operations. Its advantages are that it improves the security, transparency and automation level of information management, avoids data leakage, delays or consistency problems, and ensures the efficient operation of multimodal transport.

[0129] The beneficial effects brought about by the technical solution provided by the embodiment of the present invention include at least:

[0130] In the present invention, the blockchain platform in the form of main and side chains is combined to circulate the intermodal information in parallel, and the intermodal information is managed in a decentralized manner to avoid the risk of information tampering. In the process of circulation, the intermodal information is desensitized by coupling the ring signature and zero-knowledge proof, hiding the identity of the sender, protecting data privacy, and ensuring the authenticity and security of the information. In addition, in the process of the circulation of intermodal information, a dynamic fault-tolerant consensus mechanism is used to control the update of information. While ensuring the accuracy of information updates, it can tolerate malicious or faulty behaviors of some nodes in multi-party collaboration, and dynamically adjust the consensus conditions to ensure the accuracy and efficiency of information updates, effectively improve the security of data and the robustness of the system, and avoid conflicts or delays caused by inconsistent information during transportation. In addition, delay compensation is performed on the moment of consensus formation to avoid the problem of consensus verification delays and failures caused by the accumulation of network delays on multiple side chain platforms, thereby improving the efficiency, authenticity and security of intermodal information management.

[0131] Reference Manual Attached Figure 3 , showing a structural schematic diagram of a multimodal transport information management system based on blockchain provided by the present invention.

[0132] The present invention also provides a blockchain-based multimodal transport information management system 20, which is applied to the above-mentioned blockchain-based multimodal transport information management method, including:

[0133] Processor 201.

[0134] The memory 202 stores computer-readable instructions. When the computer-readable instructions are executed by the processor 201, a multimodal transport information management method based on blockchain as in the method embodiment is implemented.

[0135] The blockchain-based multimodal transport information management system 20 provided by the present invention can execute the above-mentioned blockchain-based multimodal transport information management method and achieve the same or similar technical effects. To avoid repetition, the present invention will not go into details.

[0136] The beneficial effects brought about by the technical solution provided by the embodiment of the present invention include at least:

[0137] In the present invention, the blockchain platform in the form of main and side chains is combined to circulate the intermodal information in parallel, and the intermodal information is managed in a decentralized manner to avoid the risk of information tampering. In the process of circulation, the intermodal information is desensitized by coupling the ring signature and zero-knowledge proof, hiding the identity of the sender, protecting data privacy, and ensuring the authenticity and security of the information. In addition, in the process of the circulation of intermodal information, a dynamic fault-tolerant consensus mechanism is used to control the update of information. While ensuring the accuracy of information updates, it can tolerate malicious or faulty behaviors of some nodes in multi-party collaboration, and dynamically adjust the consensus conditions to ensure the accuracy and efficiency of information updates, effectively improve the security of data and the robustness of the system, and avoid conflicts or delays caused by inconsistent information during transportation. In addition, delay compensation is performed on the moment of consensus formation to avoid the problem of consensus verification delays and failures caused by the accumulation of network delays on multiple side chain platforms, thereby improving the efficiency, authenticity and security of intermodal information management.

[0138] It should be understood that the processor in the embodiment of the present invention may be a central processing unit (CPU), and the processor may also be other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0139] It should also be understood that the memory in the embodiments of the present invention may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of random access memory (RAM) are available, such as static RAM (SRAM), dynamic random access memory (DRAM), synchronous DRAM (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link DRAM (SLDRAM), and direct RAM bus random access memory (DR RAM).

[0140] The above embodiments can be implemented in whole or in part by software, hardware (such as circuits), firmware or any other combination. When implemented by software, the above embodiments can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, the process or function described in the embodiment of the present invention is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from one website, computer, server or data center to another website, computer, server or data center by wired (such as infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or data center that contains one or more available media sets. The available medium can be a magnetic medium (for example, a floppy disk, a hard disk, a tape), an optical medium (for example, a DVD), or a semiconductor medium. The semiconductor medium can be a solid-state hard disk.

[0141] It should be understood that the term "and / or" in this article is only a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. A and B can be singular or plural. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship, but it may also indicate an "and / or" relationship. Please refer to the context for specific understanding.

[0142] In the present invention, "at least one" means one or more, and "more than one" means two or more. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can be represented by: a, b, c, ab, ac, bc, or abc, where a, b, c can be single or multiple.

[0143] It should be understood that in various embodiments of the present invention, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.

[0144] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0145] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described equipment, devices and units can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0146] In the several embodiments provided by the present invention, it should be understood that the disclosed devices, apparatuses and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another device, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0147] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0148] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0149] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, etc., various media that can store program codes.

[0150] An embodiment of the present invention provides a computer-readable storage medium having a computer program stored thereon. When the program is executed by a processor, the multimodal transport information management method based on blockchain as described in the method embodiment is implemented.

[0151] A computer-readable storage medium provided by the present invention can implement the steps and effects of the multimodal transport information management method based on blockchain in the above method embodiment. To avoid repetition, the present invention will not go into details.

[0152] The beneficial effects brought about by the technical solution provided by the embodiment of the present invention include at least:

[0153] In the present invention, the blockchain platform in the form of main and side chains is combined to circulate the intermodal information in parallel, and the intermodal information is managed in a decentralized manner to avoid the risk of information tampering. In the process of circulation, the intermodal information is desensitized by coupling the ring signature and zero-knowledge proof, hiding the identity of the sender, protecting data privacy, and ensuring the authenticity and security of the information. In addition, in the process of the circulation of intermodal information, a dynamic fault-tolerant consensus mechanism is used to control the update of information. While ensuring the accuracy of information updates, it can tolerate malicious or faulty behaviors of some nodes in multi-party collaboration, and dynamically adjust the consensus conditions to ensure the accuracy and efficiency of information updates, effectively improve the security of data and the robustness of the system, and avoid conflicts or delays caused by inconsistent information during transportation. In addition, delay compensation is performed on the moment of consensus formation to avoid the problem of consensus verification delays and failures caused by the accumulation of network delays on multiple side chain platforms, thereby improving the efficiency, authenticity and security of intermodal information management.

[0154] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

[0155] There are a few points to note:

[0156] (1) The drawings of the embodiments of the present invention only relate to the structures related to the embodiments of the present invention, and other structures may refer to the general design.

[0157] (2) For the sake of clarity, in the drawings used to describe the embodiments of the present invention, the thickness of the layers or regions is exaggerated or reduced, that is, these drawings are not drawn according to the actual scale. It is understood that when an element such as a layer, film, region or substrate is referred to as being "on" or "under" another element, the element may be "directly" "on" or "under" the other element or there may be intermediate elements.

[0158] (3) In the absence of conflict, the embodiments of the present invention and the features therein may be combined with each other to obtain new embodiments.

[0159] The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited thereto. The protection scope of the present invention shall be based on the protection scope of the claims.

Claims

1. A multimodal transport information management method based on blockchain, characterized in that: Applied to a multimodal transport information management platform, wherein the multimodal transport information management platform includes a plurality of side chains that are bridged to a main chain, the side chains are bridged to each other, and each side chain corresponds to a participant; the method includes: S1: Obtain the intermodal transport information document of the corresponding participant through each side chain, wherein the intermodal transport information document is located at the current participant of the intermodal transport information record; S2: Combine the ring signature and zero-knowledge proof to desensitize the intermodal information document in a coupled manner; S3: When the desensitized intermodal information document changes, the intermodal information document is updated through a dynamic fault-tolerant consensus mechanism, and the time when the consensus is formed is recorded; S4: collecting the network delay between each side chain and the main chain; S5: Based on the network delay, predictive delay compensation is performed on the consensus formation moment; S6: Determine whether the updated intermodal information document has arrived at the target site through the preset smart contract. If so, proceed to step S7; otherwise, return to step S3; S7: Send the updated intermodal transport information document to the target user with the preset smart contract tag.

2. The multimodal transport information management method based on blockchain according to claim 1 is characterized in that: Each bridging method is specifically a bridging mechanism based on a hash time lock contract, and the hash time lock contract is used to verify whether the transaction conditions between each chain are met.

3. The multimodal transport information management method based on blockchain according to claim 2 is characterized in that: The verification process of the hash time lock contract is as follows: Receiving a transaction instruction between a sender and a receiver, wherein both the sender and the receiver are main chains or side chains; In response to the transaction instruction, the sender generates a hash value of a random number R, and discloses the random number to the receiver: H(R)=Hash(R) R=Hash(T lock ||S0) T lock =T current +ΔT lock Where Hash represents an irreversible hash algorithm, H(R) represents the hash value of the random number R, || represents concatenation, and T current Indicates the current timestamp, T lock Indicates the time lock value, ΔT lock Indicates the time length defined by the time lock, S0 indicates the random seed; Saving the sender's random number and time lock; Within the agreed time range of the time lock, if a random number of the recipient is received, the uniqueness of the recipient is determined by the number of the random numbers; Generate a hash value of the received random number while ensuring uniqueness; When the hash values ​​of the sender and the receiver are consistent, it is determined that the transaction instruction has passed the verification.

4. The multimodal transport information management method based on blockchain according to claim 1 is characterized in that: The participating parties include railway transport parties, road transport parties, sea transport parties and air transport parties.

5. The multimodal transport information management method based on blockchain according to claim 3 is characterized in that: The desensitization formula is specifically: S sig =(s,p) σ=(L,c1,s1,s2,...,s N ) L={pk1,pk2,…,pk N } c1=Hash(m||pk1||R c ) π=Prove(m,C(m)) Where σ represents the ring signature used to hide the identity of the sender, π represents the zero-knowledge proof of the intermodal information document m, Σ sig represents the desensitized signature about σ and m, pk i represents the public key of the ith participant, i.e., the public identity, i = 1, 2, ..., N, N represents the total number of participants, L represents the public key set, s i represents the pseudo-random number of the ith participant, s i With pk i Based on the one-to-one correspondence of label i, C(m) represents the constraint function used to verify whether the intermodal information document m is correct, c1 represents the initial hash value, R c Represents the random number generated in the c1 generation process, and Prove represents the zero-knowledge proof protocol.

6. The multimodal transport information management method based on blockchain according to claim 1 is characterized in that: The S3 specifically includes: S301: Initialize node parameters of each participant as a node, wherein the node parameters include the malicious node ignore set, the current consensus round, the maximum fault tolerance rate, the total number of nodes and the maximum tolerated number of malicious nodes: {I,r,ε,n,t} ε>0 Among them, I, r, ε, n, t represent the malicious node ignore set, the current consensus round, the maximum fault tolerance rate, the total number of nodes and the maximum tolerated number of malicious nodes, respectively. Indicates rounding down; S302: Determine the lower limit of the number of cooperation messages to ensure the correctness of the fault-tolerant consensus mechanism based on the maximum fault tolerance rate, the current consensus round and the total number of nodes: Among them, min means taking the minimum value, log means logarithmic function, f(ε) means function about ε, and g means the lower limit of the number of cooperative messages; S303: randomly selecting a command node from each node, and broadcasting the changed broadcast intermodal transport information document to the remaining nodes through the command node; S304: Compare the current intermodal information document of each node with the changed broadcast intermodal information document in the remaining nodes to see if they are consistent. If they are consistent, the number of cooperation messages is increased by 1. Otherwise, a report message about the desensitized signature is generated at the inconsistent node: report=(G i ,G L ,Σ sig ) Among them, G i represents the reporting node, G L It indicates the command node, and report indicates the report message; S305: In the case where the report message exists, the malicious node ignore set is updated, and the process returns to step S303 until the current consensus round reaches the preset consensus round; otherwise, the process returns to step S303 until the current consensus round reaches the preset consensus round: I、=I∪{G L } Among them, I` represents the updated malicious node ignore set; S306: When the updated malicious node ignores the set and the current number of cooperation messages meet the constraint conditions, the intermodal information document is updated through the fault-tolerant consensus mechanism, and the consensus formation time is recorded. The constraint conditions are specifically: Among them, |I`| represents the number of malicious nodes in the updated malicious node ignore set, and g` represents the current number of cooperation messages.

7. The multimodal transport information management method based on blockchain according to claim 1 is characterized in that: The S5 specifically includes: S501: Establish a historical network delay sequence between each side chain and the main chain; S502: Training the long short-term memory network model through the historical network delay sequence; S503: predicting the historical network delay sequence by using the trained long short-term memory network model to determine prediction errors of multiple historical network delays; S504: Based on the prediction error, modify the control parameters of the PID controller; S505: Predicting network delay through trained LSTM network model and PID controller output: in, represents the predicted network delay at time t+1, LSTM represents the trained long short-term memory network model, and F i,j represents the historical network delay sequence between side chain i and main chain j, K p , K i and K d They represent the proportional coefficient, integral coefficient and differential coefficient respectively, and e(t) represents the actual network delay at time t. and the predicted network delay at time t The prediction error at time t between S506: Calculate the average compensation value of each side chain in the multimodal transport information management platform according to the predicted network delay: Where N represents the total number of side chains, ΔT comp represents the average compensation value; S507: Adjust the synchronization timestamp of each side chain according to the average compensation value: T sync,i =T local,i -ΔT comp Among them, T local,i and T sync,i Respectively represent the local time and synchronization timestamp of the i-th side chain; S508: Update the consensus forming time according to the obtained synchronization timestamp, and complete the delay compensation of the consensus forming time: Among them, T consensus Indicates the moment when consensus is reached.

8. The multimodal transport information management method based on blockchain according to claim 1 is characterized in that: After S7, the method further includes: Send a reminder message about the completion of the intermodal transport to the target user.

9. A multimodal transport information management system based on blockchain, characterized in that: include: processor; A memory having computer-readable instructions stored thereon, wherein when the computer-readable instructions are executed by the processor, the multimodal transport information management method based on blockchain as described in any one of claims 1 to 8 is implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the blockchain-based multimodal transport information management method as described in any one of claims 1 to 8 is implemented.

Images