Low-delay covert communication method and system based on block chain transaction tree

Abstract

The invention discloses a low-time-delay covert communication method based on a block chain transaction tree, and relates to the technical field of block chain transactions, and the method comprises the steps: introducing an ancestor key ASK to generate a tag tree, generating dynamic chain type left and right sub-trees, combining the left and right sub-trees of the tag tree with a cyclic hash mechanism, and fusing ciphertexts to generate an input address and an output address. And integrating into a label set and uploading to the block chain, restoring the ciphertext by using a label matching technology, and quickly generating a transaction submission mechanism. According to the method, the transaction can be rapidly submitted, the problems of time delay and anonymity existing in a traditional method are effectively solved, the safety and efficiency of covert communication are improved, the privacy of the user can be guaranteed, a faster and safer block chain transaction covert communication service can be provided, and remarkable technical progress is brought to the field of encryption communication.

Description

Technical Field

[0001] The present invention relates to the field of blockchain transaction technology, and in particular to a low-latency covert communication method and system based on a blockchain transaction tree. Background Art

[0002] Traditional covert communication methods have some limitations, especially in terms of anonymity and latency of transactions. The proposed low-latency covert communication method based on blockchain transaction tree aims to make full use of the blockchain structure of blockchain transactions, introduce the ancestor key ASK to generate label trees and circular hashing mechanism, and generate input and output addresses with dynamic chained left and right subtrees to achieve covert transmission of ciphertext, while integrating label sets and uploading them to the blockchain for fast transaction submission.

[0003] At present, there are some technical defects in traditional covert communication methods, especially blockchain-based covert communication. Existing technologies may have challenges in anonymity and latency, and cannot provide sufficient security and efficiency. Some methods may fail to effectively utilize the structure of blockchain transactions, resulting in large information transmission delays and insufficient anonymity. The low-latency covert communication method based on the blockchain transaction tree can better solve the latency and anonymity problems existing in traditional methods by innovatively integrating technologies such as ancestor key ASK, label tree and circular hash mechanism, and improve the security and efficiency of covert communication. Summary of the invention

[0004] In view of the problems existing in the existing low-latency covert communication method and system based on blockchain transaction tree, the present invention is proposed.

[0005] Therefore, the purpose of the present invention is to provide a low-latency covert communication method and system based on the blockchain transaction tree. In view of the delay and anonymity insecurity problems of blockchain covert communication in the prior art, the present invention adopts technical means such as ancestor key ASK, label tree and circular hashing to improve the security and efficiency of communication.

[0006] In order to solve the above technical problems, the present invention provides the following technical solutions:

[0007] In the first aspect, an embodiment of the present invention provides a low-latency covert communication method based on a blockchain transaction tree, which includes introducing an ancestor key ASK to generate a label tree, combining a circular hash mechanism to generate a dynamic chain of left and right subtrees; combining the left and right subtrees of the label tree with the circular hash mechanism, fusing ciphertext to generate input addresses and output addresses, integrating them into a label set and uploading them to the blockchain, wherein the ciphertext includes covertly transmitted secret information; the blockchain includes transaction screening based on the integrated label set, restoring the ciphertext using label matching technology, and quickly generating a transaction submission mechanism.

[0008] As a preferred solution of the low-latency covert communication method based on the blockchain transaction tree of the present invention, wherein: the ancestor key ASK includes randomly obtaining an initial seed value based on the sender of the blockchain transaction tree, the cyclic hash mechanism includes iteratively generating a random number sequence using a hash function H within the initial seed value, the generating of the label tree includes intercepting the random number sequence, and the generating of the left and right subtrees of the dynamic chain includes analyzing the left and right subtrees using the interception results. The specific steps are as follows:

[0009] If you choose to intercept a long random number sequence, the subtree structure branches of the label tree will increase, and the depth of the left and right subtrees will increase;

[0010] If a short random number sequence is chosen, the subtree structure branches of the label tree will be reduced, and the depth of the left and right subtrees will be smaller.

[0011] As a preferred solution of the low-latency covert communication method based on the blockchain transaction tree of the present invention, wherein: the combination includes processing according to the selected random number sequence length and the number of iterations, and the processing includes adjusting the number of iterations or the number of branches;

[0012] When choosing to intercept a long random number sequence, adjust the left subtree branch and the right subtree branch by increasing the number of hash iterations or increasing the number of branches;

[0013] When choosing to truncate a short random number sequence, the left subtree branch and the right subtree branch are adjusted by reducing the number of hash iterations or reducing the number of branches;

[0014] The integration includes selecting and combining specific nodes of the label tree, and using a mapping algorithm to merge the constructed label set and the ciphertext. The uploading includes constructing a transaction structure of the label set, and performing hash authentication on the label set with the adjusted transaction structure. The sender constructs hash authentication data according to the selected random number sequence condition. The specific steps are as follows:

[0015] When selecting the condition of intercepting a long random number sequence, adjust the hash algorithm parameters, increase the number of iterations, and verify whether the number of iterations increases;

[0016] If the number of iterations increases, a tag is introduced according to the condition of selecting a long random number sequence to indicate that the authenticator needs to increase the number of hash iterations during the verification process, and the iterative operation is performed by identifying the tag;

[0017] If the number of iterations is not increased, the authentication data does not contain the adjustment information of the hash algorithm parameters, and no marker is introduced in the authentication data, indicating that the authenticator does not need to increase the number of hash iterations during the verification process. The authenticator performs hash authentication according to the normal process without additional iterations;

[0018] When the condition of truncating a short random number sequence is selected, the parameters of the hash algorithm are dynamically adjusted according to the selection of truncating a short random number sequence to reduce the number of iterations;

[0019] If the number of branches is reduced, a branch number check is introduced.

[0020] As a preferred solution of the low-latency covert communication method based on the blockchain transaction tree of the present invention, the verification includes the receiving party using the received authentication data for verification, and the branch number verification is introduced during the verification process. The specific steps of the branch number verification are as follows:

[0021] Extract the branch number information after the label tree structure is adjusted, and calculate the check value based on the branch number information after the label tree structure is adjusted;

[0022] The receiver compares the calculated check value with the branch number check value in the authentication data. The specific comparison steps are as follows:

[0023] If the calculated check value is consistent with the check value in the authentication data, the branch number information has not been tampered with and the verification is successful;

[0024] If the calculated check value is inconsistent with the check value in the authentication data, the branch number information has been tampered with and the verification fails;

[0025] The verification includes processing the recipient according to the result of the verification;

[0026] If the verification is successful, the hash authentication step is continued to ensure the correctness and validity of the authentication after the label tree structure is adjusted;

[0027] If the verification fails, the authentication process is terminated and the authentication failure is marked to prevent the tampered information from being uploaded to the blockchain.

[0028] As a preferred solution of the low-latency covert communication method based on the blockchain transaction tree of the present invention, the screening includes screening the information uploaded to the blockchain according to the dynamic adjustment of the label tree structure, matching the transaction according to the label matching rule, and determining the matching result;

[0029] If the tag information in the transaction successfully matches the tag in the tag set, the transaction contains the secret information that is transmitted covertly;

[0030] If the match fails, it is considered that there is a potential risk. Based on the monitoring of potential attack anomalies, additional security mechanisms are triggered, the degree of transaction review is increased, and communication and collaborative prevention channels are established.

[0031] As a preferred solution of the low-latency covert communication method based on the blockchain transaction tree of the present invention, wherein: the restoration of the ciphertext includes performing a decryption operation on the successfully matched transaction, performing a secondary verification on the decrypted transaction, extracting the original information for verification from the decrypted plaintext information, performing a secondary hashing process on the extracted original information, the secondary hashing process includes appending metadata to the result of the hashing process, the metadata includes digitally signing the information after the authentication mark is appended to generate a public key, and the digital signature includes a digital signature private key obtained during the decryption process;

[0032] Verify the public key and digital signature. If the verification is successful, it means that the digital signature is generated by the entity with the corresponding private key, that is, the information has not been tampered with;

[0033] If the verification fails, it may be because the information has been tampered with or the digital signature does not match. In this case, the subsequent processing should be terminated and the verification failure information should be recorded;

[0034] The information that has been successfully verified twice is uploaded to the blockchain again, and a new block is created to add transaction records to the existing blockchain.

[0035] As a preferred solution of the low-latency covert communication method based on the blockchain transaction tree of the present invention, wherein: the rapid generation of transaction submission mechanism includes classification based on transaction records, and the classification includes verification success, verification failure and special case processing;

[0036] The information that has been successfully verified twice is uploaded to the blockchain again for credibility testing to confirm whether the information is complete and credible, and the missing information is extracted and marked as verification failure, and the relevant failure information is recorded;

[0037] If an error occurs during the recording process, an alarm is generated through the blockchain to inform the operator to extract the log records.

[0038] In the second aspect, an embodiment of the present invention provides a low-latency covert communication system based on a blockchain transaction tree, comprising: a combining module, which generates a label tree by introducing an ancestor key ASK, and combines the circular hashing mechanism to generate a dynamically linked left and right subtree; an integration module, which combines the left and right subtrees of the label tree with the circular hashing mechanism, fuses the ciphertext to generate an input address and an output address, integrates them into a label set and uploads them to the blockchain, wherein the ciphertext includes secret information for covert transmission; a screening module, which performs transaction screening based on the integrated label set, restores the ciphertext using label matching technology, and quickly generates a transaction submission mechanism.

[0039] In a third aspect, an embodiment of the present invention provides a computer device, comprising a memory and a processor, wherein the memory stores a computer program, wherein: when the processor executes the computer program, it implements any step of the above-mentioned low-latency covert communication method based on the blockchain transaction tree.

[0040] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium on which a computer program is stored, wherein: when the computer program is executed by a processor, any step of the above-mentioned low-latency covert communication method based on the blockchain transaction tree is implemented.

[0041] The beneficial effects of the present invention are as follows: by introducing technical means such as ancestor key ASK, label tree and circular hash, a dynamic chain of left and right subtrees is innovatively constructed, input and output addresses are integrated and generated, and the covert transmission of ciphertext is realized. By using label matching technology and blockchain transaction screening mechanism, the present invention can quickly submit transactions, effectively solve the time delay and anonymity problems existing in traditional methods, and improve the security and efficiency of covert communication. The present invention can provide faster and safer blockchain transaction covert communication services while protecting user privacy, bringing significant technological progress to the field of encrypted communications. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for describing 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. Among them:

[0043] Figure 1 A specific flow chart of a low-latency covert communication method and system based on a blockchain transaction tree provided for one embodiment of the present invention.

[0044] Figure 2 A schematic diagram of low-latency covert communication of a low-latency covert communication method and system based on a blockchain transaction tree provided for one embodiment of the present invention.

[0045] Figure 3 A label tree generation result diagram of a low-latency covert communication method and system based on a blockchain transaction tree provided by an embodiment of the present invention.

[0046] Figure 4 A statistical distribution graph of the number of input addresses for a single transaction in a low-latency covert communication method and system based on a blockchain transaction tree provided by an embodiment of the present invention.

[0047] Figure 5A statistical distribution diagram of the number of output addresses of a single transaction in a low-latency covert communication method and system based on a blockchain transaction tree provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0048] In order to make the above-mentioned purposes, features and advantages of the present invention more obvious and easy to understand, the specific implementation methods of the present invention are described in detail below in conjunction with the drawings of the specification. Obviously, the described embodiments are part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary persons in the art without creative work should fall within the scope of protection of the present invention.

[0049] In the following description, many specific details are set forth to facilitate a full understanding of the present invention, but the present invention may also be implemented in other ways different from those described herein, and those skilled in the art may make similar generalizations without violating the connotation of the present invention. Therefore, the present invention is not limited to the specific embodiments disclosed below.

[0050] Secondly, the term "one embodiment" or "embodiment" as used herein refers to a specific feature, structure, or characteristic that may be included in at least one implementation of the present invention. The term "in one embodiment" that appears in different places in this specification does not necessarily refer to the same embodiment, nor does it refer to a separate or selective embodiment that is mutually exclusive with other embodiments.

[0051] The present invention is described in detail with reference to schematic diagrams. When describing the embodiments of the present invention, for the sake of convenience, the cross-sectional diagrams showing the device structure will not be partially enlarged according to the general scale, and the schematic diagrams are only examples, which should not limit the scope of protection of the present invention. In addition, in actual production, the three-dimensional dimensions of length, width and depth should be included.

[0052] At the same time, in the description of the present invention, it should be noted that the directions or positional relationships indicated by the terms "upper, lower, inner and outer" are based on the directions or positional relationships shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific direction, be constructed and operated in a specific direction, and therefore cannot be understood as limiting the present invention. In addition, the terms "first, second or third" are only used for descriptive purposes and cannot be understood as indicating or implying relative importance.

[0053] In the present invention, unless otherwise clearly specified and limited, the terms "install, connect, connect" should be understood in a broad sense, for example: it can be a fixed connection, a detachable connection or an integral connection; it can also be a mechanical connection, an electrical connection or a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0054] Example 1

[0055] Reference Figure 1 to Figure 5 , which is the first embodiment of the present invention, and provides a low-latency covert communication method based on a blockchain transaction tree, comprising:

[0056] S1: Introduce the ancestor key ASK to generate a label tree, and combine it with the circular hash mechanism to generate dynamic chain left and right subtrees.

[0057] Among them, the ancestor key ASK includes randomly obtaining an initial seed value within the sender based on the blockchain transaction tree, the cyclic hash mechanism includes iteratively generating a random number sequence using a hash function H within the initial seed value, generating a label tree includes intercepting the random number sequence, and generating a dynamic chain of left and right subtrees includes analyzing the left and right subtrees using the interception results. The specific steps are as follows:

[0058] If you choose to intercept a long random number sequence, the subtree structure branches of the label tree will increase, and the depth of the left and right subtrees will increase;

[0059] If a short random number sequence is chosen, the subtree structure branches of the label tree will be reduced, and the depth of the left and right subtrees will be smaller.

[0060] S2: Combine the left and right subtrees of the label tree with the circular hashing mechanism, fuse the ciphertext to generate the input address and output address, integrate them into a label set and upload them to the blockchain. The ciphertext includes the secret information for hidden transmission.

[0061] The combination includes processing according to the selected random number sequence length and the number of iterations, and the processing includes adjusting the number of iterations or the number of branches;

[0062] When choosing to intercept a long random number sequence, adjust the left subtree branch and the right subtree branch by increasing the number of hash iterations or increasing the number of branches;

[0063] When choosing to truncate a short random number sequence, the left subtree branch and the right subtree branch are adjusted by reducing the number of hash iterations or reducing the number of branches;

[0064] Integration includes selecting and combining specific nodes of the label tree, using a mapping algorithm to merge the constructed label set and ciphertext, uploading a transaction structure including the constructed label set, and performing hash authentication on the label set after the transaction structure is adjusted. The sender constructs hash authentication data based on the selected random number sequence conditions. The specific steps are as follows:

[0065] When selecting the condition of intercepting a long random number sequence, adjust the hash algorithm parameters, increase the number of iterations, and verify whether the number of iterations increases;

[0066] If the number of iterations increases, a tag is introduced according to the condition of selecting a long random number sequence to indicate that the authenticator needs to increase the number of hash iterations during the verification process, and the iterative operation is performed by identifying the tag;

[0067] If the number of iterations is not increased, the authentication data does not contain the adjustment information of the hash algorithm parameters, and no marker is introduced in the authentication data, indicating that the authenticator does not need to increase the number of hash iterations during the verification process. The authenticator performs hash authentication according to the normal process without additional iterations;

[0068] When the condition of truncating a short random number sequence is selected, the parameters of the hash algorithm are dynamically adjusted according to the selection of truncating a short random number sequence to reduce the number of iterations;

[0069] If the number of branches is reduced, a branch number check is introduced.

[0070] Furthermore, the verification includes the receiving party using the received authentication data for verification, and the branch number verification is introduced in the verification process. The specific steps of the branch number verification are as follows:

[0071] Extract the branch number information after the label tree structure is adjusted, and calculate the check value based on the branch number information after the label tree structure is adjusted;

[0072] The receiver compares the calculated check value with the branch number check value in the authentication data. The specific comparison steps are as follows:

[0073] If the calculated check value is consistent with the check value in the authentication data, the branch number information has not been tampered with and the verification is successful;

[0074] If the calculated check value is inconsistent with the check value in the authentication data, the branch number information has been tampered with and the verification fails;

[0075] Verification includes processing the recipient based on the results of the verification;

[0076] If the verification is successful, the hash authentication step is continued to ensure the correctness and validity of the authentication after the label tree structure is adjusted;

[0077] If the verification fails, the authentication process is terminated and the authentication failure is marked to prevent the tampered information from being uploaded to the blockchain.

[0078] Two different interception lengths of 256 bits and 512 bits are used, and the number of hash iterations is increased and decreased accordingly. The diversified settings better adapt to different security and performance requirements. The appropriate interception length and number of iterations are selected so that the system can maintain strong security in a specific security threat environment while maintaining reasonable computing efficiency. The specific interception length and number of iterations are shown in Table 1 below:

[0079] Table 1 Data table of interception length and number of iterations

[0080]

[0081] The present invention adopts different truncation lengths and corresponding hash iteration number adjustment strategies according to different conditions of random number sequences. For long sequence conditions, truncation lengths of 256 bits, 512 bits and 1024 bits are considered, and the hash iteration number is adjusted to 120 times, 150 times and 200 times respectively.

[0082] For short sequence conditions, we select 128-bit, 256-bit, and 512-bit truncation lengths, and correspondingly reduce the number of hash iterations to 50, 80, and 100. This design allows the system to be flexibly adjusted under different security and performance requirements to achieve a better balance.

[0083] S3: The blockchain includes transaction screening based on the integrated tag set, restoring the ciphertext using tag matching technology, and quickly generating a transaction submission mechanism.

[0084] Among them, screening includes screening the information uploaded to the blockchain according to the dynamic adjustment of the tag tree structure, matching the transaction according to the tag matching rules, and determining the matching results;

[0085] If the tag information in the transaction successfully matches the tag in the tag set, the transaction contains the secret information that is transmitted covertly;

[0086] If the match fails, it is considered that there is a potential risk. Based on the monitoring of potential attack anomalies, additional security mechanisms are triggered, the degree of transaction review is increased, and communication and collaborative prevention channels are established.

[0087] S3.1: Restoring the ciphertext includes performing a decryption operation on the successfully matched transactions, performing a secondary verification on the decrypted transactions, extracting the original information for verification from the decrypted plaintext information, performing a secondary hashing process on the extracted original information, the secondary hashing process includes appending metadata to the result of the hashing process, the metadata includes generating a public key by digitally signing the information after the authentication mark is appended, and the digital signature includes a digital signature private key obtained during the decryption process;

[0088] Verify the public key and digital signature. If the verification is successful, it means that the digital signature is generated by the entity with the corresponding private key, that is, the information has not been tampered with;

[0089] If the verification fails, it may be because the information has been tampered with or the digital signature does not match. In this case, the subsequent processing should be terminated and the verification failure information should be recorded;

[0090] The information that has been successfully verified twice is uploaded to the blockchain again, and a new block is created to add transaction records to the existing blockchain.

[0091] Furthermore, the fast generation of transaction submission mechanism includes classification based on transaction records, the classification including verification success, verification failure and special case handling;

[0092] The information that has been successfully verified twice is uploaded to the blockchain again for credibility testing to confirm whether the information is complete and credible, and the missing information is extracted and marked as verification failure, and the relevant failure information is recorded;

[0093] If an error occurs during the recording process, an alarm is generated through the blockchain to inform the operator to extract the log records.

[0094] In a preferred embodiment, a low-latency covert communication system based on a blockchain transaction tree includes a combining module, which generates a label tree by introducing an ancestor key ASK, and combines the circular hashing mechanism to generate a dynamically linked left and right subtree; an integration module, which combines the left and right subtrees of the label tree with the circular hashing mechanism to fuse the ciphertext to generate an input address and an output address, which are integrated into a label set and uploaded to the blockchain, and the ciphertext includes secret information for covert transmission; a screening module, which performs transaction screening based on the integrated label set, restores the ciphertext using label matching technology, and quickly generates a transaction submission mechanism.

[0095] The above-mentioned unit modules may be embedded in or independent of a processor in a computer device in the form of hardware, or may be stored in a memory in a computer device in the form of software, so that the processor can call and execute operations corresponding to the above-mentioned modules.

[0096] The computer device may be a terminal, and the computer device includes a processor, a memory, a communication interface, a display screen and an input device connected via a system bus. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be achieved through WIFI, an operator network, NFC (near field communication) or other technologies. The display screen of the computer device may be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device may be a touch layer covering the display screen, or a key, trackball or touchpad provided on the housing of the computer device, or an external keyboard, touchpad or mouse, etc.

[0097] In summary, the present invention innovatively constructs dynamic chain left and right subtrees by introducing technical means such as ancestor key ASK, label tree and circular hash, integrates and generates input and output addresses, and realizes the covert transmission of ciphertext. By using label matching technology and blockchain transaction screening mechanism, the present invention can quickly submit transactions, effectively solve the delay and anonymity problems existing in traditional methods, and improve the security and efficiency of covert communication. The present invention can provide faster and safer blockchain transaction covert communication services while protecting user privacy, bringing significant technological progress to the field of encrypted communications.

[0098] Example 2

[0099] Reference Figure 1 to Figure 5 , which is the second embodiment of the present invention. This embodiment provides a low-latency covert communication method based on the blockchain transaction tree. In order to verify the beneficial effects of the present invention, scientific demonstration is carried out through simulation experiments.

[0100] A random number sequence length of 256 bits was selected and truncated under long sequence conditions. The number of branches of the left and right subtrees was dynamically adjusted by increasing the number of hash iterations to 120. During the upload to the blockchain, hash authentication data was constructed with the adjusted hash algorithm parameters and iteration number information.

[0101] During the verification phase, the receiver successfully extracted the branch number information after the label tree structure was adjusted, which was 180, and the calculated check value was consistent with the check value in the authentication data, thus passing the verification. During the decryption and verification phase, the successfully decrypted information passed the digital signature verification, and the public key matched the digital signature, ensuring that the information had not been tampered with.

[0102] By adjusting the length of the random number sequence and the number of iterations, the label tree structure can be flexibly adjusted. The specific data of selecting 256-bit length and increasing the number of hash iterations to 120 ensures the security of communication and successfully uploads the verified information to the blockchain. The specific parameter step data table during the experiment is shown in Table 2 below:

[0103] Table 2 Specific parameter step data table during the experiment

[0104] step Parameters / Data Specific values Choose the random number sequence length length 256 bits Iteration adjustment Iterations 120 times Number of hash iterations when uploading to the blockchain Hash iteration count 120 times The number of branches after the extracted label tree structure is adjusted Number of branches 180 Number of digital signature verifications during decryption and verification Verification times 1 time

[0105] In the experiment, a random number sequence length of 256 bits was specifically selected, and the number of hash iterations was adjusted to 120. When uploading to the blockchain, the same number of hash iterations was maintained. The number of branches of the label tree structure successfully extracted by the receiver after adjustment was 180, which is compared with the prior art as shown in Table 3 below:

[0106] Table 3 Comparison with prior art

[0107]

[0108] Compared with the prior art, the technical solution of the present invention has the advantages of low latency, high security, flexibility and anti-attack, etc. By performing credibility detection on the blockchain, the credibility verification of uploaded information is improved, thereby better meeting the needs of covert communication in practical applications.

[0109] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present invention may be modified or replaced by equivalents without departing from the spirit and scope of the technical solutions of the present invention, which should all be included in the scope of the claims of the present invention.

Claims

1. A low-latency covert communication method based on blockchain transaction tree, characterized in that: include, The ancestor key ASK is introduced to generate a label tree, and combined with the circular hash mechanism, a dynamic chain of left and right subtrees is generated; The left and right subtrees of the label tree are combined with the circular hash mechanism, and the ciphertext is merged to generate the input address and the output address, which are integrated into a label set and uploaded to the blockchain. The ciphertext includes the secret information for concealed transmission. The blockchain includes transaction screening based on an integrated tag set, restoring ciphertext using tag matching technology, and quickly generating a transaction submission mechanism.

2. The low-latency covert communication method based on the blockchain transaction tree as claimed in claim 1, characterized in that: The ancestor key ASK includes randomly obtaining an initial seed value within the sender based on the blockchain transaction tree, the cyclic hash mechanism includes iteratively generating a random number sequence using a hash function H within the initial seed value, generating a label tree includes intercepting the random number sequence, and generating left and right subtrees of a dynamic chain includes analyzing the left and right subtrees using the interception results. The specific steps are as follows: If you choose to intercept a long random number sequence, the subtree structure branches of the label tree will increase, and the depth of the left and right subtrees will increase; If a short random number sequence is chosen, the subtree structure branches of the label tree will be reduced, and the depth of the left and right subtrees will be smaller.

3. The low-latency covert communication method based on blockchain transaction tree as claimed in claim 2, characterized in that: The combining includes processing according to the selected random number sequence length and the number of iterations, and the processing includes adjusting the number of iterations or the number of branches; When choosing to intercept a long random number sequence, adjust the left subtree branch and the right subtree branch by increasing the number of hash iterations or increasing the number of branches; When choosing to truncate a short random number sequence, the left subtree branch and the right subtree branch are adjusted by reducing the number of hash iterations or reducing the number of branches; The integration includes selecting and combining specific nodes of the label tree, and using a mapping algorithm to merge the constructed label set and the ciphertext. The uploading includes constructing a transaction structure of the label set, and performing hash authentication on the label set with the adjusted transaction structure. The sender constructs hash authentication data according to the selected random number sequence condition. The specific steps are as follows: When selecting the condition of intercepting a long random number sequence, adjust the hash algorithm parameters, increase the number of iterations, and verify whether the number of iterations increases; If the number of iterations increases, a tag is introduced according to the condition of selecting a long random number sequence to indicate that the authenticator needs to increase the number of hash iterations during the verification process, and the iterative operation is performed by identifying the tag; If the number of iterations is not increased, the authentication data does not contain the adjustment information of the hash algorithm parameters, and no marker is introduced in the authentication data, indicating that the authenticator does not need to increase the number of hash iterations during the verification process. The authenticator performs hash authentication according to the normal process without additional iterations; When the condition of truncating a short random number sequence is selected, the parameters of the hash algorithm are dynamically adjusted according to the selection of truncating a short random number sequence to reduce the number of iterations; If the number of branches is reduced, a branch number check is introduced.

4. The low-latency covert communication method based on blockchain transaction tree as claimed in claim 3, characterized in that: The verification includes the receiving party using the received authentication data for verification, and the branch number verification is introduced during the verification process. The specific steps of the branch number verification are as follows: Extract the branch number information after the label tree structure is adjusted, and calculate the check value based on the branch number information after the label tree structure is adjusted; The receiver compares the calculated check value with the branch number check value in the authentication data. The specific comparison steps are as follows: If the calculated check value is consistent with the check value in the authentication data, the branch number information has not been tampered with and the verification is successful; If the calculated check value is inconsistent with the check value in the authentication data, the branch number information has been tampered with and the verification fails; The verification includes processing the recipient according to the result of the verification; If the verification is successful, the hash authentication step is continued to ensure the correctness and validity of the authentication after the label tree structure is adjusted; If the verification fails, the authentication process is terminated and the authentication failure is marked to prevent the tampered information from being uploaded to the blockchain.

5. The low-latency covert communication method based on blockchain transaction tree as claimed in claim 4, characterized in that: The screening includes screening the information uploaded to the blockchain according to the dynamic adjustment of the tag tree structure, matching the transaction according to the tag matching rules, and determining the matching result; If the tag information in the transaction successfully matches the tag in the tag set, the transaction contains the secret information that is transmitted covertly; If the match fails, it is considered that there is a potential risk. Based on the monitoring of potential attack anomalies, additional security mechanisms are triggered, the degree of transaction review is increased, and communication and collaborative prevention channels are established.

6. The low-latency covert communication method based on blockchain transaction tree as claimed in claim 5, characterized in that: The restoring of the ciphertext includes performing a decryption operation on the successfully matched transaction, performing a secondary verification on the decrypted transaction, extracting original information for verification from the decrypted plaintext information, and performing a secondary hashing process on the extracted original information, wherein the secondary hashing process includes appending metadata to the result of the hashing process, wherein the metadata includes generating a public key by digitally signing the information after the authentication mark is appended, and wherein the digital signature includes a digital signature private key obtained during the decryption process; Verify the public key and digital signature. If the verification is successful, it means that the digital signature is generated by the entity with the corresponding private key, that is, the information has not been tampered with; If the verification fails, it may be because the information has been tampered with or the digital signature does not match. In this case, the subsequent processing should be terminated and the verification failure information should be recorded; The information that has been successfully verified twice is uploaded to the blockchain again, and a new block is created to add transaction records to the existing blockchain.

7. The low-latency covert communication method based on blockchain transaction tree according to claim 6, characterized in that: The fast generation transaction submission mechanism includes classification based on transaction records, and the classification includes verification success, verification failure and special case handling; The information that has been successfully verified twice is uploaded to the blockchain again for credibility testing to confirm whether the information is complete and credible, and the missing information is extracted and marked as verification failure, and the relevant failure information is recorded; If an error occurs during the recording process, an alarm is generated through the blockchain to inform the operator to extract the log records.

8. A low-latency covert communication system based on a blockchain transaction tree, based on the low-latency covert communication method based on a blockchain transaction tree according to any one of claims 1 to 7, characterized in that: include, Combining modules, the label tree is generated by introducing the ancestor key ASK, and combined with the circular hash mechanism, a dynamic chain of left and right subtrees is generated; The integration module combines the left and right subtrees of the label tree with the circular hashing mechanism to generate input addresses and output addresses by fusing the ciphertext, which are integrated into a label set and uploaded to the blockchain. The ciphertext includes the secret information for concealed transmission. The screening module screens transactions based on the integrated tag set, uses tag matching technology to restore ciphertext, and quickly generates a transaction submission mechanism.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the low-latency covert communication method based on the blockchain transaction tree are implemented as described in any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the low-latency covert communication method based on the blockchain transaction tree according to any one of claims 1 to 7 are implemented.

Images