CN116821967B - Intersection computing method and system for privacy protection - Google Patents
Intersection computing method and system for privacy protection Download PDFInfo
- Publication number
- CN116821967B CN116821967B CN202311099229.0A CN202311099229A CN116821967B CN 116821967 B CN116821967 B CN 116821967B CN 202311099229 A CN202311099229 A CN 202311099229A CN 116821967 B CN116821967 B CN 116821967B
- Authority
- CN
- China
- Prior art keywords
- character
- combination
- character combination
- coding
- characters
- 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
- 238000004364 calculation method Methods 0.000 title claims description 9
- 238000000034 method Methods 0.000 claims abstract description 20
- 230000006378 damage Effects 0.000 claims description 51
- 238000010606 normalization Methods 0.000 claims description 31
- 230000000694 effects Effects 0.000 abstract description 18
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001010 compromised effect Effects 0.000 description 1
- 238000005336 cracking Methods 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
Landscapes
- Document Processing Apparatus (AREA)
Abstract
The invention provides an intersection calculating method and system for privacy protection. The invention is applied to the technical field of data processing, and the method comprises the following steps: acquiring original data, wherein the original data comprises repeated character combinations; carrying out Huffman coding processing on the original data to determine first coded data; performing MTF coding processing on the character combination, and determining second coded data; and replacing part of the first coded data by the second coded data to determine the coded data corresponding to the original data, wherein the part of the first coded data comprises the coded data corresponding to the character combination in the first coded data. The MTF coding processing is carried out on the character combinations, so that the fixed expression of the repeated character combinations in the original data in the coding result is solved, the corresponding relation between the codes and the original data is reduced, the corresponding relation between the frequency of the coding result and the frequency of the original characters is destroyed, and the encryption effect of the original data is improved.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to an intersection calculating method and system for privacy protection.
Background
With the rapid development of information technology and explosive growth of data volume, various types of data play an increasingly important role in our lives. For example, the transaction information of banks performs multi-party calculation on the data to be stored at different bank points, and data sharing is realized through intersection calculation. Because banking data involves a large amount of customer privacy, how to ensure that the data privacy of parties is not compromised becomes an important point in intersection computing.
For bank transaction data, the data format is relatively fixed, so that the contained characters are relatively fixed, and the data can be directly encrypted by utilizing Huffman coding. However, a large amount of fixed information exists in a data format of the transaction data, at this time, character combinations corresponding to the fixed information names repeatedly appear, that is, the repeated character combinations have the same coding result in the huffman coding, and because the frequency relation between the original data characters and the coding result exists in the huffman coding, the corresponding relation between the coding result and the character combinations is easy to appear, so that the corresponding relation between the characters and the coding result is leaked, and the encryption effect of the current coding on the original data is poor.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides an intersection calculating method and system for privacy protection.
The invention is realized by the following technical scheme:
the invention provides an intersection calculating method for privacy protection, which comprises the following steps:
acquiring original data, wherein the original data comprises repeated character combinations;
carrying out Huffman coding processing on the original data to determine first coded data;
MTF coding is carried out on the character combination, and second coding data is determined;
and replacing part of the first coded data by the second coded data, and determining the replaced first coded data as coded data corresponding to the original data, wherein the part of the first coded data comprises coded data corresponding to the character combination in the first coded data.
Further, before the MTF encoding is performed on the character combination to determine the second encoded data, the method further includes:
determining the overall damage degree of all characters in the character combination as a whole in the adjacent relation in a character list according to the shortest distance between the character combination and other character combinations, the number of the characters comprises the number of all the characters in the character combination, the other character combinations comprise the character combinations of the characters in the character combination, and the distance average comprises the distance average of the repeated occurrence of the character combination in the original data;
and determining the damage degree of the adjacent relation of a character in the character combination in the character list according to the integral damage degree and the distance, wherein the distance comprises the distance between a first character in the character combination and the first character in other character combinations.
Further, the MTF encoding processing is performed on the character combination, and determining second encoded data includes:
the degree of destruction is setPerforming normalization processing to determine normalization result->；
At the normalization resultWhen the value is larger than a preset value, taking the v character in the character combination as an independent coding character to carry out MTF coding;
at the normalization resultAnd when the character combination is smaller than or equal to the preset value, determining whether the character combination is adjacent to a first other character combination, if not, taking the character as an independent coding character to carry out MTF coding, and if so, taking the first other character combination with the adjacent character as an integral coding character to carry out MTF coding, wherein the first other character combination comprises the character combination with the damage degree smaller than or equal to the preset value.
Further, the determining, according to the shortest distance between the character combination and other character combinations, the number of characters, and the distance average, the overall destruction degree of the adjacent relationship between all the characters in the character combination as a whole in the character list includes:
according to the formulaDetermining the overall degree of destruction of all characters in said character combination as a whole in the neighbor relation in the character list +.>Wherein->For the shortest distance between the character combination and the other character combinations where the v-th character exists,/o>For the character combinations to correspond to distance averages that repeatedly appear in the original data,the number of all characters in the character combination.
Further, the determining, according to the overall destruction degree and the distance, the destruction degree of the adjacent relation of each character in the character combination in the character list includes:
according to the formulaDetermining the degree of disruption of the adjacency of each character in said character combination in the character list, wherein +.>Indicating that the v-th character is present in other character combinations,/->Indicating that the v-th character is not present in other character combinations,/->Representing the distance between the position of the s-th character in said character combination present in the other character combination and the s-th character in said character combination,/for the character combination>Representing the normalization function.
The present invention also provides an intersection computing system for privacy protection, comprising:
the acquisition module is used for acquiring original data, wherein the original data comprises repeated character combinations;
the first processing module is used for carrying out Huffman coding processing on the original data and determining first coded data;
the second processing module is used for carrying out MTF coding processing on the character combination and determining second coded data;
the determining module is used for replacing part of the first encoded data with the second encoded data, determining that the replaced first encoded data is encoded data corresponding to the original data, and the part of the first encoded data comprises encoded data corresponding to the character combination in the first encoded data.
Further, the second processing module is further configured to determine, according to a shortest distance between the character combination and other character combinations, a number of characters including the number of all characters in the character combination, and a distance average value including a distance average value of the characters in the character combination that repeatedly appears in the original data, an overall failure degree of an adjacent relationship in the character list of all characters in the character combination as a whole; and determining the damage degree of the adjacent relation of a character in the character combination in the character list according to the integral damage degree and the distance, wherein the distance comprises the distance between a first character in the character combination and the first character in other character combinations.
Further, the second processing module is further configured to compare the damage degreePerforming normalization processing to determine normalization result->The method comprises the steps of carrying out a first treatment on the surface of the At the normalization result->When the value is larger than a preset value, taking the v character in the character combination as an independent coding character to carry out MTF coding; at the normalization result->And when the character combination is smaller than or equal to the preset value, determining whether the character combination is adjacent to a first other character combination, if not, taking the character as an independent coding character to carry out MTF coding, and if so, taking the first other character combination with the adjacent character as an integral coding character to carry out MTF coding, wherein the first other character combination comprises the character combination with the damage degree smaller than or equal to the preset value.
Further, the second processing module is further configured to perform a processing according to a formulaDetermining the overall degree of destruction of all characters in said character combination as a whole in the neighbor relation in the character list +.>Wherein->For the shortest distance between the character combination and the other character combinations where the v-th character exists,/o>For the character combination corresponds to the distance mean value repeatedly occurring in the original data,/for the character combination>The number of all characters in the character combination.
Further, the second processing module is further configured to perform a processing according to a formulaDetermining the degree of disruption of the adjacency of each character in said character combination in the character list, wherein +.>Indicating that the v-th character is present in other character combinations,/->Indicating that the v-th character is not present in other character combinations,/->Representing the distance between the position of the s-th character in said character combination present in the other character combination and the s-th character in said character combination,/for the character combination>Representing the normalization function.
Compared with the prior art, the invention has the following beneficial technical effects:
the invention provides an intersection calculating method and system for privacy protection. The invention is applied to the technical field of data processing, and the method comprises the following steps: firstly, obtaining original data, wherein the original data comprises repeated character combinations; next, huffman coding is carried out on the original data, and first coded data is determined; then, MTF coding processing is carried out on the character combination, and second coding data is determined; and then, replacing part of the first coded data by the second coded data, and determining the replaced first coded data as coded data corresponding to the original data, wherein the part of the first coded data comprises coded data corresponding to the character combination in the first coded data. And through secondary coding, namely MTF coding processing is carried out on the character combination, the fixed expression of the repeated character combination in the original data in the coding result is solved, so that the corresponding relation between the coding and the original data is reduced, the consistent relation between the frequency of the coding result and the frequency of the original character is destroyed, and the encryption effect of the original data is improved. Further, the MTF coding is carried out by combining the character combinations into the whole coding character, so that the adjacent positions and the adjacent forward movements of the corresponding characters in the character combinations in a character list are avoided, the consistent relation between the coding result and the character combinations is reduced, and the encryption effect is improved; and meanwhile, the character combinations are split by combining the intersection of the characters between the character combinations, so that the coding result is enriched, and the information hiding effect is improved.
Drawings
FIG. 1 is a flow chart of an intersection computing method for privacy protection according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of an intersection computing system for privacy protection according to an embodiment of the present invention.
Detailed Description
The invention will now be described in further detail with reference to specific examples, which are intended to illustrate, but not to limit, the invention.
The intersection calculating method for privacy protection provided by the embodiment of the invention is suitable for encrypting the original transaction data by utilizing Huffman coding, and the encryption of the original data is realized mainly through the corresponding relation between hidden characters and coding results, wherein repeated character combinations exist in the original transaction data. The intersection computing method for privacy protection provided by the embodiment of the invention can be realized by adopting an intersection computing system for privacy protection.
FIG. 1 is a flow chart of an intersection computing method for privacy protection according to an embodiment of the present invention; as shown in fig. 1, an intersection calculating method for privacy protection according to an embodiment of the present invention includes:
and 101, acquiring original data.
The original data in this embodiment includes recurring character combinations;
for example, the original data in this embodiment may be banking transaction data, that is, the transaction system periodically transmits the recorded data to the data management platform as the original data to be encrypted.
102, carrying out Huffman coding processing on the original data to determine first coded data;
in particular, for the original data to be encrypted, i.e. the transaction data, a large number of fixed information names, such as transaction time, transaction user, etc., are generally involved, so that a large number of repeated characters exist in the original data, and at this time, the encryption of the original transaction data can be performed by using huffman coding based on character frequency statistics.
Huffman coding is prior art and will not be described in detail herein. The coding process obtains the corresponding relation table of all characters and codes in the original data as a secret key, and then converts all the characters of the original data into codes corresponding to the coding table to obtain the final coding result of the original data.
In this embodiment, the original transaction data is encrypted using existing huffman coding. The repeated character combinations are formed by a large number of fixed information names contained in the original data, and the coding result also has repeated continuous consistent codes, so that the coding result has obvious regular performance, the risk of cracking the coding result is increased, and the repeated continuous consistent codes easily expose the character combinations in the original data because of the frequency relation between the original data characters and the coding result in the Huffman coding, so that the encryption effect of the current coding on the original data is poor.
Further, the embodiment of the invention can further comprise:
determining the overall damage degree of all characters in the character combination as a whole in the adjacent relation in a character list according to the shortest distance between the character combination and other character combinations, the number of the characters comprises the number of all the characters in the character combination, the other character combinations comprise the character combinations of the characters in the character combination, and the distance average comprises the distance average of the repeated occurrence of the character combination in the original data;
for example, for a large number of repeated character combinations included in the original transaction data mainly originate from fixed information names in the transaction data, all character combinations can be determined directly according to the transaction data format at this time, that is, in the record format of the transaction data, all the information names are obtained first, and a plurality of characters corresponding to each information name form one character combination. From this, all character combinations that occur are determined in the original transaction data.
After Huffman coding is carried out on the current transaction data, the exposure of the coding result to the original information is mainly represented by repeated character combinations with the same coding performance, and the frequencies of the same coding result expose the character combination frequency relation. Because the coding result of the MTF coding for character combinations at different positions depends on the position of the characters in the character list, and the character list is updated continuously, the correspondence between the characters and the codes is changed continuously, i.e. the character combinations at different positions produce different coding results. At this time, the MTF code can be used to perform the secondary coding for the same code representation corresponding to the same character combination.
For the secondary coding of all repeated character combinations, firstly extracting all the character combinations from the original data, and at the moment, when MTF coding is carried out on each character because the character combinations repeatedly occur, characters corresponding to the repeated character combinations are easily adjacent in a character list, so that the consistent relation between a coding result and the character combinations is exposed. At this time, the character combination is used as an integral character to carry out MTF coding, so that the adjacent positions and the adjacent forward movements of the characters corresponding to the character combination in the character list are avoided, the consistent relation of the coding result on the character combination is reduced, and the encryption effect is improved.
When all character combinations are used as whole characters for coding, MTF coding characters are reduced to a large extent, the number of corresponding character lists is small, so that the coding results are not rich enough, and the encryption effect is reduced. But the character combination and MTF encoding result have the following characteristic relationship: when a character corresponding to a recurring character combination exists in other character combinations, the same character moves forward differently in the encoding process of different character combinations, so that the adjacent relation of the character corresponding to the character combination in the character list is destroyed, wherein the destroy degree depends on the position relation between the current character combination and the other character combinations where the character exists, the larger the distance is, the larger the destroy degree is, and the closer the distance is to the repetition period of the current character combination, and the smaller the destroy degree is.
Specifically, according to the formulaDetermining the overall degree of destruction of all characters in said character combination as a whole in the neighbor relation in the character list +.>Wherein->For the shortest distance between the character combination and the other character combinations where the v-th character exists,/o>The larger the value, the greater the damage degree of the adjacent relation of the current character combination in the character list is caused by the forward movement of the v character, when the v character does not exist with other characters，/>The character combinations are mapped to distance averages that are repeated in the original data, i.e. reflect their repetition periods,for the number of all characters in said character combination, < >>The larger the value representing the difference between the two character combinations from the current character combination repetition, the smaller the damage degree of the adjacent relation of the current character combination in the character list,in the current character combination +.>The degree of disruption of adjacent relationships in its character list by the positional relationship of the individual characters present in the other character combinations.
Further, determining the damage degree of the adjacent relation of a character in the character combination in the character list according to the overall damage degree and the distance, wherein the distance comprises the distance between a first character in the character combination and the first character in other character combinations.
For example, the above procedure determines the degree to which the whole character of the character combination is destroyed in the character list, but the character combination is composed of a plurality of characters, at this time, in the same character combination, the degree to which the whole adjacent relation in the character list is destroyed is different from the degree to which the adjacent relation of the adjacent characters in the character list is destroyed by different characters, wherein the smaller the distance between the characters and the characters existing in other character combinations is, the greater the degree to which the adjacent relation in the character list is destroyed by the current character is. The degree of disruption in the character list for all characters in the current character combination is determined accordingly.
Specifically, according to the formulaDetermining the degree of disruption of the adjacency of each character in said character combination in the character list, wherein +.>Indicating that the v character exists in other character combinations, wherein the damage degree of the adjacent relation in the character list is the damage degree of the whole current characterIndicating that the v-th character is not present in other character combinations, the degree of adjacency destruction in the character list is，/>The larger the distance between the position of the s-th character in the character combination and the s-th character in the character combination, the larger the value of the distance, the more the character forward movement caused by the coding of the s-th character in the other character combination affects the adjacent relation of the v-th character of the current character combination in a character list,indicating the presence of a current character set with other character setsInfluence of forward movement of the combined character in the character list on the adjacency of the current v-th character in the character list,/for the character list>Representing the normalization function.
Step 103, MTF coding is carried out on the character combination, and second coded data is determined;
specifically, the degree of destruction isPerforming normalization processing to determine normalization result->；
At the normalization resultWhen the value is larger than a preset value, taking the v character in the character combination as an independent coding character to carry out MTF coding;
at the normalization resultAnd when the character combination is smaller than or equal to the preset value, determining whether the character combination is adjacent to a first other character combination, if not, taking the character as an independent coding character to carry out MTF coding, and if so, taking the first other character combination with the adjacent character as an integral coding character to carry out MTF coding, wherein the first other character combination comprises the character combination with the damage degree smaller than or equal to the preset value.
In this embodiment, when it is determined that a character in a character combination exists in its characteristic character combination, the adjacency relationship of different characters in the corresponding character combination is destroyed in the character list, and the larger the destruction degree is, the smaller the possibility that the corresponding character has a duplicate adjacency character in the character list is, so the greater the possibility that it is an independently encoded character. Based on the degree of destruction of the character in the character listDetermining independently encoded characters, in particular first for all +.>Normalizing by maximum and minimum normalization method to obtain normalized result ++>At this time, judge->If the character of (2) is used as the independent coding character, otherwise, in a character combination, judging whether the character is combined with other +.>If not, it is used as an independent coding character, otherwise, a plurality of +.>Is an integrally encoded character.
The MTF coding characters formed by the characters corresponding to all the character combinations are obtained by utilizing the steps, wherein the characters are combined into an integral coding character through the character combinations, so that the adjacent positions and adjacent forward movements of the characters corresponding to the character combinations in a character list are avoided, the consistent relation of the coding results in the character combinations is reduced, and the encryption effect is improved; and meanwhile, the character combinations are split by combining the intersection of the characters between the character combinations, so that the coding result is enriched, and the information hiding effect is improved.
And 104, replacing part of the first coded data with the second coded data, and determining the replaced first coded data as coded data corresponding to the original data.
The part of the first encoded data in this embodiment includes encoded data corresponding to the character combination in the first encoded data.
Specifically, MTF coding characters are determined in all character combinations, MTF coding is carried out according to the determined characters, an initial character list is determined first, and the MTF coding characters are arranged in the character list from front to back directly according to the coding character frequency from big to small. And then directly utilizing the existing MTF coding technology to code the obtained coding characters to obtain corresponding coding results.
The secondary coding of the character combination corresponding to the original transaction data is completed, and the fixed expression of the fixed information name data in the current transaction data of the characters in the coding result is solved through the secondary coding, so that the corresponding relation between the coding and the original data is reduced, the corresponding relation between the frequency of the coding result and the frequency of the original characters is destroyed, and the encryption effect of the original data is improved.
The process obtains secondary coding results corresponding to all character combinations, the obtained coding results are decimal index value sequences, at the moment, in order to be consistent with the original Huffman coding result, the secondary coding results corresponding to the character combinations are firstly converted into binary sequences, and then the original Huffman coding results corresponding to the character combinations are replaced by the secondary coding results, so that the final coding result is obtained.
The obtained ciphertext data is a twice coding result, and the corresponding secret key is a corresponding coding and character corresponding table in Huffman coding, a final character list in MTF coding and the position of the twice coding.
The encryption of the transaction data is carried out in one bank, at this time, each bank with transaction service is taken as a party for intersection calculation, then ciphertext data of all the parties are transmitted to a central server, and finally intersection operation is carried out on the ciphertext data.
In this embodiment, first, raw data including repeated character combinations is acquired; next, huffman coding is carried out on the original data, and first coded data is determined; then, MTF coding processing is carried out on the character combination, and second coding data is determined; and then, replacing part of the first coded data by the second coded data, and determining the coded data corresponding to the original data, wherein the part of the first coded data comprises the coded data corresponding to the character combination in the first coded data. And through secondary coding, namely MTF coding processing is carried out on the character combination, the fixed expression of the repeated character combination in the original data in the coding result is solved, so that the corresponding relation between the coding and the original data is reduced, the consistent relation between the frequency of the coding result and the frequency of the original character is destroyed, and the encryption effect of the original data is improved. Further, the MTF coding is carried out by combining the character combinations into the whole coding character, so that the adjacent positions and the adjacent forward movements of the corresponding characters in the character combinations in a character list are avoided, the consistent relation between the coding result and the character combinations is reduced, and the encryption effect is improved; and meanwhile, the character combinations are split by combining the intersection of the characters between the character combinations, so that the coding result is enriched, and the information hiding effect is improved.
FIG. 2 is a schematic diagram of an architecture of an intersection computing system based on which an embodiment of the present invention is used for privacy protection; as shown in fig. 2, an intersection computing system for privacy protection provided by an embodiment of the present invention includes: an acquisition module 21, a first processing module 22, a second processing module 23 and a determination module 24, wherein:
an acquisition module 21 for acquiring original data including repeated character combinations;
a first processing module 22, configured to perform huffman coding processing on the original data, and determine first coded data;
a second processing module 23, configured to perform MTF encoding processing on the character combination, and determine second encoded data;
and the determining module 24 is configured to replace a part of the first encoded data with the second encoded data, and determine that the replaced first encoded data is encoded data corresponding to the original data, where the part of the first encoded data includes encoded data corresponding to the character combination in the first encoded data.
In this embodiment, first, raw data including repeated character combinations is acquired; next, huffman coding is carried out on the original data, and first coded data is determined; then, MTF coding processing is carried out on the character combination, and second coding data is determined; and then, replacing part of the first coded data by the second coded data, and determining the coded data corresponding to the original data, wherein the part of the first coded data comprises the coded data corresponding to the character combination in the first coded data. And through secondary coding, namely MTF coding processing is carried out on the character combination, the fixed expression of the repeated character combination in the original data in the coding result is solved, so that the corresponding relation between the coding and the original data is reduced, the consistent relation between the frequency of the coding result and the frequency of the original character is destroyed, and the encryption effect of the original data is improved.
Further, the second processing module 23 is further configured to determine an overall destruction degree of the adjacent relationship in the character list of all characters in the character combination as a whole according to the shortest distance between the character combination and other character combinations, the number of characters including the number of all characters in the character combination, and a distance average value, where the other character combinations include character combinations in which characters in the character combination exist, and the distance average value includes a distance average value in which the character combination is repeated in the original data; and determining the damage degree of the adjacent relation of a character in the character combination in the character list according to the integral damage degree and the distance, wherein the distance comprises the distance between a first character in the character combination and the first character in other character combinations.
On the basis of the embodiment, the second processing module is further configured to destroy the damage degreePerforming normalization processing to determine normalization result->The method comprises the steps of carrying out a first treatment on the surface of the At the normalization result->When the value is larger than a preset value, taking the v character in the character combination as an independent coding character to carry out MTF coding; at the normalization result->And when the character combination is smaller than or equal to the preset value, determining whether the character combination is adjacent to a first other character combination, if not, taking the character as an independent coding character to carry out MTF coding, and if so, taking the first other character combination with the adjacent character as an integral coding character to carry out MTF coding, wherein the first other character combination comprises the character combination with the damage degree smaller than or equal to the preset value.
Preferably, the second processing module of the embodiment of the present invention is further configured toDetermining the overall degree of destruction of all characters in said character combination as a whole in the neighbor relation in the character list +.>Wherein->For the shortest distance between the character combination and the other character combinations where the v-th character exists,/o>For the character combination corresponds to the distance mean value repeatedly occurring in the original data,/for the character combination>The number of all characters in the character combination.
Preferably, the second processing module of the embodiment of the present invention is further configured toDetermining the degree of disruption of the adjacency of each character in said character combination in the character list, wherein +.>Indicating that the v-th character is present in other character combinations,/->Indicating that the v-th character is not present in other character combinations,/->Representing the distance between the position of the s-th character in said character combination present in the other character combination and the s-th character in said character combination,/for the character combination>Representing the normalization function.
In the embodiment, the characters are combined into the whole coding characters to carry out MTF coding, so that adjacent positions and adjacent forward movements of the corresponding characters in the character combination in a character list are avoided, the consistent relation between the coding result and the character combination is reduced, and the encryption effect is improved; and meanwhile, the character combinations are split by combining the intersection of the characters between the character combinations, so that the coding result is enriched, and the information hiding effect is improved.
Claims (2)
1. An intersection computing method for privacy protection, comprising:
acquiring original data, wherein the original data comprises repeated character combinations;
carrying out Huffman coding processing on the original data to determine first coded data;
performing MTF coding processing on the character combination, and determining second coded data;
replacing part of the first coded data by the second coded data, and determining that the replaced first coded data is coded data corresponding to the original data, wherein the part of the first coded data comprises coded data corresponding to the character combination in the first coded data;
the method for performing MTF coding processing on the character combination and determining second coded data further comprises the following steps:
determining the overall damage degree of all characters in the character combination as a whole in the adjacent relation in a character list according to the shortest distance between the character combination and other character combinations, the number of the characters comprises the number of all the characters in the character combination, the other character combinations comprise the character combinations of the characters in the character combination, and the distance average comprises the distance average of the repeated occurrence of the character combination in the original data;
determining the damage degree of the adjacent relation of a character in the character combination in a character list according to the integral damage degree and a distance, wherein the distance comprises the distance between a first character in the character combination and the first character in other character combinations;
the MTF coding processing is carried out on the character combination, and second coding data is determined, and the method comprises the following steps:
the degree of destruction is setPerforming normalization processing to determine normalization result->；
At the normalization resultWhen the value is larger than a preset value, taking the v character in the character combination as an independent coding character to carry out MTF coding;
at the normalization resultWhen the character combination is smaller than or equal to the preset value, determining whether the character combination is adjacent to a first other character combination, if not, taking the character as an independent coding character to carry out MTF coding, and if so, taking the first other character combination with the adjacent character as an integral coding character to carry out MTF coding, wherein the first other character combination comprises the character combination with the damage degree smaller than or equal to the preset value;
the determining the overall destruction degree of all characters in the character combination as the overall adjacent relation in the character list according to the shortest distance between the character combination and other character combinations, the number of characters and the distance average value comprises the following steps:
according to the formulaDetermining the overall degree of destruction of all characters in said character combination as a whole in the neighbor relation in the character list +.>Wherein->For the shortest distance between the character combination and the other character combinations where the v-th character exists,/o>For the character combination corresponds to the distance mean value repeatedly occurring in the original data,/for the character combination>The number of all characters in the character combination is the number;
the determining the damage degree of the adjacent relation of each character in the character combination in the character list according to the overall damage degree and the distance comprises the following steps:
according to the formulaDetermining the degree of disruption of the adjacency of each character in said character combination in the character list, wherein +.>Indicating that the v-th character is present in other character combinations,/->Indicating that the v-th character is not present in other character combinations,/->Representing the distance between the position of the s-th character in said character combination present in the other character combination and the s-th character in said character combination,/for the character combination>Representing the normalization function.
2. An intersection computing system for privacy protection, comprising:
the acquisition module is used for acquiring original data, wherein the original data comprises repeated character combinations;
the first processing module is used for carrying out Huffman coding processing on the original data and determining first coded data;
the second processing module is used for carrying out MTF coding processing on the character combination and determining second coded data;
the method for performing MTF coding processing on the character combination and determining second coded data further comprises the following steps:
determining the overall damage degree of all characters in the character combination as a whole in the adjacent relation in a character list according to the shortest distance between the character combination and other character combinations, the number of the characters comprises the number of all the characters in the character combination, the other character combinations comprise the character combinations of the characters in the character combination, and the distance average comprises the distance average of the repeated occurrence of the character combination in the original data;
determining the damage degree of the adjacent relation of a character in the character combination in a character list according to the integral damage degree and a distance, wherein the distance comprises the distance between a first character in the character combination and the first character in other character combinations;
the MTF coding processing is carried out on the character combination, and second coding data is determined, and the method comprises the following steps:
the degree of destruction is setPerforming normalization processing to determine normalization result->；
At the normalization resultWhen the value is larger than a preset value, taking the v character in the character combination as an independent coding character to carry out MTF coding;
at the normalization resultWhen the character combination is smaller than or equal to the preset value, determining whether the character combination is adjacent to a first other character combination, if not, taking the character as an independent coding character to carry out MTF coding, and if so, taking the first other character combination with the adjacent character as an integral coding character to carry out MTF coding, wherein the first other character combination comprises the character combination with the damage degree smaller than or equal to the preset value;
the determining the overall destruction degree of all characters in the character combination as the overall adjacent relation in the character list according to the shortest distance between the character combination and other character combinations, the number of characters and the distance average value comprises the following steps:
according to the formulaDetermining the overall degree of destruction of all characters in said character combination as a whole in the neighbor relation in the character list +.>Wherein->For the shortest distance between the character combination and the other character combinations where the v-th character exists,/o>For the character combination corresponds to the distance mean value repeatedly occurring in the original data,/for the character combination>The number of all characters in the character combination is the number;
the determining the damage degree of the adjacent relation of each character in the character combination in the character list according to the overall damage degree and the distance comprises the following steps:
according to the formulaDetermining the degree of disruption of the adjacency of each character in said character combination in the character list, wherein +.>Indicating that the v-th character is present in other character combinations,/->Indicating that the v-th character is not present in other character combinations,/->Representing the distance between the position of the s-th character in said character combination present in the other character combination and the s-th character in said character combination,/for the character combination>Representing a normalization function;
the determining module is used for replacing part of the first encoded data with the second encoded data, determining that the replaced first encoded data is encoded data corresponding to the original data, and the part of the first encoded data comprises encoded data corresponding to the character combination in the first encoded data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311099229.0A CN116821967B (en) | 2023-08-30 | 2023-08-30 | Intersection computing method and system for privacy protection |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311099229.0A CN116821967B (en) | 2023-08-30 | 2023-08-30 | Intersection computing method and system for privacy protection |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116821967A CN116821967A (en) | 2023-09-29 |
| CN116821967B true CN116821967B (en) | 2023-11-21 |
Family
ID=88118818
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311099229.0A Active CN116821967B (en) | 2023-08-30 | 2023-08-30 | Intersection computing method and system for privacy protection |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116821967B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118069372A (en) * | 2024-04-15 | 2024-05-24 | 济宁职业技术学院 | Terminal operation speed optimization method and system based on edge calculation |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101064766A (en) * | 2006-04-26 | 2007-10-31 | 夏普株式会社 | Image processing method and image processing apparatus |
| CN104284189A (en) * | 2014-10-23 | 2015-01-14 | 东南大学 | Improved BWT data compression method and hardware implementing system thereof |
| CN106507107A (en) * | 2016-12-08 | 2017-03-15 | 北京聚爱聊网络科技有限公司 | The treating method and apparatus of data |
| CN112003625A (en) * | 2020-08-14 | 2020-11-27 | 山东云海国创云计算装备产业创新中心有限公司 | Huffman coding method, system and equipment |
| CN115292731A (en) * | 2022-08-02 | 2022-11-04 | 深圳市乐凡信息科技有限公司 | Encryption storage method of text reading and amending information and related equipment |
| CN115618809A (en) * | 2022-11-14 | 2023-01-17 | 合肥高维数据技术有限公司 | Character grouping method based on binary character frequency and safe word stock construction method |
| CN116167066A (en) * | 2023-02-28 | 2023-05-26 | 浙江吉利控股集团有限公司 | Data encryption method, device, equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE102017130591B4 (en) * | 2016-12-20 | 2022-05-25 | Hyperstone Gmbh | Method and device for error correction coding based on data compression |
-
2023
- 2023-08-30 CN CN202311099229.0A patent/CN116821967B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101064766A (en) * | 2006-04-26 | 2007-10-31 | 夏普株式会社 | Image processing method and image processing apparatus |
| CN104284189A (en) * | 2014-10-23 | 2015-01-14 | 东南大学 | Improved BWT data compression method and hardware implementing system thereof |
| CN106507107A (en) * | 2016-12-08 | 2017-03-15 | 北京聚爱聊网络科技有限公司 | The treating method and apparatus of data |
| CN112003625A (en) * | 2020-08-14 | 2020-11-27 | 山东云海国创云计算装备产业创新中心有限公司 | Huffman coding method, system and equipment |
| CN115292731A (en) * | 2022-08-02 | 2022-11-04 | 深圳市乐凡信息科技有限公司 | Encryption storage method of text reading and amending information and related equipment |
| CN115618809A (en) * | 2022-11-14 | 2023-01-17 | 合肥高维数据技术有限公司 | Character grouping method based on binary character frequency and safe word stock construction method |
| CN116167066A (en) * | 2023-02-28 | 2023-05-26 | 浙江吉利控股集团有限公司 | Data encryption method, device, equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| BWT与经典压缩算法研究;倪桂强;李彬;罗健欣;张雪;;计算机与数字工程(第11期);全文 * |
| Parallel lossless data compression on the Gpu;Yao Zhang;《IEEE》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116821967A (en) | 2023-09-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116821967B (en) | Intersection computing method and system for privacy protection | |
| Hamza et al. | An efficient cryptosystem for video surveillance in the internet of things environment | |
| Bharti et al. | A novel approach for audio steganography by processing of amplitudes and signs of secret audio separately | |
| CN116582263B (en) | Security protection system for enterprise digital management platform | |
| CN112184444B (en) | Method, device, equipment and medium for processing information based on characteristics of information | |
| Rawat et al. | Steganography technique for hiding text information in color image using improved LSB method | |
| CN115567329B (en) | Data security encryption method for network information | |
| CN115865431A (en) | Network security sharing method for private data | |
| Sarkar et al. | Tree parity machine guided patients’ privileged based secure sharing of electronic medical record: cybersecurity for telehealth during COVID-19 | |
| CN113055153B (en) | Data encryption method, system and medium based on fully homomorphic encryption algorithm | |
| CN112052471B (en) | Information hiding method based on social network space | |
| CN111475690B (en) | Character string matching method and device, data detection method and server | |
| CN117675270A (en) | Multi-mode data encryption transmission method and system for longitudinal federal learning | |
| CN116825259A (en) | Medical data management method based on Internet of things | |
| CN115913581B (en) | Medical data management method and system | |
| CN116506230A (en) | Data acquisition method and system based on RSA asymmetric encryption | |
| CN111159730A (en) | Data processing method, query method, device, electronic equipment and system | |
| Köhler et al. | Protecting information with subcodstanography | |
| CN113987556A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN114398375A (en) | Watermark embedding method, device, equipment and storage medium | |
| CN112118087A (en) | Cross-chain contract compression encryption system and method | |
| CN116320044B (en) | Intelligent encoding and storing system for data of ATM (automatic teller machine) of bank | |
| CN117540441B (en) | Transaction data secure storage method for hall type cloud terminal | |
| CN115664799B (en) | Data exchange method and system applied to information technology security | |
| CN115374462B (en) | Storage management system based on financial service data |
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 |