Cross-interaction-mode and high-capacity group covert communication method applicable to block chain environment and related equipment

By designing an embedding protocol that combines information transmission guidance chains and attributes across dynamic and static addresses, the problems of low embedding capacity and high dynamic address complexity in blockchain hidden communication are solved, and high capacity and flexible group hidden communication are realized. , improves concealment and communication efficiency, and supports dynamic update of group member keys.

CN119051942AActive Publication Date: 2024-11-29Chinese People's Liberation Army Cyberspace Force Information Engineering University
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202411167726.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-23
Publication Date
2024-11-29
Estimated Expiration
2044-08-23

AI Technical Summary

Technical Problem

The hidden communication scheme on the blockchain has problems such as low embedded capacity, high complexity in extraction of dynamic communication addresses, and easy exposure of static address interaction behavior, making it difficult to achieve high-capacity and flexible group hidden communication.

Method used

A cross-interactive information transmission guidance chain is designed, and a static address is generated by encryption keys, the master key is decomposed into subkeys and distributed to group members, and the embedding protocol is designed according to the distribution rules of blockchain transaction attributes. The ciphertext is embedded in the transaction attributes, forming crypto-carrying transactions, publishing them to the blockchain through public channels, realizing high-capacity hidden communications, and providing a key update algorithm to deal with changes in group members.

Benefits of technology

Reduces the computational complexity of dynamic addresses, avoids the risk of behavioral exposure of static addresses, improves concealment and embedding capacity, enriches application scenarios, saves resource consumption, and realizes key updates when group members join and exit , improves communication efficiency and security.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119051942A_ABST
    Figure CN119051942A_ABST
Patent Text Reader

Abstract

The invention provides a cross-interaction-mode and high-capacity group covert communication method applicable to a block chain environment and related equipment. The group steganography method comprises the following steps: encrypting a plaintext by using an encryption key to obtain a ciphertext, and obtaining a static address according to a steganography key; decomposing the master key into a plurality of sub-keys, distributing the plurality of sub-keys to group members, and destroying the master key; obtaining transaction attributes and a distribution rule of the transaction attributes according to the block chain transaction platform data; the transaction attributes are combined according to the principle that the transaction attributes in the embedded domain do not influence each other or restrict each other so as to form the embedded domain; designing an embedding protocol according to the distribution rule of the transaction attributes; a dynamic address is randomly generated, and the dynamic address and the static address are combined to form an information transmission guide chain crossing a dynamic and static interaction mode; and embedding the ciphertext into an embedded domain according to an embedded protocol to generate a secret-carrying transaction, and issuing the secret-carrying transaction to the block chain through a public channel according to an information transmission guide chain.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of communication security technology, and in particular to a cross-interaction and high-capacity group covert communication method and related equipment suitable for a blockchain environment. Background Art

[0002] In the era of big data, all kinds of data are gathered in large quantities, and private data is always facing the risk of leakage and attack. Therefore, protecting the secure transmission and storage of private data has become a hot topic for relevant scholars. Cryptography technology directly encrypts private data, so the generated data is unrecognizable and significantly different from normal data in appearance, which can easily arouse suspicion from third parties. Unlike cryptography technology, covert communication technology embeds encrypted private data into common carriers in secret, and the generated encrypted objects are indistinguishable from normal objects in appearance and statistics, ensuring the secure transmission and storage of private data. Covert communication technology not only encrypts the private data itself, but also hides the existence of the private data, making up for the fact that cryptography technology is difficult to conceal confidential communication and confidential storage.

[0003] Blockchain is an integration of multiple technologies, and its core technologies include consensus mechanism, peer-to-peer transmission, distributed data storage and asymmetric encryption algorithms. The joint use of these technologies makes blockchain decentralized, open, tamper-proof, and anonymous, which provide a natural covert communication environment for secure information transmission and storage. For example: 1) Decentralization: Covert communication in the blockchain network environment adopts a distributed transmission method, which reduces the risk of easy detection and human damage of a single transmission method in a traditional covert communication network, and improves the imperceptibility of the covert channel; 2) Openness: Blockchain is an open platform, and each node can extract secret information from the platform according to the covert scheme, which makes it easy to realize covert transmission of the group; 3) Anonymity: refers to the anonymity of the identities of both parties in communication. The addresses on the blockchain are pseudonymous and unconnectable, which can be used to protect the identities and privacy of both parties in covert communication; 4) Tamper-proof: Each block in the blockchain contains the hash of the previous block, which makes it difficult to tamper with the content of the block, that is, covert communication on the blockchain is more robust. In this context, covert communication technology based on blockchain came into being.

[0004] At present, the covert communication schemes based on blockchain can be divided into four categories according to the different carriers selected, namely, the covert communication scheme based on communication address, the covert communication scheme based on proprietary field, the covert communication scheme based on time modulation and the covert communication scheme based on transaction amount. The covert communication scheme based on communication address is to continuously generate communication addresses, screen and sort the generated communication addresses in combination with secret information, and then directly embed the secret information into the least significant bit or multiple significant bits of the communication address, or indirectly write the secret information into the mapping, public key and digital signature of the generated communication address. The advantage of this type of scheme is that the communication address generated by the cryptographic algorithm can be guaranteed to be secure. However, the disadvantages of this type of scheme are low embedding capacity, low transmission efficiency and occupation of a large number of communication addresses. The covert communication scheme based on proprietary field is to write the secret information into the proprietary field of the blockchain according to the pre-negotiated rules, publish it to the blockchain through transactions, and then realize covert communication. The advantage of this type of scheme is the highest embedding capacity, but there are problems such as easy exposure of transaction behavior and high requirements for application scenarios. Covert communication schemes based on time modulation or transaction amount hide secret information in inherent parameters. These two types of parameters are inherent in all transactions and have a certain degree of concealment. However, when hiding secret information, these two types of schemes need to be simulated according to the normal distribution of sending time and transaction amount to improve anti-detection. These two types of schemes have wider application scenarios and higher flexibility, but the difficulty they face is that the accuracy of fixed fields limits the embedding capacity and the normal transaction distribution law is difficult to simulate.

[0005] In summary, the number of variable and embeddable fields on the blockchain is limited, which requires steganists to propose a covert communication solution with high embedding capacity, strong concealment, low computational complexity and diversified application scenarios. In addition, the openness, transparency and distributed storage of data on the blockchain provide an ideal channel for group covert communication, but group covert communication faces the problem of difficulty in updating keys when group members change. Summary of the invention

[0006] In order to at least partially solve the problems of low embedding capacity, high complexity of dynamic communication address extraction, and easy exposure of interactive behavior of static addresses in the current mainstream blockchain covert communication solutions, the present invention provides a cross-interaction mode and high-capacity group covert communication method and related equipment suitable for a blockchain environment.

[0007] In a first aspect, the present invention provides a cross-interaction and high-capacity group steganography method applicable to a blockchain environment, comprising:

[0008] Step 1: Use the encryption key to encrypt the plaintext to obtain the ciphertext, and obtain the static address based on the steganographic key;

[0009] Step 2: Decompose the master key into several subkeys, distribute the several subkeys to group members according to the pre-agreed rules, and destroy the master key; wherein the master key includes the encryption key and the stegoscopy key;

[0010] Step 3: Obtain transaction attributes and distribution patterns of transaction attributes based on blockchain transaction platform data;

[0011] Step 4: Combine the transaction attributes to form an embedded domain according to the principle that the transaction attributes in the embedded domain do not affect and restrict each other;

[0012] Step 5: Design an embedding protocol based on the distribution pattern of transaction attributes;

[0013] Step 6: randomly generate a dynamic address, and combine the dynamic address with the static address to generate an information transmission guide chain across dynamic and static interaction modes with the static address as the starting address;

[0014] Step 7: Embed the ciphertext into the embedding domain according to the embedding protocol to generate a confidential transaction, and publish the confidential transaction to the blockchain through a public channel according to the information transmission guide chain.

[0015] Furthermore, step 2 specifically includes:

[0016] Set the number of members in the group to n and construct an n-1 degree polynomial;

[0017] Select n different prime numbers and calculate the product M of n different prime numbers;

[0018] Select n different integers as the identities of n members respectively, use the identity of each member as the variable of the n-1 degree polynomial, and calculate the subkey f(x) of each member according to the following formula;

[0019] f(x)=k+a1x+...+a n-1 x n-1 (modM)

[0020] Among them, k represents the master key, a1 to a n-1 are the coefficients of the n-1 degree polynomial, and x represents the identity of any member in the group.

[0021] Furthermore, it also includes:

[0022] When a member exits the group, the subkeys of the remaining group members are updated according to the following formula:

[0023]

[0024] Among them, p iIndicates the prime number corresponding to the member who exits the group, f(x j ) and f'(x j ) represent the subkeys of the remaining group members before and after the update, respectively. represents a set of integers from 0 to M, the updated subkey f'(x j ) should satisfy There is an r i Make the two equations in the above formula equal.

[0025] Furthermore, it also includes:

[0026] When a new member joins the group and no member leaves, the polynomial is reconstructed according to the number of members, and the subkey of each member is updated according to the new polynomial;

[0027] When a new member joins the group and a member leaves at the same time, the subkey of the new member is calculated according to the following formula:

[0028]

[0029] Among them, f(x i ) represents the subkey corresponding to the member who exits the group, f(x n+1 ) represents the subkey of the new member, p n+1 represents the prime number selected for the new member, x n+1 represents the identity given to the new member, represents a set of integers from 0 to M', the subkey f(x n+1 ) should satisfy There is an r i Make the two equations in the above formula equal.

[0030] Furthermore, step 4 specifically includes:

[0031] According to the requirements, the number of embedded available bits in the transaction attributes is removed redundantly to obtain the number of valid bits, and the set of valid bits is recorded as A';

[0032] For any transaction attribute P i , when preparing to transfer the transaction attribute P i When the j-bit of is added to the embedding domain, then A' i ={A' j,i ||A' j,i |=j} and A' i ∈A'; where A' i Represents transaction attribute P i The number of significant digits;

[0033] When the base of the transaction attributes is not considered, the embedding capacity C of the embedding domain is calculated according to the following formula:

[0034] C=A′0P0+A′1P1+…+A′ b-1 P b-1 =A′ j P j

[0035] Where b represents the number of transaction attributes.

[0036] Furthermore, step 5 specifically includes:

[0037] The set of transaction attributes involved in a single transaction is denoted as P, where P = {P0, P1, ..., P b-1}, any transaction attribute P j The number of significant digits in is denoted by A j , A j ={A i,j |i,j∈N};

[0038] When the base of transaction attributes is not considered, the embedding protocol is expressed as follows:

[0039]

[0040] Furthermore, step 6 specifically includes:

[0041] Dynamic addresses are randomly generated continuously. The static address interacts with the first dynamic address, and the first dynamic address interacts with the next dynamic address, eventually forming an information transmission guide chain across dynamic and static addresses.

[0042] In a second aspect, the present invention provides a group steganalysis method applicable to cross-interaction mode and high capacity in a blockchain environment, comprising:

[0043] Step 1: Group members monitor the static address shared by the group in real time. When the static address conducts a transaction, they crawl the transaction containing the subkey and extract the subkey from it according to the pre-agreed rules. Group members negotiate with each other and reconstruct the master key using the subkey.

[0044] Step 2: Decompose the master key into an encryption key and a steganographic key, and obtain a static address based on the steganographic key;

[0045] Step 3: Group members crawl the encrypted transactions pointed to by the information transmission guide chain with the static address as the starting address;

[0046] Step 4: Sort the crawled encrypted transactions according to the order of interaction of each address in the information transmission guide chain, and extract the encrypted sequence from the pre-negotiated embedding domain;

[0047] Step 5: Divide the encrypted sequence according to the pre-negotiated embedding protocol to parse the grouped ciphertext from each transaction attribute;

[0048] Step 6: Merge all grouped ciphertexts to obtain the complete ciphertext;

[0049] Step 7: Use the encryption key to decrypt the ciphertext to obtain plaintext.

[0050] In a third aspect, the present invention provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the method described in any one of the embodiments of the first and second aspects is implemented.

[0051] In a fourth aspect, the present invention provides a non-transitory computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the method described in any one of the embodiments of the first and second aspects is implemented.

[0052] Beneficial effects of the present invention:

[0053] (1) The present invention constructs an information transmission guidance chain across interactive modes. By designing an information transmission guidance chain across dynamic and static addresses, the computational complexity of dynamic address covert communication is reduced, and the risk of easy exposure of communication behavior caused by static address reuse is avoided, thereby improving concealment.

[0054] (2) The present invention also designs a high-capacity embedding protocol for attribute union. The embedding protocol is designed based on the distribution law of transaction attributes, and can adaptively modulate the relationship between different attributes according to different types of blockchains, thereby increasing the embedding capacity, reducing the number of transactions, enriching the diversified application scenarios, and saving resource consumption.

[0055] (3) The present invention also proposes an algorithm that can realize key update when group members join or leave. The algorithm provides a theoretical basis for group covert communication in the blockchain environment through formal analysis and theoretical proof.

[0056] (4) The performance of the method of the present invention is analyzed from the aspects of embedding capacity, correctness and concealment through experiments. The experimental results show that compared with the comparative method, the method of the present invention has advantages in terms of average embedding capacity per transaction and number of transactions. At the same time, the group covert communication method proposed in the present invention greatly improves communication efficiency and saves resource consumption. BRIEF DESCRIPTION OF THE DRAWINGS

[0057] Figure 1A flow chart of a cross-interaction and high-capacity group steganography method applicable to a blockchain environment provided by an embodiment of the present invention;

[0058] Figure 2 A flow chart of a cross-interaction and high-capacity group steganalysis method applicable to a blockchain environment provided by an embodiment of the present invention;

[0059] Figure 3 Schematic diagram of the anti-detection experimental results provided by the embodiment of the present invention: (a) is the frequency distribution and cumulative frequency distribution of transaction amounts analyzed by the Bitcoin-based method; (b) is the frequency distribution and cumulative frequency distribution of transaction release time analyzed by the Time-based method; (c) is the relationship between the embedding capacity and extraction complexity of the Chain-based method;

[0060] Figure 4 Schematic diagram of the transaction number comparison experiment results provided for the embodiment of the present invention: (a) is the comparison result of the method of the present invention and the typical steganographic method under the existing blockchain; (b) is the comparison result of the number of group steganographic transactions with an embedded capacity of 20 bytes; (c) is the comparison result of the number of group steganographic transactions with an embedded capacity of 200 bytes;

[0061] Figure 5 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0062] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution in the embodiment of the present invention will be clearly described below in conjunction with the drawings in the embodiment of the present invention. Obviously, the described embodiment is a part of the embodiment of the present invention, not all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0063] like Figure 1 As shown, an embodiment of the present invention provides a cross-interaction mode and high-capacity group steganography method applicable to a blockchain environment, which is applied to a sender and includes the following steps:

[0064] S101: Use the encryption key to encrypt the plaintext to obtain the ciphertext, and obtain the static address according to the steganographic key;

[0065] Specifically, the sender can select an encryption algorithm as needed, and then use the encryption key and the encryption algorithm to encrypt the ordered plaintext to generate an unordered ciphertext. A static address can be generated based on the steganographic key, or a static address can be selected based on the steganographic key.

[0066] S102: Decomposing the master key into a plurality of subkeys, distributing the plurality of subkeys to group members according to a pre-agreed rule, and destroying the master key; wherein the master key includes the encryption key and the stegoscopy key;

[0067] It can be understood that by decomposing the master key, the security of the master key can be ensured.

[0068] S103: Obtaining transaction attributes and distribution patterns of transaction attributes according to blockchain transaction platform data;

[0069] Specifically, real interaction data can be crawled from blockchain trading platforms, and available and variable transaction attributes can be extracted from the interaction data, such as transaction amount, timestamp, communication address, OP_RETURN and Coinbase on digital currency, and Value, Payload and GasLimit on Ethereum. At the same time, by further analyzing the interaction data, the distribution law of transaction attributes can be statistically analyzed. In this way, encrypted transactions can be generated based on the distribution law of transaction attributes in the future, thereby avoiding abnormal behavior when executing encrypted transactions.

[0070] S104: combining the transaction attributes in the embedded domain according to the principle that the transaction attributes in the embedded domain do not affect and restrict each other to form an embedded domain;

[0071] It can be understood that by rationally grouping different attributes of a transaction into an embedding domain, the embedding capacity can be improved. The elements of the embedding domain can be a single attribute of the same category, multiple attributes of the same category, multiple attributes across categories, multiple attributes across multiple categories, etc.

[0072] S105: Designing an embedded protocol based on the distribution pattern of transaction attributes can avoid abnormal behavior in subsequent transactions to the greatest extent;

[0073] It can be understood that the embedding protocol can not only guarantee the transmission order of secret information but also improve the embedding capacity.

[0074] S106: randomly generate a dynamic address, and combine the dynamic address with the static address to generate an information transmission guide chain across dynamic and static interaction modes with the static address as the starting address;

[0075] Specifically, the sender uses a static address as the initial address, and then randomly generates a dynamic address, so as to guide transactions from static to dynamic and dynamic to dynamic addresses, and establish an information transmission guidance chain across dynamic and static interaction methods.

[0076] S107: Embed the ciphertext into the embedding domain according to the embedding protocol to generate a confidential transaction, and publish the confidential transaction to the blockchain through a public channel according to the information transmission guide chain.

[0077] The cross-interaction and high-capacity group steganography method provided by the embodiment of the present invention is applicable to the blockchain environment. By designing an information transmission guide chain across dynamic and static addresses, the computational complexity of dynamic address hidden communication is reduced, the risk of easy exposure of communication behavior caused by static address reuse is avoided, and the concealment is improved. At the same time, by designing an attribute-joint embedding domain and embedding protocol, the relationship between different transaction attributes can be adaptively modulated according to different types of blockchains, thereby improving the embedding capacity, reducing the number of transactions, enriching the diversified application scenarios, and saving resource consumption.

[0078] In one embodiment, subkeys are distributed or updated as follows.

[0079] Step A1: Assume the number of members in the group is n, and construct an n-1 degree polynomial; as shown in formula (1):

[0080] f(x)=a0+a1x+...+a n-1 x n-1 (1)

[0081] Step A2: Select n different prime numbers, denoted as p, p={p0,p1,...,p n-1}; Calculate the product M of n different prime numbers, as shown in formula (2):

[0082]

[0083] Step A3: Select n different integers as the identities of n members, denoted by x = {x0, x1, ..., x n-1}, using the identity of each member as a variable of the n-1 degree polynomial, calculate the subkey f(x) of each member according to the following formula;

[0084] f(x)=k+a1x+...+a n-1 x n-1 (modM) (3)

[0085] Among them, k represents the master key, which is also the subkey of the group members; a1 to a n-1 are the coefficients of the n-1 degree polynomial, and x represents the identity of any member in the group.

[0086] In one embodiment, when a member in the group exits, the subkeys of the remaining group members are updated according to the following formula:

[0087]

[0088] Among them, p iIndicates the prime number corresponding to the member who exits the group, f(x j ) and f'(x j ) represent the subkeys of the remaining group members before and after the update, respectively. represents a set of integers from 0 to M, the updated subkey f'(x j ) should satisfy There is an r i Make the two equations in formula (4) equal. In practical applications, for each member x in the remaining group members, j , r can be set in the integer range from 0 to M i Traverse, when there is such an r i When the two equations in formula (4) are equal, f'(x j ) as a member x j The updated subkey of .

[0089] It can be understood that in the subkey updating method provided by the embodiment of the present invention, in a covert communication group, when a group member exits, the subkeys of other members in the group only need to be updated according to formula (4), and there is no need to reconstruct formula (3) to obtain the subkey, which can reduce the amount of calculation and improve the calculation speed.

[0090] In one embodiment, when a new member joins the group and no member exits, the polynomial is reconstructed according to the number of members, and the subkey of each member is updated according to the new polynomial;

[0091] Specifically, the corresponding prime numbers and integers may be selected only for the new members, or the prime numbers and integers may be reselected for all members of the group, and the M value may be recalculated, and the subkeys of each member may be updated based on the new M value and the new polynomial.

[0092] In one embodiment, when a new member joins the group and a member exits at the same time, the subkey of the new member is calculated according to the following formula:

[0093]

[0094] Among them, f(x i ) represents the subkey corresponding to the member who exits the group, f(x n+1 ) represents the subkey of the new member, p n+1 represents the prime number selected for the new member, x n+1 represents the identity given to the new member, represents a set of integers from 0 to M', the subkey f(x n+1 ) should satisfy There is an r iMake the two equations in formula (6) equal. In practical applications, for the new member x n+1 , r can be set in the integer range from 0 to M i Traverse, when there is such an r i When the two equations in formula (6) are equal, f(x n+1 ) as a new member x n+1 The updated subkey of .

[0095] The group steganography method provided by the embodiment of the present invention can realize key update when group members join or leave, thereby improving the security of the method; in actual application, while updating the key, the static address can also be synchronously updated to reduce the possibility of master key leakage.

[0096] The determination of the embedding domain needs to consider the distribution trend of each transaction attribute in a normal transaction and the mutual influence and restriction between different attributes, etc. Based on this, in one embodiment, the embedding domain is determined in the following manner.

[0097] Step B1: Remove the redundancy of the embedded available digits in the transaction attributes according to the requirements to obtain the effective digits, and record the set of effective digits as A';

[0098] Step B2: For any transaction attribute P i , when preparing to transfer the transaction attribute P i When the j-bit of is added to the embedding domain, then A' i ={A' j,i ||A' j,i |=j} and A' i ∈A'; where A' i Represents transaction attribute P i The number of significant digits.

[0099] Step B3: when the base of the transaction attributes is not considered, the embedding capacity C of the embedding domain is calculated according to the following formula;

[0100] C=A′0P0+A′1P1+…+A′ b-1 P b-1 =A′ j P j (7)

[0101] Where b represents the number of transaction attributes. From the above formula (7), it can be seen that the embedding capacity is the sum of the effective bits of each transaction attribute in the embedding domain.

[0102] By designing the attribute embedding protocol, secret information can be embedded to a greater extent and the embedding capacity can be improved. In one embodiment, the embedding protocol is designed in the following manner.

[0103] Step C1: The set of transaction attributes involved in a single transaction is recorded as P, where P = {P0, P1, ..., P n-1}, any transaction attribute P j The number of significant digits in is denoted by A j , A j ={A i,j |i,j∈N}; For example, when j=0 and the number of effective bits of P0 is b-1 bits, it can be expressed as A0=[A 00 A 10 ... A b-1,0 ] T .

[0104] Step C2: When the base of the transaction attributes is not considered, the embedding protocol is expressed as the following formula;

[0105]

[0106] The static address is shared by both parties in advance and will not change during the communication process. The dynamic address is generated by the sender and cannot be known by the receiver before the covert communication. In the method of the present invention, the number of transactions required for subkey distribution is small, so static addresses are selected. The transmission of secret messages requires a large number of transactions. Using only static addresses can easily cause the problem of transaction behavior being exposed, and using only dynamic addresses will increase the complexity of extraction. Based on this, in one embodiment, a cross-interaction method combining dynamic and static addresses is proposed, which specifically includes:

[0107] First, a static address is obtained using a steganographic key, and then a dynamic address is continuously generated. Finally, the static address interacts with the dynamic address, and the dynamic address interacts with the dynamic address, thus building an information transmission guide chain across static and dynamic addresses. This guide chain can be formally described as formula (9).

[0108]

[0109] Among them, AG is the address generator, k′ is the steganographic key, SA is the static address, DA is the dynamic address, and CM is a random number or a secret message.

[0110] like Figure 2 As shown, the embodiment of the present invention also provides a group steganalysis method suitable for cross-interaction mode and high capacity in a blockchain environment, comprising the following steps:

[0111] S201: Group members monitor the static address shared by the group in real time. When a transaction is made at the static address, the transaction containing the subkey is crawled and the subkey is extracted from it according to the pre-agreed rules. Group members negotiate with each other and reconstruct the master key using the subkey.

[0112] S202: Decompose the master key into an encryption key and a steganographic key, and obtain a static address according to the steganographic key; it can be understood that the static address is the starting address of the information transmission guide chain.

[0113] S203: The group members crawl the encrypted transactions pointed to by the information transmission guide chain with the static address as the starting address;

[0114] S204: sorting the crawled encrypted transactions according to the order of interaction of each address in the information transmission guide chain, and extracting the encrypted sequence from the pre-negotiated embedding domain;

[0115] S205: dividing the encryption sequence according to the pre-negotiated embedding protocol to parse the grouped ciphertext from each transaction attribute;

[0116] S206: Merge all the grouped ciphertexts to obtain a complete ciphertext;

[0117] S207: Decrypt the ciphertext using the encryption key to obtain plaintext.

[0118] It can be understood that the group steganalysis method provided in the embodiment of the present invention is the reverse process of the group steganalysis method in the above embodiments, which will not be described in detail here.

[0119] Furthermore, in order to verify the effectiveness of the group covert communication method proposed in the present invention, the present invention also conducted relevant experiments, carried out experiments and conducted effective analysis from multiple angles such as the selection of valid attribute fields, the average embedding capacity of each transaction, and the number of transactions in group communication.

[0120] 1. Experimental setup

[0121] The experimental platform is win10 system, Intel i7 processor (CPU: Intel (R) Core (TM) i7-8750H CPU @ 2.20GHz 2.21GHz, memory: 32.0GB), Python is used for programming, and the compilation platform is python 3.6. In addition, digital currency is a typical application of blockchain technology. Next, the digital currency network will be selected as a covert channel to realize the performance comparison between the method of the present invention and other methods.

[0122] (II) Experimental results

[0123] (1) Anti-detection test

[0124] The attributes that can be used for steganography in digital currency networks include transaction amount, transaction interval, communication address, and Op_Return field. Since once information is written in Op_Return, it is very easy to be detected by attackers, this experiment chooses to use three attributes including transaction amount, transaction time, and communication address to implement the method proposed by the present invention. Next, in order to improve concealment and embedding capacity, it is necessary to analyze the fields in these three attributes, obtain the distribution law and characteristics of the attributes, and use this as a basis to select valid fields that can be used for embedding to achieve confusion with normal transactions.

[0125] The Bitcoin-based method statistically analyzed more than 20,000 transactions and found that the transaction amount of digital currency is mainly distributed between 0.01 and 0.1, so the secret information is hidden in the last 7 digits of the transaction amount, that is, the number of valid decimal digits available and embeddable in the transaction amount is 7. Next, by further analyzing the above transactions, the frequency distribution and cumulative frequency distribution of the transaction amount can be obtained, such as Figure 3 (a) is shown. Figure 3 In (a), the composition of the X-axis and the left ordinate represents the frequency distribution of transaction amounts in different intervals, which is presented in a yellow bar graph; the composition of the X-axis and the right ordinate represents the cumulative frequency of transaction amounts in different intervals, which is presented in a red dotted line graph. Figure 3 (a) It can be seen intuitively that the transaction amount shows a steep upward trend between 0 and 1, indicating that the transaction amount is concentrated in this numerical range, and it can be observed from the left vertical axis that 80% of the transaction amounts are distributed between 0 and 1. Therefore, through analysis, it can be seen that the maximum number of effective decimal digits of the transaction amount can be expanded to 8.

[0126] The time-based method analyzes the transaction release time on 50,000 digital currency networks. Based on this, the frequency and cumulative frequency of the time intervals between the initiation of these transactions are statistically analyzed, and the distribution is as follows: Figure 3 (b). Figure 3 (b) is shown. Figure 3 In (b), the composition of the X-axis and the left ordinate represents the frequency distribution of different transaction release times, which is presented in a blue bar graph; the composition of the X-axis and the right ordinate represents the cumulative frequency of transaction amounts in different intervals, which is presented in a red dotted line graph. Figure 3In (b), we can observe that when the statistical transaction interval is 0 to 10 minutes, a more fine-grained analysis is performed, and it is found that the cumulative frequency curve in this range rises gently, indicating that the transaction interval of 0 to 10 minutes is relatively dispersed and more suitable for embedding secret information. Considering practical factors, the longer the transaction interval, the more secret information is hidden, which will extend the release time of the next transaction and directly increase the transmission time of the secret information. Based on this, we suggest that the transaction interval should be as small as possible, while ensuring the embedding capacity and not affecting the communication time.

[0127] The Chain-based method implicitly embeds secret information into the public key used to generate the communication address. This implicit embedding method greatly improves the confidentiality. Figure 3 (c) It can be seen that the extraction complexity of the Chain-based method is inversely proportional to the embedding capacity and increases exponentially. The Chain-based method comprehensively considers the relationship between extraction complexity and embedding capacity, and through testing on a real digital currency network, it finally determines that the embeddable and available field in the communication address is set to 8 bits.

[0128] Based on the above analysis, this group of experiments focused on the reasonable analysis and research of the distribution characteristics of transaction amount, transaction release time, and the relationship between communication address and extraction time when designing the joint entry of attributes based on transaction amount, transaction release time, and communication address. By analyzing the statistical laws of these attributes and their natural variation range in the actual transaction environment, it is possible to select those valid fields that can accommodate secret information and maintain an appearance similar to normal transaction behavior. These fields are independently distributed and highly flexible to ensure that the secret transactions constructed in the process of information hiding are not abrupt in large-scale normal transaction data, thereby effectively evading the detection attempts of potential attackers. Therefore, the precise analysis and clever use of the distribution of these three attributes improve the anti-detection ability of the proposed method, thereby minimizing the risk of being deciphered or discovered by a third party while ensuring the transmission of secret information.

[0129] (2) Transaction quantity comparison experiment

[0130] When the same secret information is embedded, the fewer transactions are generated, the less attention the attacker will get. At the same time, on the blockchain, when transactions are used to transmit secret information, the handling fee is usually proportional to the number of transactions. Based on this, a comparative experiment on the number of transactions between the method of the present invention and the BLOCCE method, Chain-based method, Bitcoin-based method, BLOSCC method and BLOGCE method is given here. The experimental results are as follows: Figure 4 As shown in the figure, the key length of all methods is fixed to 10 bytes.

[0131] Figure 4 (a) is the comparison result between the method of the present invention and the typical steganographic method under the existing blockchain. Figure 4 As can be seen from (a), when the embedding capacity is less than 195 bytes, the number of transactions generated by the BLOSCC method and the BLOGCE method is relatively the least; when the embedding capacity is greater than 195 bytes, the proposed method has an advantage in embedding capacity over the five comparison methods, and this advantage increases with the increase of the embedding capacity. Figure 4 (b) and Figure 4 (c) The comparison results of the number of group steganographic transactions with an embedding capacity of 20 bytes and 200 bytes, respectively. Figure 4 As can be seen from (b), when the embedding capacity is less than 20 bytes, the number of transactions generated by the BLOSCC method and the BLOGCE method is basically the same, but the number of transactions generated by the proposed method is still the smallest. Figure 4 (c) It can be seen that with the increase of embedding capacity, the advantage of the proposed method in the number of transactions becomes more and more prominent, which greatly improves the communication efficiency.

[0132] From the above analysis, it can be seen that in the process of embedding the same secret information, the method of the present invention requires fewer transactions to embed the same secret information than the steganography method under the existing blockchain. When considering the communication of group members, the advantage of the method of the present invention in the number of transactions is more obvious. This advantage in the number of transactions not only effectively reduces the resource cost required to complete the secret information embedding process, but also greatly reduces the risk of behavioral exposure that may be caused by frequent transactions, making the entire covert communication process more secretive and secure. At the same time, a smaller number of transactions means less space occupied in the network, thereby reducing the pressure and burden of network transmission and saving various valuable resources including computing, storage, and network bandwidth. Therefore, while improving efficiency, the method of the present invention takes into account both security and resource utilization, demonstrating its superiority and practicality.

[0133] Figure 5 An example of a physical structure diagram of an electronic device is shown in FIG. Figure 5 As shown, the electronic device may include: a processor 501, a communications interface 502, a memory 503 and a communication bus 504, wherein the processor 501, the communications interface 502 and the memory 503 communicate with each other through the communication bus 504. The processor 501 may call the logic instructions in the memory 503 to execute a group covert communication method suitable for cross-interaction mode and high capacity in a blockchain environment, and the method includes: the steganographic method and / or the steganographic analysis method provided in the above embodiments.

[0134] In addition, when the logic instructions in the above-mentioned memory 503 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 such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including several instructions for 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 method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0135] An embodiment of the present invention also provides a computer program product, which includes a computer program stored on a non-transitory computer-readable storage medium, and the computer program includes program instructions. When the program instructions are executed by a computer, the computer can execute the methods provided by the above-mentioned method embodiments, for example, including: the steganography method and / or steganalysis method provided by the above-mentioned embodiments.

[0136] An embodiment of the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the methods provided by the above-mentioned method embodiments are implemented, for example, including: the steganography method and / or the steganalysis method provided by the above-mentioned embodiments.

[0137] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0138] Finally, 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 aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A cross-interaction and high-capacity group steganography method suitable for blockchain environments, characterized in that: include: Step 1: Use the encryption key to encrypt the plaintext to obtain the ciphertext, and obtain the static address based on the steganographic key; Step 2: Decompose the master key into several subkeys, distribute the several subkeys to group members according to the pre-agreed rules, and destroy the master key; wherein the master key includes the encryption key and the stegoscopy key; Step 3: Obtain transaction attributes and distribution patterns of transaction attributes based on blockchain transaction platform data; Step 4: Combine the transaction attributes to form an embedded domain according to the principle that the transaction attributes in the embedded domain do not affect and restrict each other; Step 5: Design an embedding protocol based on the distribution pattern of transaction attributes; Step 6: randomly generate a dynamic address, and combine the dynamic address with the static address to generate an information transmission guide chain across dynamic and static interaction modes with the static address as the starting address; Step 7: Embed the ciphertext into the embedding domain according to the embedding protocol to generate a confidential transaction, and publish the confidential transaction to the blockchain through a public channel according to the information transmission guide chain.

2. According to claim 1, a cross-interaction and high-capacity group steganography method suitable for a blockchain environment is characterized in that: Step 2 specifically includes: Set the number of members in the group to n and construct an n-1 degree polynomial; Select n different prime numbers and calculate the product M of n different prime numbers; Select n different integers as the identities of n members respectively, use the identity of each member as the variable of the n-1 degree polynomial, and calculate the subkey f(x) of each member according to the following formula; f(x)=k+a1x+...+a n-1 x n-1 (modM) Among them, k represents the master key, a1 to a n-1 are the coefficients of the n-1 degree polynomial, and x represents the identity of any member in the group.

3. According to claim 2, a cross-interaction and high-capacity group steganography method suitable for a blockchain environment is characterized in that: Also includes: When a member exits the group, the subkeys of the remaining group members are updated according to the following formula: Among them, p i Indicates the prime number corresponding to the member who exits the group, f(x j ) and f'(x j ) represent the subkeys of the remaining group members before and after the update, respectively. represents a set of integers from 0 to M, the updated subkey f'(x j ) should satisfy There is an r i Make the two equations in the above formula equal.

4. A cross-interaction and high-capacity group steganography method suitable for a blockchain environment according to claim 2 or 3, characterized in that: Also includes: When a new member joins the group and no member leaves, the polynomial is reconstructed according to the number of members, and the subkey of each member is updated according to the new polynomial; When a new member joins the group and a member leaves at the same time, the subkey of the new member is calculated according to the following formula: Among them, f(x i ) represents the subkey corresponding to the member who exits the group, f(x n+1 ) represents the subkey of the new member, p n+1 represents the prime number selected for the new member, x n+1 represents the identity given to the new member, represents a set of integers from 0 to M', the subkey f(x n+1 ) should satisfy There is an r i Make the two equations in the above formula equal.

5. According to claim 1, a cross-interaction and high-capacity group steganography method suitable for a blockchain environment is characterized in that: Step 4 specifically includes: According to the requirements, the number of embedded available bits in the transaction attributes is removed redundantly to obtain the number of valid bits, and the set of valid bits is recorded as A'; For any transaction attribute P i , when preparing to transfer the transaction attribute P i When the j-bit of is added to the embedding domain, then A′ i ={A' j,i ||A' j,i |=j} and A′ i ∈A'; where A' i Represents transaction attribute P i The number of significant digits; When the base of the transaction attributes is not considered, the embedding capacity C of the embedding domain is calculated according to the following formula: C=A0′P0+A1′P1+…+A b ′ -1 P b-1 =A j ′P j Where b represents the number of transaction attributes.

6. According to claim 5, a cross-interaction and high-capacity group steganography method suitable for a blockchain environment is characterized in that: Step 5 specifically includes: The set of transaction attributes involved in a single transaction is denoted as P, where P = {P0, P1, ..., P b-1 }, any transaction attribute P j The number of significant digits in is denoted as A j , A j ={A i,j |i,j∈N}; When the base of transaction attributes is not considered, the embedding protocol is expressed as follows:

7. According to claim 1, a cross-interaction and high-capacity group steganography method suitable for a blockchain environment is characterized in that: Step 6 specifically includes: Dynamic addresses are randomly generated continuously. The static address interacts with the first dynamic address, and the first dynamic address interacts with the next dynamic address, eventually forming an information transmission guide chain across dynamic and static addresses.

8. A cross-interaction and high-capacity group steganalysis method suitable for blockchain environments, characterized in that: include: Step 1: Group members monitor the static address shared by the group in real time. When the static address conducts a transaction, they crawl the transaction containing the subkey and extract the subkey from it according to the pre-agreed rules. Group members negotiate with each other and reconstruct the master key using the subkey. Step 2: Decompose the master key into an encryption key and a steganographic key, and obtain a static address based on the steganographic key; Step 3: Group members crawl the encrypted transactions pointed to by the information transmission guide chain with the static address as the starting address; Step 4: Sort the crawled encrypted transactions according to the order of interaction of each address in the information transmission guide chain, and extract the encrypted sequence from the pre-negotiated embedding domain; Step 5: Divide the encrypted sequence according to the pre-negotiated embedding protocol to parse the grouped ciphertext from each transaction attribute; Step 6: Merge all grouped ciphertexts to obtain the complete ciphertext; Step 7: Use the encryption key to decrypt the ciphertext to obtain plaintext.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the method according to any one of claims 1 to 8 is implemented.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.

Citation Information

Patent Citations

  • Group steganography method for directional communication based on block chain technology

    CN115118415A

  • Efficient block chain covert communication method based on address coding

    CN116866052A

  • Information storage method, device, and computer-readable storage medium

    EP3591930A1