CN115865953B - Distributed storage system based on cross-border payment - Google Patents
Distributed storage system based on cross-border payment Download PDFInfo
- Publication number
- CN115865953B CN115865953B CN202310125615.6A CN202310125615A CN115865953B CN 115865953 B CN115865953 B CN 115865953B CN 202310125615 A CN202310125615 A CN 202310125615A CN 115865953 B CN115865953 B CN 115865953B
- Authority
- CN
- China
- Prior art keywords
- data
- target
- information block
- payment
- column
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Storage Device Security (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the technical field of data processing, in particular to a distributed storage system based on cross-border payment, which comprises the following components: the system comprises a data acquisition module, a data processing module, a data layering module, a first encryption module, a second encryption module and a storage module. According to the invention, the first encryption of the data is realized by carrying out data processing on the payment data and then carrying out data position scrambling on the processed data, the second encryption of the data is realized by carrying out data information scrambling on the data based on the first encryption, and the encrypted data is stored, so that the encryption effect of the data is improved, and the safety of data storage is ensured.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a distributed storage system based on cross-border payment.
Background
With the continuous development of economic globalization and people consumption level, cross-border consumption is active gradually, such as foreign commodity purchase or commodity sale to foreign clients in common online shopping, cross-border payment is generated at the same time of cross-border consumption, and all large amount of cross-border payment data are stored in a distributed mode because of high efficiency and convenience of distributed storage. However, since a lot of user privacy information or financial information is involved in the cross-border payment, encryption processing is required to be performed on the payment data so as to prevent economic loss caused by leakage of the user privacy information or cracking of the financial data.
For encryption of data, original data information is generally hidden by converting the data, most of the data are based on data scrambling or data replacement at present, but most of the existing data conversion is based on data itself, and the data characteristics and the relation between the data are not considered, so that the conversion process is complex, the hiding degree of useful information is insufficient, the stored encrypted data is easy to attack and break, the encryption effect is poor, and the safety of data storage is affected.
Disclosure of Invention
The invention provides a distributed storage system based on cross-border payment, which aims to solve the problems that the encryption effect of the existing encryption algorithm is poor and the security of data storage is affected.
The distributed storage system based on cross-border payment adopts the following technical scheme:
the data acquisition module is used for acquiring payment data, and the payment data comprises: the user name, the payment time corresponding to the user name and the payment amount;
the data processing module is used for respectively taking each user name and the payment time corresponding to the user name as a node, and taking the payment amount of each user name in each payment time as an edge between the two nodes corresponding to the user name and the payment time to construct a graph structure;
the data layering module is used for taking any node in the graph structure as a reference node, taking all edges and corresponding nodes connected with the reference node as first-layer data, taking all edges and corresponding nodes connected with each node in the first-layer data as second-layer data until all the nodes are layered, and obtaining all the layers of data, wherein each layer of data does not comprise data in the upper-layer data;
the first encryption module is used for acquiring a plurality of path data taking the reference node as a starting point according to the reference node and all layers of data; taking the data corresponding to the nodes or edges in each path data as the data of each position in the information block, and obtaining the information block; carrying out position scrambling on data in the information block by using a chaotic scrambling encryption algorithm to obtain a scrambled target information block;
the second encryption module is used for taking binary codes corresponding to each data in each line of data in the target information block as one line of coded data of the coded block and obtaining the coded block corresponding to each line of data; exclusive or is carried out on each two adjacent lines of coded data in each coded block to obtain encrypted data;
and the storage module is used for storing the encrypted data, the parameters of the chaotic scrambling encryption algorithm, the reference node and the binary codes corresponding to the first row in the coding block.
Preferably, obtaining the scrambled target information block includes:
acquiring a random integer sequence according to a chaotic scrambling encryption algorithm, wherein the length of the random integer sequence is the same as the length of longest path data;
taking each column of data in the information block as target column data;
obtaining an integer value with the same serial number as that of the target column data in the random integer sequence, and taking the integer value as a first target integer value;
performing column translation on each data of the target column data in the information block according to the first target integer value to obtain translated target column data;
and performing column translation on each data of all the target column data to obtain a scrambled target information block.
Preferably, obtaining the translated target column data includes:
shifting each data of the target column data in the information block downwards or upwards along the column direction by a first target integer value unit;
wherein, when the lowest data in the target column data translates downwards along the column direction, the position of the lowest data moving by one unit is the uppermost position of the target column data; when the lowermost data in the target column data is shifted upward in the column direction, the position of the uppermost data shifted by one unit is the lowermost position of the target column data.
Preferably, obtaining the scrambled target information block includes:
acquiring a random integer sequence according to a chaotic scrambling encryption algorithm, wherein the length of the random integer sequence is the same as the length of longest path data;
taking each column of data in the information block as target column data;
acquiring a second target integer value with the same sequence number as that of the target column data in the information block and the random integer sequence, and taking the second target integer value as a target sequence number;
translating the target column data to a target sequence number along the horizontal direction to obtain translated target column data;
and horizontally shifting each data of all the target column data to obtain a scrambled target information block.
Preferably, obtaining the information block includes:
sequencing a plurality of pieces of path data according to the sequence of the obtained path data to obtain a path data sequence;
and taking the first path data in the path data sequence as the first row data of the information block, taking the second path data in the path data sequence as the second row data of the information block, and the like to obtain the information block.
Preferably, obtaining the encrypted data includes:
exclusive-or is carried out on the first line of coded data and the second line of coded data in the coded block to obtain first target coded data;
exclusive-or is carried out on the second line of coded data and the third line of coded data in the coded block to obtain second target coded data;
and so on, until the last-last line of coded data in the coded block is exclusive-ored with the last line of coded data, obtaining all target coding data and obtaining target coding blocks of each coding block;
all target encoded blocks are taken as encrypted data.
Preferably, when performing the exclusive-or operation on two adjacent lines of encoded data in the encoded block, if the number of encoded data in the next line is greater than the number of encoded data in the previous line, the encoding of the encoded data in the next line is complemented with the encoding data after the exclusive-or to finally obtain the target encoded data, and if the number of encoded data in the previous line is greater than the number of encoded data in the next line, the encoding capable of performing the exclusive-or operation in the two lines of encoded data is performed to obtain the target encoded data.
Preferably, huffman coding is adopted to obtain the binary code corresponding to each data in the target information block.
Preferably, the system further comprises: and the decryption module is used for decrypting the encrypted data according to the parameters of the chaotic scrambling encryption algorithm, the reference node and the binary codes corresponding to the first row in the coding block.
Preferably, decrypting the encrypted data includes:
acquiring each coding block according to binary codes and encrypted data corresponding to a first row in the coding blocks;
acquiring a target information block according to binary data in each coding block;
obtaining a corresponding random integer sequence according to parameters of the chaotic scrambling encryption algorithm;
restoring the data position in the target information block according to the random integer sequence to obtain an information block;
and restoring the graph structure according to the data of each path in the information block, and obtaining payment data according to the graph structure.
The distributed storage system based on cross-border payment has the beneficial effects that:
the method comprises the steps of constructing a graph structure by using payment data, realizing the multiple payment processes by using the graph structure, establishing the connection between different payment processes by using the connection relation between nodes of the graph structure, namely obtaining the relation between more payment data, facilitating the conversion of subsequent data, then layering the path information by layering the graph structure, obtaining a plurality of path data by using layered data after layering, obtaining the relation between more nodes and edges, facilitating the realization of the subsequent data conversion and data encryption, jointly representing the information of the graph structure by using the plurality of path data, wherein the obtained path data comprises nodes and edges in the graph structure, namely the nodes and the edges are connected as path objects, avoiding the omission of the edges in the existing node search, further avoiding the information loss of the complete graph structure, namely preventing the loss of the payment data, then constructing an information block based on the path data, encrypting the data in the information block by using a chaotic scrambling encryption algorithm, thereby realizing the encryption of the position of the data, decoding the binary data in each line of the target information block based on the target information block, decoding the binary data in each line of the data, and then encrypting the data by using the binary data in the adjacent line of the data, and encrypting data, thus realizing the encryption effect of the encryption and the data storage and the encryption.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of an embodiment of a cross-border payment based distributed storage system of the present invention;
FIG. 2 is a schematic diagram of a graph structure in an embodiment of a distributed storage system based on cross-border payment in accordance with the present invention;
FIG. 3 is a schematic diagram of hierarchical data corresponding to a graph structure in an embodiment of a distributed storage system based on cross-border payment according to the present invention;
FIG. 4 is a schematic diagram of an information block composed of path data corresponding to a graph structure in an embodiment of a distributed storage system based on cross-border payment according to the present invention;
FIG. 5 is a schematic diagram of a target information block obtained by scrambling the information block in FIG. 4;
FIG. 6 is a schematic diagram of a structure of a coded block obtained by binary coding of the last line of data of the target information block in FIG. 5;
fig. 7 is a schematic diagram of a structure of a target encoded block obtained after exclusive-or of encoded data of the encoded block in fig. 6.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
An embodiment of a distributed storage system based on cross-border payment according to the present invention, as shown in fig. 1, includes: the system comprises a data acquisition module, a data processing module, a data layering module, a first encryption module, a second encryption module and a storage module.
Specifically, the data acquisition module is used for obtaining payment data, and the payment data comprises: the user name, the payment time corresponding to the user name and the payment amount, namely, the cross-border payment data are mainly used as the payment data in the embodiment, the cross-border payment data mainly aims at the user name, the payment amount and the corresponding payment time of the payment related to the cross-border payment process, all data are directly generated in the payment process and are temporarily stored in the payment software, and at the moment, when the payment data are managed, the cross-border payment data can be directly called from the payment software to be used as the payment data of the current payment data management.
Secondly, because the cross-border payment data is continuously generated on the time sequence, when the cross-border payment data is encrypted and stored, the data acquisition period is firstly required to be obtained, and the invention directly sets the data acquisition period to 7 days, namely, takes the cross-border payment data of 7 days as a group of payment data, and carries out subsequent encryption processing.
Specifically, the data processing module takes each user name and the payment time corresponding to the user name as a node respectively, and the payment amount of each user name in each payment time is taken as the edge between the two nodes corresponding to the user name and the payment time, so that a graph structure is constructed.
Since encryption of the payment data mainly aims at the user name, the payment time and the payment amount responded, namely, encryption of the data mainly utilizes the relation between the data to perform data conversion, the stronger the relation between the data is, the better the encryption effect is, but for the payment data of the embodiment, the transfer-out of the payment data mainly aims at account finance, generally, one complete payment process involves one user name and determined payment time, and one user name can perform multiple payments, or multiple user names can simultaneously perform payments, so one user name can correspond to multiple payment times, or multiple user names correspond to the same payment time, so in the embodiment, the correspondence between the user names and the payment time is utilized to represent one complete payment process, therefore, the embodiment utilizes the correspondence between the user names and the payment time in the payment data to establish a graph structure, and the graph structure is used to represent multiple payment processes corresponding to the payment data.
In which, as shown in FIG. 2, a schematic diagram of a graph structure is shown, in FIG. 2, a node
Representing a plurality of payment times, node->
The method comprises the steps of representing a plurality of different user names, connecting a node corresponding to one payment time with a node corresponding to one user name to represent a complete payment process, connecting lines between the node corresponding to the payment time and the node corresponding to the user name represent payment amounts corresponding to the user name in the payment process, connecting lines between the node corresponding to the payment time and the node corresponding to the user name are edges of a graph structure, representing a plurality of payment processes by utilizing the graph structure, establishing connection between different payment processes through connection relations between nodes of the graph structure, namely obtaining relations among more data, and facilitating data conversion and encryption of follow-up payment data.
Specifically, the data layering module is configured to use any node in the graph structure as a reference node, use all edges and corresponding nodes connected by the reference node as first layer data, and use all edges and corresponding nodes connected by each node in the first layer data as second layer data until all nodes are layered, so as to obtain all layer data, where each layer data does not include data in the upper layer data.
Since the conventional graph search algorithm (breadth-first search and depth-first search) is based on nodes, the search path is easy to ignore the edge between two nodes, resulting in the loss of the information of the graph structure, that is, the graph structure data is encrypted in order to prevent the payment amount data in the payment data from being lost in encryption, but the present embodiment searches for different path data in the node connection relationship, so the present embodiment uses the reference node in the graph structure corresponding to fig. 2
For example, the first layer data is node +.>
、/>
、/>
And node->
、、/>
The edge (connection line) between the node and the reference node and the like to obtain each layer of data, and it should be noted that the edge and the node in each search serve as the same layer of data, for example, the node is connected with other nodes, and the node is connected with the node->
Connected edges and corresponding nodes->
As first layer data, then continue from the first layer node +.>
Starting to connect other edges to obtain second-layer data, and layering the graph structure to obtain layered data, wherein all the obtained layered data are shown in FIG. 3Shown.
Specifically, the first encryption module is used for acquiring a plurality of path data taking the reference node as a starting point according to the reference node and all layers of data; taking the data corresponding to the nodes or edges in each path data as the data of each position in the information block, and obtaining the information block; and carrying out position scrambling on data in the information block by using a chaotic scrambling encryption algorithm to obtain a scrambled target information block.
The specific steps of acquiring the path data with the reference node as the starting point include:
as shown in fig. 3, nodes in the graph structure
As reference node, slave node->
Starting to connect other nodes, the different nodes are connected as different paths, and at this time, the path +.>
，/>
And +.>
The method comprises the steps of carrying out a first treatment on the surface of the Then from the current path corresponding node->
，/>
And +.>
Starting to connect other nodes and obtaining the next path +.>
，
，/>
，/>
And +.>
And similarly, searching all nodes to obtain final all path data, namely obtaining first path data: />
Second path data:
third path data: />
Fourth path data:
fifth path data: />
The method comprises the steps of carrying out search layering according to a node connection relation to obtain a plurality of pieces of path data to jointly represent the graph structure information, connecting all sides of nodes to be path objects, avoiding omission of the opposite sides in general node search to obtain complete graph structure information, and simultaneously taking connection paths among layered nodes as search paths according to a search sequence to obtain the plurality of pieces of path data.
The specific steps for obtaining the information block include:
sequencing a plurality of pieces of path data according to the sequence of the obtained path data to obtain a path data sequence; the first path data in the path data sequence is taken as the first row data of the information block, the second path data in the path data sequence is taken as the second row data of the information block, and the like, so as to obtain the information block, wherein the path data obtained in fig. 3 is taken as an example, the finally obtained information block is shown in fig. 4, the data of the node is denoted by a, wherein,the data corresponding to the nodes are: the user name or payment time, B, represents data corresponding to an edge between two nodes, taking path data corresponding to path 1 in figure 4 as an example,
representing data corresponding to a first node in a first row in an information block, +.>
Representing data corresponding to a first side in a first row in an information block, +.>
Representing data corresponding to a second node in a first row in the information block, +.>
Representing data corresponding to the second side in the first row in the information block, +.>
Representing data corresponding to a third node in a first row in the information block, +.>
Representing data corresponding to the third side in the first row in the information block, +.>
The meaning of each data representation in the other rows of the information block is not described here, as is the data corresponding to the fourth node in the first row of the information block.
The specific steps for obtaining the scrambled target information block include:
as shown in fig. 4, since the arrangement of each row of data in the information block is node-side-node … node, in order to destroy the correspondence between the paths and the information, the present embodiment uses the chaotic scrambling encryption algorithm to perform position scrambling on the data of different rows in the information block, that is, to perform information scrambling on the data of different paths, so that a random integer sequence is obtained according to the chaotic scrambling encryption algorithm, where followingThe length of the machine integer sequence is the same as the length of the longest path data; the length of the random integer sequence is the same as the length of the information block, and each row of data in the information block is used as target row data; obtaining an integer value with the same serial number as that of the target column data in the random integer sequence, and taking the integer value as a first target integer value; performing column translation on each data of the target column data in the information block according to the first target integer value to obtain translated target column data; the target column data after the translation is acquired as follows: shifting each data of the target column data in the information block downwards or upwards along the column direction by a first target integer value unit; wherein, when the lowest data in the target column data translates downwards along the column direction, the position of the lowest data moving by one unit is the uppermost position of the target column data; when the lowest data in the target column data translates upwards along the column direction, the position of the highest data moving one unit is the lowest position of the target column data, each data of all the target column data is translated upwards along the column direction to obtain a scrambled target information block, and the scrambled target information block is specifically expressed as an integer number of columns
And (3) performing position scrambling on the random integer sequence obtained by the chaotic scrambling encryption algorithm by using the data in the information block shown in fig. 4 to obtain a target information block shown in fig. 5.
Specifically, the first column data of the information block shown in fig. 4 is taken as the target column data, the column number of the target column data is 1, and when the first column data is scrambled, the first column data needs to be in a random integer sequence
The first target integer value with the same sequence number as the sequence number of the target column data is found out first, namely, the first target integer value is 3, so that each data in the first column data is translated by 3 units along the column direction by taking 3 as a translation unit, and is translated upwards or downwards along the column direction when being translated along the column direction, specifically, in the embodiment, taking downward translation along the column as an example, each data in the first column data is translated downwards by 3 units along the column direction, thus obtaining the first column number as shown in fig. 5According to the target column data after 3 units of downward translation along the column direction, namely the first column data after translation, it is to be noted that, when the lowest data in the target column data translates downward along the column direction, the position of the lowest data moving by one unit is the uppermost position of the target column data; when the lowest data in the target column data translates upwards along the column direction, the position of the highest data moving by one unit is the lowest position of the target column data, namely, in the translation process, a circulation process exists, when the data translates downwards along the column direction, the position of the next translation is circulated to the highest position of the column data when the data translates downwards along the column direction, similarly, when the data translates upwards along the column direction, the position of the next translation is circulated to the lowest position of the column data when the data translates upwards, and the like, the position of all the column data in the information block is scrambled, and the target information block corresponding to the information block is obtained.
In addition, the embodiment utilizes the chaotic scrambling encryption algorithm to carry out position scrambling on the data in the information block to obtain the target information block, and can also adopt a conventional line direction position scrambling mode, and specifically comprises the steps of obtaining a random integer sequence according to the chaotic scrambling encryption algorithm, wherein the length of the random integer sequence is the same as the length of the longest path data; taking each column of data in the information block as target column data; acquiring a second target integer value with the same sequence number as that of the target column data in the information block and the random integer sequence, and taking the second target integer value as a target sequence number; translating the target column data to a target sequence number along the horizontal direction to obtain translated target column data; the method includes that each data of all target column data is horizontally translated to obtain a scrambled target information block, and in the process of obtaining a random integer sequence by using a chaotic scrambling encryption algorithm, parameters of the chaotic scrambling encryption algorithm when the random integer sequence is obtained are the first secret key of the method, and the chaotic scrambling encryption algorithm is a position scrambling encryption algorithm in the prior art, so that redundant description is omitted in the embodiment.
Specifically, the second encryption module is configured to use binary codes corresponding to each data in each line of data in the target information block as one line of coded data of the coding block, and obtain a coding block corresponding to each line of data; and carrying out exclusive OR on the coded data of every two adjacent lines in each coding block to obtain the encrypted data.
Because it is text and number, the binary code of each data in the target information block is obtained by Huffman coding, and for the target information block, each data is also corresponding to the corresponding data of the node and the edge corresponding to the path data, and the node is corresponding to the user name and payment time in the graph structure, and the node is corresponding to the payment amount of the user name in the graph structure, therefore, the fifth line data in the target information block is taken as, for example, as shown in FIG. 5, the fifth line data is
、/>
、/>
、/>
、/>
If the binary codes corresponding to each data in the fifth row of data are sequentially: 10100. 110011, 0110, 11001, 010110, which are composed of coding blocks as shown in fig. 6, namely, each row of data in the target information block corresponds to one coding block; then, the encoded data of each adjacent two rows in the encoded block shown in fig. 6 is xored to obtain encrypted data, and specifically, the obtaining of the encrypted data includes: exclusive-or is carried out on the first line of coded data and the second line of coded data in the coded block to obtain first target coded data; exclusive-or is carried out on the second line of coded data and the third line of coded data in the coded block to obtain second target coded data; and so on until the last line of coded data and the last line of coded data in the coded block are processedExclusive-or, obtaining all target coded data and obtaining target coded blocks, wherein when performing exclusive-or operation on two rows of coded data in the coded blocks, if the number of codes of the coded data of the next row is greater than that of codes of the coded data of the previous row, the codes of the coded data of the next row are complemented with the codes of the rest exclusive-ors to finally obtain the target coded data, and if the number of codes of the coded data of the previous row is greater than that of the codes of the coded data of the next row, the codes which can perform exclusive-or operation in the two rows of coded data are subjected to exclusive-or operation to obtain the target coded data, and the target coded blocks of each coded block are obtained; taking the encoded block shown in fig. 6 as an example, the obtained target encoded block is shown in fig. 7, wherein the darkening and thickening encoding in fig. 7 is performed on two lines of encoded data in the encoded block, and the number of encoded data in the next line is greater than that of encoded data in the previous line when the exclusive or operation is performed, that is, the darkening and thickening encoding is performed on the original encoding in which the encoded data in the next line is greater than that in the previous line, and then all the target encoded blocks are obtained by using the method of obtaining the target encoded blocks of the encoded block shown in fig. 6, and then all the target encoded blocks are used as the encrypted data.
The encryption step of the second encryption module is utilized, the target information block corresponding to the position conversion is carried out according to the search path data of the graph structure, then the data in the target information block is encrypted, so that the encryption of the information of the path data of the graph structure is carried out on the basis of the position encryption of the path data of the graph structure, and the encryption of payment information is realized; the more the connecting edges of the corresponding nodes in the graph structure are, the more paths are located, and because the encryption process is respectively carried out for each path, the more the connecting edges of the corresponding nodes are, the more the number of times of encryption is, and the better the encryption effect is; secondly, the more node connection edges in the graph structure, the denser the current payment is reflected, and the more valuable the data is, so that the method of the embodiment can effectively encrypt the high-value data more efficiently.
Specifically, the storage module is configured to store the encrypted data, the parameter of the chaotic scrambling encryption algorithm, the reference node, and the binary code corresponding to the first line in the encoded block, where the parameter of the chaotic scrambling encryption algorithm in this embodiment is the first key of the encrypted data, the first key is used to decrypt the target information block into the corresponding information block, and since the second encryption module cannot recover the encoded block that obtains the original path data through restoration in the process of obtaining the encrypted data, the binary code corresponding to the first line in the reference node and the encoded block needs to be reserved to implement the process of recovering the target encoded block into the encoded block, so the reference node and the binary code corresponding to the first line in the encoded block are used as the second key of the encrypted data, and the second key is used to decrypt each target encoded block in the encrypted data into the corresponding encoded block, where the chaotic scrambling encryption algorithm in this embodiment selects a column-wise scrambling mode, and since the first data of each line in the information block is the data corresponding to the reference node, and when the column-wise scrambling mode is performed to obtain the encoded block, the target information block, the first data corresponding to the first data of the target information block is also the reference node, and the second key is not required to be changed in the direction of the binary code corresponding to the first line in the first node, and the binary code corresponding to the reference node is only stored in the binary code-phase-scrambling mode, while also requiring a corresponding binary code for the first row of each code block.
Wherein the memory module further comprises: the decryption module is used for decrypting the encrypted data according to the parameters of the chaotic scrambling encryption algorithm, the reference node and the binary codes corresponding to the first row in the coding block, and the decryption process is as follows: performing a exclusive-OR operation on binary codes corresponding to a first row in the coding blocks and first row target coding data of target coding blocks corresponding to each coding block in the encrypted data to obtain binary codes (second row coding data) corresponding to a second row in the coding blocks, performing an exclusive-OR operation on binary codes corresponding to the second row in the coding blocks and second row target coding data of the target coding blocks to obtain binary codes (third row coding data) corresponding to a third row in the coding blocks, and so on, and obtaining coding blocks corresponding to each target coding block according to the binary codes corresponding to the first row in each coding block; because each line of coded data (binary code) in the coding block corresponds to each line of data of the target information block, the target information block can be obtained according to the binary data in each coding block; then obtaining a corresponding random integer sequence according to the parameters of the chaotic scrambling encryption algorithm; restoring the data position in the target information block according to the random integer sequence to obtain an information block; and restoring the graph structure according to the data of each path in the information block, and obtaining payment data according to the graph structure.
After encryption of the payment data is completed, the present invention also performs distributed storage on the encrypted data, namely, selects a nearby server for storage according to the region related to the data because the cross-border payment is generally wide in area where the cross-border payment occurs and most of the cross-border payment data is stored in a distributed mode at present.
The invention constructs a graph structure by using payment data, realizes the multiple payment process by using the graph structure, establishes the connection between nodes of the graph structure by using the connection relation between nodes of the graph structure, namely, obtains the relation between more payment data, facilitates the conversion of subsequent data, then obtains a plurality of path data by layering the graph structure and using layered data, and encrypts the path information to obtain the relation between more nodes and edges, facilitates the realization of subsequent data conversion and data encryption, and commonly represents the information of the graph structure by using the plurality of path data, wherein the obtained path data comprises nodes and edges in the graph structure, namely, the nodes and the edges are connected to serve as path objects, thereby avoiding the omission of edges in the existing node search, avoiding the information loss of the complete graph structure, namely, preventing the loss of payment data, then, constructs an information block based on the path data, encrypts the data in the information block by using a chaotic encryption algorithm to obtain a target information block, encrypts the position of the data by using the layered data, encrypts the position of the target information block, and then encrypts each piece of data by using a binary encryption algorithm to realize the encryption effect of each data in the corresponding data block, and then encrypts the data by the two-bit data, thus realizing the encryption effect of each data in the binary block, and the encryption is prevented.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
Claims (10)
1. A cross-border payment based distributed storage system, comprising:
the data acquisition module is used for acquiring payment data, and the payment data comprises: the user name, the payment time corresponding to the user name and the payment amount;
the data processing module is used for respectively taking each user name and the payment time corresponding to the user name as a node, and taking the payment amount of each user name in each payment time as an edge between the two nodes corresponding to the user name and the payment time to construct a graph structure;
the data layering module is used for taking any node in the graph structure as a reference node, taking all edges and corresponding nodes connected with the reference node as first-layer data, taking all edges and corresponding nodes connected with each node in the first-layer data as second-layer data until all the nodes are layered, and obtaining all the layers of data, wherein each layer of data does not comprise data in the upper-layer data;
the first encryption module is used for acquiring a plurality of path data taking the reference node as a starting point according to the reference node and all layers of data; taking the data corresponding to the nodes or edges in each path data as the data of each position in the information block, and obtaining the information block; carrying out position scrambling on data in the information block by using a chaotic scrambling encryption algorithm to obtain a scrambled target information block;
the second encryption module is used for taking binary codes corresponding to each data in each line of data in the target information block as one line of coded data of the coded block and obtaining the coded block corresponding to each line of data; exclusive or is carried out on each two adjacent lines of coded data in each coded block to obtain encrypted data;
and the storage module is used for storing the encrypted data, the parameters of the chaotic scrambling encryption algorithm, the reference node and the binary codes corresponding to the first row in the coding block.
2. A cross-border payment based distributed storage system as claimed in claim 1 wherein deriving the scrambled target information block comprises:
acquiring a random integer sequence according to a chaotic scrambling encryption algorithm, wherein the length of the random integer sequence is the same as the length of longest path data;
taking each column of data in the information block as target column data;
obtaining an integer value with the same serial number as that of the target column data in the random integer sequence, and taking the integer value as a first target integer value;
performing column translation on each data of the target column data in the information block according to the first target integer value to obtain translated target column data;
and performing column translation on each data of all the target column data to obtain a scrambled target information block.
3. A cross-border payment based distributed storage system as claimed in claim 2 wherein the resulting translated target column data comprises:
shifting each data of the target column data in the information block downwards or upwards along the column direction by a first target integer value unit;
wherein, when the lowest data in the target column data translates downwards along the column direction, the position of the lowest data moving by one unit is the uppermost position of the target column data; when the lowermost data in the target column data is shifted upward in the column direction, the position of the uppermost data shifted by one unit is the lowermost position of the target column data.
4. A cross-border payment based distributed storage system as claimed in claim 1 wherein deriving the scrambled target information block comprises:
acquiring a random integer sequence according to a chaotic scrambling encryption algorithm, wherein the length of the random integer sequence is the same as the length of longest path data;
taking each column of data in the information block as target column data;
acquiring a second target integer value with the same sequence number as that of the target column data in the information block and the random integer sequence, and taking the second target integer value as a target sequence number;
translating the target column data to a target sequence number along the horizontal direction to obtain translated target column data;
and horizontally shifting each data of all the target column data to obtain a scrambled target information block.
5. A cross-border payment based distributed storage system as claimed in claim 1 wherein deriving the information block comprises:
sequencing a plurality of pieces of path data according to the sequence of the obtained path data to obtain a path data sequence;
and taking the first path data in the path data sequence as first row data of the information block, taking the second path data in the path data sequence as second row data of the information block, and the like to obtain the information block.
6. A cross-border payment based distributed storage system as claimed in claim 1 wherein obtaining encrypted data comprises:
exclusive-or is carried out on the first line of coded data and the second line of coded data in the coded block to obtain first target coded data;
exclusive-or is carried out on the second line of coded data and the third line of coded data in the coded block to obtain second target coded data;
and so on, until the last-last line of coded data in the coded block is exclusive-ored with the last line of coded data, obtaining all target coding data and obtaining target coding blocks of each coding block;
all target encoded blocks are taken as encrypted data.
7. The cross-border payment-based distributed storage system according to claim 6, wherein when performing an exclusive-or operation on two adjacent lines of encoded data in the encoded block, if the number of encoded data in the next line is greater than the number of encoded data in the previous line, the code added to the encoded data after the exclusive-or is complemented with the code added to the encoded data after the exclusive-or to obtain the target encoded data, and if the number of encoded data in the previous line is greater than the number of encoded data in the next line, the code capable of performing the exclusive-or operation in the two lines of encoded data is subjected to the exclusive-or operation to obtain the target encoded data.
8. A distributed storage system based on cross-border payment according to claim 1, wherein the binary code corresponding to each data in the target information block is obtained using huffman coding.
9. The cross-border payment based distributed storage system of claim 1, wherein the storage module further comprises: and the decryption module is used for decrypting the encrypted data according to the parameters of the chaotic scrambling encryption algorithm, the reference node and the binary codes corresponding to the first row in the coding block.
10. A cross-border payment based distributed storage system as claimed in claim 9 wherein decrypting the encrypted data comprises:
acquiring each coding block according to binary codes and encrypted data corresponding to a first row in the coding blocks;
acquiring a target information block according to binary data in each coding block;
obtaining a corresponding random integer sequence according to parameters of the chaotic scrambling encryption algorithm;
restoring the data position in the target information block according to the random integer sequence to obtain an information block;
and restoring the graph structure according to the data of each path in the information block, and obtaining payment data according to the graph structure.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310125615.6A CN115865953B (en) | 2023-02-17 | 2023-02-17 | Distributed storage system based on cross-border payment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310125615.6A CN115865953B (en) | 2023-02-17 | 2023-02-17 | Distributed storage system based on cross-border payment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115865953A CN115865953A (en) | 2023-03-28 |
| CN115865953B true CN115865953B (en) | 2023-05-16 |
Family
ID=85658222
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310125615.6A Active CN115865953B (en) | 2023-02-17 | 2023-02-17 | Distributed storage system based on cross-border payment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115865953B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116150714B (en) * | 2023-04-20 | 2023-06-27 | 无锡弘鼎软件科技有限公司 | Security management method for software development data |
| CN117332436B (en) * | 2023-12-01 | 2024-02-23 | 成都乐超人科技有限公司 | Distributed storage method of payment data |
| CN117574457B (en) * | 2024-01-15 | 2024-05-07 | 深圳欧税通技术有限公司 | Data security storage method and system suitable for cross-border payment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105339961A (en) * | 2013-06-28 | 2016-02-17 | 奎斯克股份有限公司 | Hierarchical administration portal |
| CN107548493A (en) * | 2014-05-22 | 2018-01-05 | 普契尼国际有限公司 | Protect directed acyclic graph |
| CN108111540A (en) * | 2018-01-30 | 2018-06-01 | 西安电子科技大学 | The hierarchical access control system and method for data sharing are supported in a kind of cloud storage |
| CN110222520A (en) * | 2019-06-14 | 2019-09-10 | 西安电子科技大学 | The keyword query method of figure encryption data is supported in cloud environment |
| CN114722044A (en) * | 2022-04-06 | 2022-07-08 | 平安科技（深圳）有限公司 | Method and device for marking federal graph nodes, computer equipment and medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3217293B1 (en) * | 2014-11-07 | 2019-05-08 | Hitachi, Ltd. | Method for retrieving encrypted graph, system for retrieving encrypted graph, and computer |
-
2023
- 2023-02-17 CN CN202310125615.6A patent/CN115865953B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105339961A (en) * | 2013-06-28 | 2016-02-17 | 奎斯克股份有限公司 | Hierarchical administration portal |
| CN107548493A (en) * | 2014-05-22 | 2018-01-05 | 普契尼国际有限公司 | Protect directed acyclic graph |
| CN108111540A (en) * | 2018-01-30 | 2018-06-01 | 西安电子科技大学 | The hierarchical access control system and method for data sharing are supported in a kind of cloud storage |
| CN110222520A (en) * | 2019-06-14 | 2019-09-10 | 西安电子科技大学 | The keyword query method of figure encryption data is supported in cloud environment |
| CN114722044A (en) * | 2022-04-06 | 2022-07-08 | 平安科技（深圳）有限公司 | Method and device for marking federal graph nodes, computer equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115865953A (en) | 2023-03-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115865953B (en) | Distributed storage system based on cross-border payment | |
| CN106023051B (en) | DNA image encryption method and system based on cloud model and hyperchaotic system | |
| CN106713274A (en) | Method and device for generating two-dimensional code based on text compression and method and device for reading two-dimensional code based on text compression | |
| CN116471007A (en) | Network information encryption transmission method based on cloud platform | |
| CN115659409B (en) | Financial asset transaction data safe storage method | |
| CN104598801B (en) | A kind of Dynamic Two-dimensional code generating method based on algorithm reconstruct | |
| Ye et al. | Research on reversible image steganography of encrypted image based on image interpolation and difference histogram shift | |
| Torki et al. | Blockchain for steganography: advantages, new algorithms and open challenges | |
| Tahbaz et al. | Evolutionary-based image encryption using Magic Square Chaotic algorithm and RNA codons truth table | |
| CN113067832B (en) | Communication data encryption method based on block chain and artificial intelligence | |
| CN107507254B (en) | Compression of images encryption method based on arithmetic coding | |
| Chattopadhyay et al. | A verifiable (n, n) secret image sharing scheme using XOR operations | |
| CN115760126B (en) | Financial transaction information encryption method | |
| CN115664639B (en) | Financial asset transaction data transmission encryption method | |
| CN117520647A (en) | Cross-modal data retrieval method based on Lu Banghan explicit coding | |
| CN115834163B (en) | Method, device, equipment and storage medium for generating secret key of encrypted data | |
| CN112288617A (en) | Mosaic puzzle-based information hiding and restoring method, equipment and medium | |
| Chang et al. | Meaningful Shadows for Image Secret Sharing with Steganography and Authentication Techniques. | |
| Sanghvi et al. | BITSAT: an efficient approach to modern image cryptography | |
| Tripathi et al. | Invertible secret sharing: Using meaningful shadows based on Sorted Indexed Code | |
| CN112926087A (en) | Secret sharing method with verification function and high embedding capacity based on two-dimensional code | |
| Yan et al. | Secret image sharing based on error-correcting codes | |
| CN114244489A (en) | Image encryption method based on radial diffusion | |
| Shoukat et al. | An Improved Method of Vigenere Cipher to Securely Compress the Text by using Relative Frequency | |
| Yan et al. | Application of random elements in ISS |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |