CN115865953A - Distributed storage system based on cross-border payment - Google Patents
Distributed storage system based on cross-border payment Download PDFInfo
- Publication number
- CN115865953A CN115865953A CN202310125615.6A CN202310125615A CN115865953A CN 115865953 A CN115865953 A CN 115865953A CN 202310125615 A CN202310125615 A CN 202310125615A CN 115865953 A CN115865953 A CN 115865953A
- Authority
- CN
- China
- Prior art keywords
- data
- target
- information block
- payment
- row
- 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.)
- Granted
Links
- 238000012545 processing Methods 0.000 claims abstract description 10
- 230000000739 chaotic effect Effects 0.000 claims description 23
- 238000013519 translation Methods 0.000 claims description 9
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 230000000694 effects Effects 0.000 abstract description 5
- 238000013500 data storage Methods 0.000 abstract description 3
- 238000000034 method Methods 0.000 description 24
- 238000006243 chemical reaction Methods 0.000 description 11
- 238000010586 diagram Methods 0.000 description 10
- 230000009286 beneficial effect Effects 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 238000005336 cracking Methods 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 238000000547 structure data Methods 0.000 description 1
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 device 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. The payment data are subjected to data processing, the processed data are subjected to data position scrambling to realize primary encryption of the data, then the data are subjected to information scrambling based on the primary encrypted data to realize secondary encryption of the data, and the encrypted data are 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 the consumption level of people, cross-border consumption is gradually activated, for example, foreign goods are purchased or sold to foreign customers in common online shopping, cross-border payment is generated while cross-border consumption is performed, and since distributed storage has high efficiency and convenience, all a large amount of cross-border payment data are stored in a distributed manner. However, a large amount of user private information or financial information is involved in cross-border payment, so that payment data needs to be encrypted to prevent economic loss caused by leakage of user private information or cracking of financial data.
For data encryption, data is generally mainly converted to hide original data information, most of the existing data conversion is based on data scrambling or data replacement, but most of the existing data conversion is based on data conversion, data characteristics and the relation between 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 crack, the encryption effect is poor, and the security 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 influenced.
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 constructing a graph structure by taking each user name and the payment time corresponding to the user name as a node respectively and taking the payment amount of each user name at each payment time as an edge between two nodes corresponding to the user name and the payment time;
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 the nodes are completely layered to obtain all layer data, wherein each layer of data does not comprise data in upper-layer data;
the first encryption module is used for acquiring a plurality of pieces of path data taking the reference node as a starting point according to the reference node and all the layer data; taking data corresponding to nodes or edges in each path data as 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 the binary code corresponding to each data in each line of data in the target information block as a line of coded data of the coding block and obtaining the coding block corresponding to each line of data; carrying out XOR on every two adjacent rows of coded data in each coding 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 nodes and the binary codes corresponding to the first row in the coding blocks.
Preferably, the 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 that of the longest path data;
taking each column of data in the information block as target column data;
acquiring an integer value with the same sequence number as the sequence number of the target column data in the random integer sequence, and taking the integer value as a first target integer value;
performing row-to-row translation on each data of the target column data in the information block according to the first target integral value to obtain translated target column data;
and performing row-to-row 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:
translating each data of the target column data in the information block down the column direction or up by a first target integer value unit;
when the data at the lowest part in the target column data is translated downwards along the column direction, the position of the data at the lowest part, which is moved by one unit, is the position of the uppermost part 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, the 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 that 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 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 serial number along the horizontal direction to obtain translated target column data;
and translating each data of all target column data in the horizontal direction to obtain a scrambled target information block.
Preferably, obtaining the information block includes:
sequencing the multiple 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 line data of the information block, taking the second path data in the path data sequence as the second line data of the information block, and so on to obtain the information block.
Preferably, the obtaining of the encrypted data includes:
performing XOR on the first row of encoded data and the second row of encoded data in the encoded block to obtain first target encoded data;
carrying out XOR on the second row of coded data and the third row of coded data in the coding block to obtain second target coded data;
in the same way, until the last row of coded data and the last row of coded data in the coded blocks are subjected to exclusive OR to obtain all target coded data, and a target coded block of each coded block is obtained;
and all target coding blocks are used as encrypted data.
Preferably, when the xor operation is performed on the two adjacent rows of encoded data in the encoding block, if the number of encoded data in the next row of encoded data is greater than the number of encoded data in the previous row of encoded data, the code added in the next row of encoded data is complemented with the encoded data after the xor operation to obtain the target encoded data, and if the number of encoded data in the previous row of encoded data is greater than the number of encoded data in the next row of encoded data, the xor operation is performed on the codes in the two rows of encoded data, which can be subjected to the xor operation, to obtain the target encoded data.
Preferably, the huffman coding is used 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 nodes and the binary codes corresponding to the first line in the coding block.
Preferably, decrypting the encrypted data includes:
acquiring each coding block according to the binary code and the encrypted data corresponding to the first row in the coding block;
acquiring a target information block according to binary data in each coding block;
acquiring 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 each piece of path data in the information block, and obtaining the payment data according to the graph structure.
The cross-border payment-based distributed storage system has the beneficial effects that:
the method comprises the steps of constructing a graph structure by payment data, expressing multiple payment processes by the graph structure, establishing connection among different payment processes by connection relations among nodes of the graph structure, namely obtaining the relation among more payment data, facilitating the conversion of subsequent data, layering the graph structure, obtaining a plurality of pieces of path data by utilizing layered data, layering the path information to obtain the relation between more nodes and edges, facilitating the realization of the subsequent data conversion and data encryption, commonly representing information of the graph structure by the plurality of pieces of path data, connecting the obtained path data by the nodes and the edges in the graph structure, namely the nodes and the edges as path objects, avoiding omission of the edges in the existing node search, avoiding the loss of complete information of the graph structure, namely the loss of the payment data, then constructing an information block based on the path data, carrying out position scrambling encryption on the data in the information block by using a chaos scrambling encryption algorithm to obtain a target information block, realizing the encryption of the position of the data, carrying out decoding on the encryption of each piece of data in the target information block, and then carrying out decryption on the encryption of the data in each coding block in the binary system to obtain the safety encryption data of each coding block, and then realizing the encryption of the encryption data.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
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 cross-border payment based distributed storage system of the present invention;
FIG. 3 is a schematic diagram of hierarchical data corresponding to graph structures in an embodiment of a cross-border payment-based distributed storage system of the present invention;
FIG. 4 is a block diagram of path data composed information blocks corresponding to a graph structure in an embodiment of a distributed storage system based on cross-border payments, according to the present invention;
FIG. 5 is a diagram of a target information block obtained by scrambling the information blocks in FIG. 4;
fig. 6 is a schematic diagram 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 structural diagram of a target coding block obtained after xor processing of the coded data of the coding block in fig. 6.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, belong to the protection scope of the present invention.
An embodiment of a distributed storage system based on cross-border payment according to the present invention is shown in fig. 1, and the implementation includes: the device 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 includes: the user name, the payment time and the payment amount corresponding to the user name, that is, the cross-border payment data mainly serves as the payment data in this embodiment, the cross-border payment data mainly aims at the user name, the payment amount and the corresponding payment time of payment related to the cross-border payment process, all data are directly generated in the payment process and temporarily stored in the payment software, and at this time, the cross-border payment data can be directly called from the payment software to serve as the payment data managed by the current payment data during the payment data management.
Secondly, since the cross-border payment data are continuously generated in a time sequence, when the cross-border payment data are encrypted and stored, an acquisition period of the data needs to be acquired at first, the acquisition period of the data is directly set to be 7 days, namely the cross-border payment data of 7 days are used as a group of payment data, and subsequent encryption processing is carried out.
Specifically, each user name and the payment time corresponding to the user name are respectively used as a node through the data processing module, and the payment amount of each user name at each payment time is used as an edge between two nodes corresponding to the user name and the payment time to construct a graph structure.
Because the encryption of the payment data mainly aims at the user name, the payment time and the responded payment amount involved in the payment process, that is, the encryption of the data mainly utilizes the relationship between the data to perform data conversion, the stronger the relationship between the data is, the better the encryption effect is, for the payment data of the embodiment, mainly aiming at the transfer-in and transfer-out of account finance, generally, a complete payment process relates to one user name and determined payment time, and one user name can perform multiple payments or multiple user names perform payments simultaneously, so one user name can correspond to multiple payment times or multiple user names correspond to the same payment time.
Wherein, as shown in FIG. 2, it is a schematic diagram of a graph structure, and in FIG. 2, nodes
Representing a plurality of payment times, node>
The payment time is a payment time corresponding to the user name, and the payment time is a payment time corresponding to the user nameThe connection line between the node corresponding to the payment time and the node corresponding to the user name is the edge of the graph structure, the multiple payment processes are represented by the graph structure, and the connection between the different payment processes is established through the connection relation between the nodes of the graph structure, namely, the relation between more data is obtained, so that the data conversion and the subsequent payment data encryption are facilitated.
Specifically, the data layering module is configured to use any one node in the graph structure as a reference node, use all edges and corresponding nodes connected to the reference node as first-layer data, and use all edges and corresponding nodes connected to 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 upper-layer data.
Since the existing graph search algorithms (breadth-first search and depth-first search) are based on node search, and the search path easily ignores the edge between two nodes, which results in the loss of information of the graph structure, i.e. in order to prevent the payment amount data in the payment data from being lost during encryption, when the graph structure data is encrypted, but in this embodiment, the search is performed in the node connection relationship to obtain different path data, so in this embodiment, the reference node in the graph structure corresponding to fig. 2 is used as the reference node in the graph structure
For example, the first level data is node->
、
、
And an node->
、、
The edge (connecting line) between the reference node and the reference node is analogized to obtain the number of layers of each layerAccordingly, it should be noted that the edge and the node in each search are the same layer of data, for example, the edge and the node are connected to each other from the node and will be/is connected to the node>
Connected edge and corresponding node>
As first tier data and then on from the first tier node->
And starting to connect other edges to obtain second-layer data, and by analogy, layering the graph structure to obtain layered data, wherein all the finally obtained layer data are shown in fig. 3.
Specifically, the first encryption module is used for acquiring a plurality of pieces of path data with a reference node as a starting point according to the reference node and all layer data; taking data corresponding to nodes or edges in each path data as data of each position in the information block, and obtaining the information block; and carrying out position scrambling on the 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 data of the plurality of paths with the reference node as the starting point include:
as shown in fig. 3, with nodes in the graph structure
Is a reference node, a slave node->
Starting to connect other nodes, connecting different nodes as different paths, and obtaining the path ≥ at this time>
，
And->
(ii) a Then the corresponding node from the current path->
，
And->
Starting to connect other nodes and obtaining the next step path>
，
，
，
And->
And by analogy, all nodes are searched to obtain final all path data, namely the first path data:
And second path data:
And third path data:
fourth path data:
And fifth path data:
So far, the node connection relation is used for searching and layering to obtain the structural information of the common representation diagram of a plurality of pieces of path data, all edges of the nodes are connected as path objects, and the method avoids the problem of the structural information of the common representation diagram of the plurality of pieces of path dataThe omission of opposite sides in general node searching is avoided, complete graph structure information is obtained, and meanwhile, connection paths among the hierarchical nodes are used as searching paths according to a searching sequence to obtain a plurality of pieces of path data.
The specific steps of obtaining the information block include:
sequencing the multiple pieces of path data according to the sequence of the obtained path data to obtain a path data sequence; 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 so on, to obtain the information block, where this embodiment takes the path data obtained in fig. 3 as an example, the finally obtained information block is shown in fig. 4, a is used to represent data of a node, where the data corresponding to the node is: user name or payment time, B represents data corresponding to an edge between two nodes, taking path data corresponding to path 1 in fig. 4 as an example,
representing data corresponding to a first node in a first line in an information block, based on a predetermined criterion>
Represents data corresponding to a first edge in a first line in an information block, and->
Represents data corresponding to a second node in a first row in the block of information, based on the data value, and based on the data value>
Represents data corresponding to the second edge in the first row of the block of information, based on the data value, and based on the data value>
Represents data corresponding to a third node in the first row of the block of information, based on the data value, and->
Represents data corresponding to the third edge in the first row of the block of information, based on the data value in the third row, and based on the data value in the third row>
The meaning of each data representation in the other rows in the information block is not explained in the same way as the data corresponding to the fourth node in the first row in the information block. />
The specific steps of obtaining the scrambled target information block include:
as shown in fig. 4, each row of data in the information block is arranged as "node-edge-node … node", in order to destroy the correspondence between the path and the information, the present embodiment uses the chaotic scrambling encryption algorithm to perform position scrambling between different rows of data in the information block, that is, to perform information scrambling between different path data, so that a random integer sequence is obtained according to the chaotic scrambling encryption algorithm, where the length of the random integer sequence is the same as the length of the longest path data; namely, the length of the random integer sequence is the same as that of the information block, and each line of data in the information block is used as target line of data; acquiring an integer value with the same sequence number as the sequence number of the target column data in the random integer sequence, and taking the integer value as a first target integer value; performing row-direction 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; wherein, the target column data after the translation is obtained is: translating each data of the target column data in the information block down the column direction or up by a first target integer value unit; when the data at the lowest part in the target column data is translated downwards along the column direction, the position of the data at the lowest part, which is moved by one unit, is the position of the uppermost part of the target column data; when the lowest data in the target column data is translated upwards along the column direction, the position of the highest data moved by one unit is the lowest position of the target column data, each data of all the target column data is translated in the column direction to obtain a scrambled target information block, and specifically, the scrambled target information block is obtained by using an integer number of columns
As a random integer sequence obtained by the chaotic scrambling encryption algorithm, the data in the information block shown in fig. 4 is subjected to position scrambling to obtain the target information block shown in fig. 5.
Specifically, when the first column data of the information block shown in fig. 4 is the target column data, the column number of the target column data is 1, and when the first column data is scrambled, the random integer sequence is required
First, a first target integer value, namely a first target integer value, having the same serial number as the column serial number of the target column data is found, so that 3 is taken as a translation unit, each data in the first column of data is translated by 3 units in the column direction, and is translated upwards in the column direction or downwards in the column direction when being translated in the column direction, specifically, in the embodiment, each data in the first column of data is translated downwards by 3 units in the column direction by taking the column-downwards translation as an example, so that the target column data, namely the translated first column of data, after the first column of data is translated downwards by 3 units in the column direction as shown in fig. 5 is obtained, where when the lowest data in the target column of data is translated downwards in the column direction, the position of the lowest data, which is moved by one unit, is the uppermost position of the target column of data; when the data at the lowest part in the target column data is translated upwards along the column direction, the position of the data at the highest part moved by one unit is the position at the lowest part of the target column data, namely, a cyclic process exists in the translation process, when the data is translated downwards along the column direction, the position translated next time is circulated to the position at the uppermost part of the column data every time the data is translated to the position at the lowest part, and similarly, when the data is translated upwards along the column direction, the position translated next time is circulated to the position at the lowermost part of the column data every time the data is translated to the position at the uppermost part, and by analogy, the position scrambling of all the column data in the information block is completed, namely, the target information block corresponding to the information block is obtained.
In addition, in this embodiment, the chaos scrambling encryption algorithm is used to perform position scrambling on data in an information block to obtain a target information block, or a conventional row direction position scrambling mode may also be used, specifically including obtaining a random integer sequence according to the chaos scrambling encryption algorithm, where 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 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 serial number along the horizontal direction to obtain translated target column data; the method includes translating each data of all target column data in the horizontal direction to obtain a scrambled target information block, wherein it needs to be noted that in the process of obtaining a random integer sequence by using a chaotic scrambling encryption algorithm, a parameter of the chaotic scrambling encryption algorithm when the random integer sequence is obtained is a first key of the present invention, and secondly, the chaotic scrambling encryption algorithm is a position scrambling encryption algorithm in the prior art, which is not described in detail in this embodiment.
Specifically, the second encryption module is configured to use a binary code corresponding to each data in each line of data in the target information block as a line of coded data of the coding block, and obtain a coding block corresponding to each line of data; and carrying out XOR on the coded data of every two adjacent lines in each coding block to obtain the encrypted data.
The binary code of each data in the target information block is obtained by using the huffman code, and for the target information block, each data corresponds to the data corresponding to the node and the edge corresponding to the path data, the node corresponds to the user name and the payment time in the graph structure, and the edge corresponds to the payment amount of the user name in the graph structure, so that taking the fifth row data in the target information block as an example, as shown in fig. 5, the fifth row data is the data of the user name
、
、
、
、
If the binary code corresponding to each data in the fifth row of data is: 10100. 110011, 0110, 11001, 010110, which forms the coding block as shown in fig. 6, that is, each line of data in the target information block corresponds to a coding block; then, performing xor on the encoded data of every two adjacent lines in the encoding block shown in fig. 6 to obtain encrypted data, specifically, obtaining the encrypted data includes: performing XOR on the first row of encoded data and the second row of encoded data in the encoded block to obtain first target encoded data; carrying out XOR on the second row of coded data and the third row of coded data in the coding block to obtain second target coded data; and so on, until the second last row of coded data in the coding blocks and the last row of coded data are subjected to exclusive OR to obtain all target coded data and obtain target coding blocks, wherein when the two rows of coded data in the coding blocks are subjected to exclusive OR operation, if the coding number of the next row of coded data is greater than that of the previous row of coded data, the redundant codes of the next row of coded data are supplemented in the last of the rest of the codes subjected to exclusive OR to obtain the target coded data, and if the coding number of the previous row of coded data is greater than that of the next row of coded data, the exclusive OR operation is performed on the codes capable of being subjected to exclusive OR operation in the two rows of coded data to obtain the target coded data and obtain the target coding blocks of each coding block; taking the coding block shown in fig. 6 as an example, the obtained target coding block is shown in fig. 7, where the black-and-bold coding in fig. 7 is a case where the xor operation is performed on two rows of coded data in the coding block, and the number of coded data in the next row is greater than the number of coded data in the previous row, that is, the black-and-bold coding is an original coding in which the number of coded data in the next row is greater than that of coded data in the previous row, and all the target coding blocks are obtained by using the method for obtaining the target coding block of the coding block shown in fig. 6, and then all the target coding blocks are used as encrypted data.
The encryption step of the second encryption module is utilized, the corresponding target information block is subjected to position conversion according to the searched path data of the graph structure, and then the data in the target information block is encrypted, so that the information encryption 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 the payment information is realized; the more connecting edges of the corresponding nodes in the graph structure, the more paths the corresponding nodes belong to, and because the encryption process is used for encrypting each path, the more connecting edges of the corresponding nodes are, the more encryption times are, and the better the encryption effect is; secondly, the more node connecting edges in the graph structure reflect that the current payment is denser and the data is more valuable, so that the method can effectively encrypt the high-value data more efficiently.
Specifically, the storage module is configured to store the encrypted data, the parameter of the chaos scrambling encryption algorithm, the reference node, and the binary code corresponding to the first row in the coding block, where the parameter of the chaos scrambling encryption algorithm is used as a first key of the encrypted data, the first key is used to decrypt the target information block into a corresponding information block, since the process of obtaining the encrypted data by the second encryption module cannot obtain the coding block of the original path data through recovery, the binary code corresponding to the first row in the reference node and the coding block needs to be retained to achieve the process of recovering the target coding block from the coding block, so the binary code corresponding to the first row in the reference node and the coding block is used as a second key of the encrypted data, the second key is used to decrypt each target coding block in the encrypted data into a corresponding coding block, it needs to be explained that, when the chaotic scrambling encryption algorithm in this embodiment selects the column-direction translational scrambling mode, since the first data of each row of data in the information block is the data corresponding to the reference node, and when the column-direction translational scrambling mode is performed to obtain the target information block, the first data of each row of data in the target information block is also the data corresponding to the reference node, the binary code corresponding to the first row in the coding block corresponding to the second key is the binary code corresponding to the reference node, that is, in this embodiment, only the binary code corresponding to the reference node needs to be stored, and when the chaotic scrambling encryption algorithm selects the conventional row-direction positional scrambling mode, since the first column of data in the target information block and the first column of data in the information block may change, when the second key is stored, the second key not only needs the reference node, and simultaneously, binary coding corresponding to the first row of each coding block is also needed.
Wherein, the storage module still includes: the decryption module is used for decrypting the encrypted data according to the parameters of the chaotic scrambling encryption algorithm, the reference nodes and the binary codes corresponding to the first line in the coding block, and the decryption process comprises the following steps: according to the method, binary codes (second row coded data) corresponding to a second row of the coding blocks can be obtained by carrying out exclusionary or operation on the binary codes corresponding to the first row in the coding blocks and the first row target coded data of a target coding block corresponding to each coding block in the encrypted data, and binary codes (third row coded data) corresponding to a third row of the coding blocks can be obtained by carrying out exclusionary or operation on the binary codes corresponding to the second row of the coding blocks and the second row target coded data of the target coding block, and by analogy, the coding blocks corresponding to each target coding block can be obtained according to the binary codes corresponding to the first row in each coding block; each row of coded data (binary code) in the coding block corresponds to each data in each row of data of the target information block, so that the target information block can be obtained according to the binary data in each coding block; then, acquiring 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 each piece of path data in the information block, and obtaining the payment data according to the graph structure.
It should be noted that after the encryption of the payment data is completed, generally, because the area where the cross-border payment occurs is wide, most of the cross-border payment data are stored in a distributed manner at present, so the present invention also performs the distributed storage on the encrypted data, that is, selects a server nearby for storage according to the area related to the data.
The invention relates to a distributed storage system based on cross-border payment, which realizes that a plurality of payment processes are represented by a graph structure by constructing the graph structure through payment data, establishes the relation among different payment processes through the connection relation among nodes of the graph structure, namely obtains the relation among more payment data, facilitates the conversion of subsequent data, then utilizes the layered data to obtain a plurality of path data by layering the graph structure, and utilizes the layered data to obtain the relation among more nodes and edges, thereby facilitating the realization of the subsequent data conversion and data encryption.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and should not be taken as limiting the scope of the present invention, which is intended to cover any modifications, equivalents, improvements, etc. within the spirit and scope of the present 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 constructing a graph structure by taking each user name and the payment time corresponding to the user name as a node respectively and taking the payment amount of each user name at each payment time as an edge between two nodes corresponding to the user name and the payment time;
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 the nodes are completely layered to obtain all layer data, wherein each layer of data does not comprise data in upper-layer data;
the first encryption module is used for acquiring a plurality of pieces of path data taking the reference node as a starting point according to the reference node and all the layer data; taking data corresponding to the nodes or edges in each path data as 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 the binary code corresponding to each data in each line of data in the target information block as a line of coded data of the coding block and obtaining the coding block corresponding to each line of data; carrying out XOR on every two adjacent rows of coded data in each coding 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 nodes and the binary codes corresponding to the first row in the coding block.
2. The cross-border payment-based distributed storage system of claim 1, wherein obtaining 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 that of the longest path data;
taking each column of data in the information block as target column data;
acquiring an integer value with the same sequence number as the sequence number of the target column data in the random integer sequence, and taking the integer value as a first target integer value;
performing row-direction 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 row-to-row translation on each data of all the target column data to obtain a scrambled target information block.
3. The cross-border payment-based distributed storage system of claim 2, wherein obtaining translated target column data comprises:
translating each data of the target column data in the information block down the column direction or up by a first target integer value unit;
when the data at the lowest part in the target column data is translated downwards along the column direction, the position of the data at the lowest part, which is moved by one unit, is the position of the uppermost part 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. The cross-border payment-based distributed storage system of claim 1, wherein obtaining 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 that 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 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 serial number along the horizontal direction to obtain translated target column data;
and translating each data of all target column data in the horizontal direction to obtain a scrambled target information block.
5. The cross-border payment-based distributed storage system of claim 1, wherein obtaining the information block comprises:
sequencing the multiple 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 line data of the information block, taking the second path data in the path data sequence as the second line data of the information block, and so on to obtain the information block.
6. The cross-border payment-based distributed storage system of claim 1, wherein obtaining encrypted data comprises:
carrying out XOR on the first row of coded data and the second row of coded data in the coding block to obtain first target coded data;
carrying out XOR on the second row of coded data and the third row of coded data in the coding block to obtain second target coded data;
in the same way, until the last row of coded data and the last row of coded data in the coded blocks are subjected to exclusive OR to obtain all target coded data, and a target coded block of each coded block is obtained;
and all target coding blocks are used as encrypted data.
7. The cross-border payment-based distributed storage system as claimed in claim 6, wherein when performing exclusive-or operation on two adjacent rows of encoded data in the encoding block, if the number of encoded data in the next row is greater than the number of encoded data in the previous row, the redundant encoded data in the next row is complemented with the encoded data after exclusive-or operation to obtain the target encoded data, and if the number of encoded data in the previous row is greater than the number of encoded data in the next row, the exclusive-or operation is performed on the encoded data in the two rows of encoded data, which can be subjected to exclusive-or operation, to obtain the target encoded data.
8. The cross-border payment-based distributed storage system of claim 1, wherein a huffman code is used to obtain a binary code corresponding to each data in the target information block.
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 nodes and the binary codes corresponding to the first line in the coding block.
10. The cross-border payment-based distributed storage system of claim 9, wherein decrypting the encrypted data comprises:
acquiring each coding block according to the binary code and the encrypted data corresponding to the first row in the coding block;
acquiring a target information block according to binary data in each coding block;
acquiring 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 each piece of path data in the information block, and obtaining the 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 true CN115865953A (en) | 2023-03-28 |
| CN115865953B 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) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116150714A (en) * | 2023-04-20 | 2023-05-23 | 无锡弘鼎软件科技有限公司 | Security management method for software development data |
| CN117332436A (en) * | 2023-12-01 | 2024-01-02 | 成都乐超人科技有限公司 | Distributed storage method of payment data |
| CN117574457A (en) * | 2024-01-15 | 2024-02-20 | 深圳欧税通技术有限公司 | Data security storage method and system suitable for cross-border payment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105339961A (en) * | 2013-06-28 | 2016-02-17 | 奎斯克股份有限公司 | Hierarchical administration portal |
| US20170322977A1 (en) * | 2014-11-07 | 2017-11-09 | Hitachi, Ltd. | Method for retrieving encrypted graph, system for retrieving encrypted graph, and computer |
| 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 |
-
2023
- 2023-02-17 CN CN202310125615.6A patent/CN115865953B/en active Active
Patent Citations (6)
| 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 |
| US20170322977A1 (en) * | 2014-11-07 | 2017-11-09 | Hitachi, Ltd. | Method for retrieving encrypted graph, system for retrieving encrypted graph, and computer |
| 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 |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116150714A (en) * | 2023-04-20 | 2023-05-23 | 无锡弘鼎软件科技有限公司 | Security management method for software development data |
| CN117332436A (en) * | 2023-12-01 | 2024-01-02 | 成都乐超人科技有限公司 | Distributed storage method of payment data |
| CN117332436B (en) * | 2023-12-01 | 2024-02-23 | 成都乐超人科技有限公司 | Distributed storage method of payment data |
| CN117574457A (en) * | 2024-01-15 | 2024-02-20 | 深圳欧税通技术有限公司 | Data security storage method and system suitable for cross-border payment |
| CN117574457B (en) * | 2024-01-15 | 2024-05-07 | 深圳欧税通技术有限公司 | Data security storage method and system suitable for cross-border payment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115865953B (en) | 2023-05-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115865953A (en) | Distributed storage system based on cross-border payment | |
| CN116471007B (en) | Network information encryption transmission method based on cloud platform | |
| US10681013B2 (en) | Methods and systems for concealing information | |
| CN104598801B (en) | A kind of Dynamic Two-dimensional code generating method based on algorithm reconstruct | |
| CN102710417A (en) | Fuzzy vault method based on fingerprint features and Internet key exchange protocol | |
| CN113067832B (en) | Communication data encryption method based on block chain and artificial intelligence | |
| CN107507254B (en) | Compression of images encryption method based on arithmetic coding | |
| CN115760126B (en) | Financial transaction information encryption method | |
| CN117520647A (en) | Cross-modal data retrieval method based on Lu Banghan explicit coding | |
| CN115664639B (en) | Financial asset transaction data transmission encryption method | |
| 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 | |
| CN114697671B (en) | Building engineering quality management system | |
| Zhu et al. | Exploring node repair locality in fractional repetition codes | |
| Shoukat et al. | An Improved Method of Vigenere Cipher to Securely Compress the Text by using Relative Frequency | |
| CN111639351B (en) | Battery tracing management coding encryption and decryption method based on self-encoder and Henon mapping | |
| CN112926087A (en) | Secret sharing method with verification function and high embedding capacity based on two-dimensional code | |
| CN115473610B (en) | Data encoding and decoding method and intersection method for safe multi-party calculation | |
| CN115296799B (en) | Quick face recognition method for micro-service user identity authentication | |
| CN114928437B (en) | Encryption method, device, equipment and storage medium | |
| Yi et al. | Reversible data hiding method in encrypted images using secret sharing and Huffman coding | |
| CN112906844B (en) | Two-dimensional code secret sharing and restoring method and device based on (3,1) Hamming code | |
| Becerra et al. | Secret sharing scheme with efficient cheating detection | |
| JP2014068337A (en) | Coding device, decoding device, coding method, decoding method and program | |
| Deng et al. | Secure Fractional Repetition Codes for Distributed Storage Systems |
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 |