CN113472533A - Data processing method and device based on limited domain key agreement and differential privacy - Google Patents

Data processing method and device based on limited domain key agreement and differential privacy Download PDF

Info

Publication number
CN113472533A
CN113472533A CN202110742017.4A CN202110742017A CN113472533A CN 113472533 A CN113472533 A CN 113472533A CN 202110742017 A CN202110742017 A CN 202110742017A CN 113472533 A CN113472533 A CN 113472533A
Authority
CN
China
Prior art keywords
key
client
abstract
server
primary key
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.)
Pending
Application number
CN202110742017.4A
Other languages
Chinese (zh)
Inventor
陈思成
谢世茂
李开宇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sichuan XW Bank Co Ltd
Original Assignee
Sichuan XW Bank Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Sichuan XW Bank Co Ltd filed Critical Sichuan XW Bank Co Ltd
Priority to CN202110742017.4A priority Critical patent/CN113472533A/en
Publication of CN113472533A publication Critical patent/CN113472533A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0838—Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/56—Financial cryptography, e.g. electronic payment or e-cash

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Storage Device Security (AREA)

Abstract

The invention discloses a data processing method and a device based on finite field key agreement and differential privacy, wherein the method comprises the following steps: acquiring related calculation parameters and sending the related calculation parameters to a client; mixing water into the collision key, mixing forged key data, and recording the forged key data; calculating a semi-abstract of the clash key by adopting a power function modulo algorithm according to the related calculation parameters, and sending the semi-abstract to the client; receiving a half abstract of a client-side collision main key and a full abstract of a server-side collision main key transmitted by a client side, and calculating to obtain the full abstract of the client-side collision main key according to the abstract of the client-side collision main key; according to the full abstract of the server-side collision primary key and the full abstract of the client-side collision primary key, intersecting to obtain a common set; the "water-blended" primary key data is removed from the consensus set, resulting in a true consensus set. The invention adopts the key negotiation algorithm and the power function modular algorithm to realize the intersection of the data, thereby improving the operation speed and the safety.

Description

Data processing method and device based on limited domain key agreement and differential privacy
Technical Field
The invention relates to the technical fields of cryptography, big data, bank wind control, joint marketing and the like, in particular to a data processing method and device based on limited domain key agreement and differential privacy.
Background
In the field of bank combined wind control or combined marketing, the first step of making a combined model is to carry out data clash with a cooperative organization and confirm a common data part, so that subsequent data modeling and data statistics are facilitated.
In terms of resolving data collisions, there are two popular schemes today:
1. and (3) encrypting the identity card number (mobile phone number) of the user in a one-way mode based on a Hash algorithm such as MD5 or SHA-256 and the like, and then taking the intersection of the ciphertext.
2. And carrying out double-blind encryption and decryption on the user identity card numbers of the bank and the partner based on an RSA encryption algorithm, and calculating a common set.
The prior two schemes have the following defects:
scheme 1: based on the hash algorithm, the hash function is fixed, and the partner can attack through the rainbow table, so that the clear text client list of the bank can be obtained. The scheme will be gradually abandoned under the increasingly strict regulatory requirements in the future.
Scheme 2: the encryption bit number of the RSA is about 1024 bits, so the RSA-based scheme has a large performance bottleneck. In addition, if the partner is dishonest, double blind clash based on RSA can be carried out by means of preparing all identity card numbers (mobile phone numbers) of China, and a clear text client list of a bank can be obtained as well.
Therefore, in order to improve the safety and reliability in the data collision process, it is urgently needed to research a safer and more reliable data processing scheme to ensure the safety and improve the performance.
Disclosure of Invention
In order to solve the problems of potential safety hazard and limited performance in the prior art, the invention provides a data processing method based on limited domain key agreement and differential privacy. The invention adopts the key negotiation algorithm and the power function modular algorithm to realize the intersection of the data, thereby improving the operation speed and the safety.
The invention is realized by the following technical scheme:
the data processing method based on the limited domain key negotiation and the differential privacy comprises the data processing steps of a server side, and specifically comprises the following steps:
acquiring related calculation parameters and sending the related calculation parameters to a client;
mixing water into the collision key, mixing forged key data, and recording the forged key data;
calculating a semi-abstract of the collision main key by adopting a power function modulo algorithm according to related calculation parameters, and sending the calculated semi-abstract of the collision main key to a client;
receiving a half abstract of a client-side collision main key and a full abstract of a server-side collision main key transmitted by a client side, and calculating to obtain the full abstract of the client-side collision main key according to the abstract of the client-side collision main key;
according to the full abstract of the server-side collision primary key and the full abstract of the client-side collision primary key, intersecting to obtain a common set;
the "water-blended" primary key data is removed from the consensus set, resulting in a true consensus set.
Preferably, the steps of obtaining the relevant calculation parameters and sending the relevant calculation parameters to the client specifically include:
generating a 128-bit large prime number p and a 32-bit random number x, calculating an original root g of p, and sending p and g to a client;
wherein p satisfies the strong prime condition: i.e. a form where p is 2p '+ 1, where p' is a prime number.
Preferably, the step of mixing in the forged primary key data of the present invention mixes in the forged primary key data specifically in a 1:1 ratio.
Preferably, the step of calculating the semi-abstract of the colliding key by adopting the power function modulo algorithm according to the related calculation parameters specifically comprises the following steps:
A(k1)＝g^(x*k1)mod p；
where k1 denotes the server-side collision primary key, and a (k1) denotes the semi-digest of the server-side collision primary key.
Preferably, the half digest of the client-side colliding key and the full digest of the server-side colliding key transmitted by the client-side of the present invention are calculated by the following formula:
AB(k1)＝A(k1)^y mod p＝g^(x*k1)*y mod p；
B(k2)＝g^(y*k2)mod p；
wherein k2 represents the client-side collision primary key, B (k2) represents the half digest of the client-side collision primary key, AB (k1) represents the full digest of the server-side collision primary key, and y represents a 32-bit random number generated by the client;
the method for obtaining the full abstract of the client-side collision primary key through calculation of the half abstract of the client-side collision primary key specifically comprises the following steps:
AB(k2)＝B(k2)^x mod p＝g^(y*k2)*x mod p；
wherein AB (k2) represents the full digest of the client's clash primary key.
In a second aspect, the present invention provides a data processing method based on finite field key agreement and differential privacy, including a client data processing step, specifically:
receiving related calculation parameters sent by a server side and generating a 32-bit random number y;
calculating by adopting a power function modulo algorithm to obtain a semi-abstract of the clash key;
calculating to obtain a full abstract of the server side for colliding the main key according to the received half abstract of the server side for colliding the main key;
and sending the calculated semi-abstract of the colliding main key and the full abstract of the colliding main key of the server side to obtain a common set.
Preferably, the related calculation parameters received by the present invention and sent by the server include a large prime number p generated by the server and an original root g thereof.
Preferably, the step of calculating the semi-abstract of the colliding key by adopting the power function modulo algorithm comprises the following steps:
B(k2)＝g^(y*k2)mod p；
wherein k2 represents the client-side collision primary key, and B (k2) represents the semi-abstract of the client-side collision primary key;
the step of obtaining the full abstract of the server end collision primary key through calculation according to the received half abstract of the server end collision primary key specifically comprises the following steps of:
AB(k1)＝A(k1)^y mod p；
wherein, A (k1) represents the half summary of the primary key of the server-side collision, and AB (k1) represents the full summary of the primary key of the server-side collision.
In a third aspect, the present invention provides a data processing apparatus based on finite field key agreement and differential privacy, including a server side;
the server side comprises a communication module, a first calculation module, a first generation module, an adulteration module, an intersection module and a storage module;
the first generating module is used for generating parameters required by the first calculating module to calculate;
the adulteration module is used for mixing water in the colliding main key, mixing the forged main key data into the real main key data and storing the forged record in the storage module;
the first calculation module adopts a power function modulo algorithm to calculate a semi-abstract of the collision key after the water mixing and a full abstract of the collision key of the client;
the intersection solving module is used for solving the intersection of the full abstract of the server-side collision primary key and the full abstract of the client-side collision primary key to obtain a common set, and removing 'water-mixed' primary key data from the common set according to the counterfeit records stored in the storage module to obtain a real common set;
the communication module is used for realizing data interaction between the server side and the client side.
In a fourth aspect, the present invention provides a data processing apparatus based on finite field key agreement and differential privacy, including a client;
the client comprises a transmission module, a second calculation module and a second generation module.
The second generating module is used for generating parameters required by the calculation of the second calculating module;
the second calculation module adopts a power function modulo algorithm to calculate the semi-abstract of the collision primary key of the second calculation module and the full abstract of the collision primary key of the server side.
The transmission module is used for receiving the data sent by the server and transmitting the data calculated by the second calculation module to the server.
The invention has the following advantages and beneficial effects:
1. the invention adopts a form based on limited domain key agreement to carry out data intersection, the strength of the key can be generally as low as 128 bits, and the invention has great advantages in encryption speed and data transmission size, and the speed is 3-5 times faster than RSA.
2. The invention' fills water in the data information of the bank, forges the identification number (mobile phone number) according to a certain proportion by adopting a differential privacy technology, and then executes key negotiation for data collision, and the data processing technology can ensure that a clear text client list (sensitive data and the like) of the bank can be protected as far as possible when a partner is not honest.
Drawings
The accompanying drawings, which are included to provide a further understanding of the embodiments of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the principles of the invention. In the drawings:
FIG. 1 is a schematic flow chart of a method of embodiment 1 of the present invention.
Fig. 2 is a schematic flow chart of a method in embodiment 2 of the present invention.
Fig. 3 is a schematic diagram of an interaction process between a server and a client according to embodiment 3 of the present invention.
Fig. 4 is a schematic block diagram of an apparatus according to embodiment 4 of the present invention.
Fig. 5 is a schematic block diagram of an apparatus according to embodiment 5 of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to examples and accompanying drawings, and the exemplary embodiments and descriptions thereof are only used for explaining the present invention and are not meant to limit the present invention.
Example 1
Compared with the existing method that a fixed hash algorithm cannot defend a semi-honest partner or a malicious partner, the method has great potential safety hazards, the RSA-based rendezvous algorithm can defend the semi-honest partner, but the malicious partner still cannot do the best, the method provides a data processing method based on limited domain key negotiation and differential privacy, the method of the embodiment utilizes the limited domain key negotiation algorithm to carry out collective negotiation, the differential privacy algorithm is adopted, and false data is doped in the data, so that even if the opposite party maliciously increases the clash key, the opposite party cannot accurately acquire sensitive data, and further the malicious partner cannot acquire the sensitive data.
The method of the present embodiment includes a server side portion. The server part may be executed by a server side having a function of executing data processing, and specifically, as shown in fig. 1, the server part specifically includes:
step 101, generating a 128-bit large prime number p, calculating an original root g of p, and generating a 32-bit random number x; and sending the p and g to the client.
In this embodiment, p must satisfy a strong prime condition, i.e., a form of p ═ 2p '+ 1, where p' is a prime number.
And 102, mixing water in the collision main key, mixing forged main key data, and recording the forged data.
The primary key data in this embodiment may be identification card information, a telephone number, or the like.
In the present embodiment, the forged primary key data is mixed in at a ratio of 1:1, but it is needless to say that in another preferred embodiment, the forged primary key data may be mixed in at another ratio.
And 103, calculating a semi-digest A (k1) of the collision primary key k1 of the server side by adopting a power function modulo algorithm, and sending the semi-digest A to the client side.
The specific calculation process is as follows:
A(k1)＝g^(x*k1)mod p。
and 104, receiving AB (k1) and B (k2) which are calculated by the client by adopting a power function modular algorithm. Wherein, AB (k1) represents the full digest of the server-side collision primary key k1, and B (k2) represents the half digest of the client-side collision primary key k 2.
The specific calculation process is as follows:
AB(k1)＝A(k1)^y mod p＝g^(x*k1)*y mod p；
B(k2)＝g^(y*k2)mod p。
where y is a 32-bit random number generated by the client.
And step 105, calculating AB (k2) by adopting a power function modulo algorithm aiming at B (k 2). Wherein AB (k2) represents the full digest of the client's clash primary key k 2.
In this embodiment, AB (k2) ═ B (k2) ^ x mod p ^ g ^ (y × k2) × mod p.
In this embodiment, if k1 is k2, g ^ (x × k1) y mod p is g ^ (y × k2) x mod p, i.e., AB (k1) AB (k 2). Therefore, the corresponding intersection can be obtained by judging whether AB (k1) and AB (k2) are equal.
In step 106, all AB (k1) and AB (k2) are traversed, and a common set can be obtained. In the embodiment, the common set can be sent to the client, so that subsequent modeling and other data exploration are facilitated. The embodiment repeats the steps 103-105, so as to obtain the full digests AB (k1) and AB (k2) of all the colliding primary keys of the server side and the client side,
and step 107, removing the 'water blended' main key data according to the recorded fake data to obtain a real common set. And removing the gradient and the statistical information of the water mixing data during subsequent modeling or other data exploration.
The method utilizes the idea of a key agreement algorithm, directly adopts a power function modulo mode to obtain the abstract of the primary key, has the calculation speed far higher than that of double-blind encryption based on RSA, and utilizes the characteristics of the primitive root to reduce the same probability of two different information abstracts to the minimum (the repetition probability is 1/2^128, almost neglected).
In addition, in the embodiment, by using the differential privacy algorithm, the bank data cannot be accurately acquired even if the opposite party maliciously adds the clash key by doping the false data in the bank data, and the data security is further protected.
Example 2
Fig. 2 is a data processing method based on finite field key agreement and differential privacy according to embodiment 2 of the present invention, which includes a client part, where the client part may be implemented by a client that needs to be combined with a server, and specifically as shown in fig. 2, the method includes:
step 201, receiving p and g sent by the server side, and generating a 32-bit random number y.
And step 202, calculating by adopting a power function modulo algorithm to obtain a semi-abstract B (k2) of the collision primary key k 2.
The specific calculation process of this embodiment is as follows:
B(k2)＝g^(y*k2)mod p。
and 203, receiving A (k1) sent by the server, and calculating by adopting a power function modulo algorithm aiming at A (k1) to obtain a full summary AB (k1) of the collision primary key k1 by the server.
The specific calculation process of this embodiment includes:
AB(k1)＝A(k1)^y mod p＝g^(x*k1)*y mod p。
and step 204, sending the calculated AB (k1) and B (k2) to a server side to obtain a shared set, and obtaining shared set data.
Example 3
Fig. 3 is a schematic diagram of an interaction process between a server and a client according to a third embodiment of the present invention, which specifically includes the following steps:
step 301, a server generates a 128-bit large prime number p, calculates an original root g of the large prime number p, generates a 32-bit random number x, and sends p and g to a client;
step 302, the server side mixes forged main key data into the collision main key in a ratio of 1:1, records the data in a database of the server side, and ensures that the server side can identify which main keys are forged by the server side;
step 303, the server side calculates by adopting a power function modulo algorithm to obtain a semi-digest A (k1) of the key k1 collided by the server side, and sends A (k1) to the client side;
step 304, the client calculates to obtain a full summary AB (k1) of the main key k1 of the server end by adopting a power function modulo algorithm aiming at the received A (k1), calculates to obtain a half summary B (k2) of the main key k2 of the client end, and sends AB (k1) and B (k2) to the server end;
step 305, aiming at the received B (k2), the server side calculates by adopting a power function modulo algorithm to obtain a full summary AB (k2) of the client side clash key k 2;
and step 306, the server side traverses all the AB (k1) and the AB (k2) to obtain a common set, and the common set is sent to the client side for subsequent modeling and other data exploration.
And 307, removing the primary key data of 'water mixing' by the server side according to the stored fake records to obtain a real common set.
Example 4
Fig. 4 is a diagram of a data processing apparatus based on finite field key agreement and differential privacy according to a fourth embodiment of the present invention, which includes a server, where the server includes a communication module, a first calculation module, a first generation module, an adulteration module, an intersection module, and a storage module.
The first generation module is used for generating parameters required by the first calculation module for calculation.
The adulteration module is used for 'watering' the colliding main key, mixing the forged main key data into the real main key data and storing the forged record in the storage module.
The first calculation module adopts a power function modular algorithm to calculate the digest of the primary key after the water mixing and the key based on the digest of the primary key.
The intersection solving module is used for solving the intersection of the full abstract of the server-side collision primary key and the full abstract of the client-side collision primary key to obtain a common set, and removing 'water-mixed' primary key data from the common set according to the counterfeit records stored in the storage module to obtain a real common set;
the communication module is used for realizing data interaction between the server and external equipment (a client or other devices), sending the parameters generated by the first generation module and the data calculated by the first calculation module to the external equipment, and receiving the data transmitted by the external equipment.
The embodiment also provides a server (computer device) comprising the data processing apparatus based on the limited domain key agreement and the differential privacy.
Example 5
Fig. 5 is a data processing apparatus based on finite field key agreement and differential privacy according to a fifth embodiment of the present invention, which includes a client, where the client includes a transmission module, a second calculation module, and a second generation module.
The second generating module is used for generating parameters required by the calculation of the second calculating module;
and the second calculation module adopts a power function modulo algorithm to calculate the semi-abstract of the collision primary key of the second calculation module and the full abstract of the collision primary key of the server.
The transmission module is used for receiving the data sent by the server and transmitting the data calculated by the second calculation module to the server.
The embodiment also provides a computer device, which comprises the data processing device based on the limited domain key agreement and the differential privacy.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are merely exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.

Claims (10)

1. The data processing method based on limited domain key negotiation and differential privacy is characterized by comprising the server-side data processing steps, which specifically comprise the following steps:
acquiring related calculation parameters and sending the related calculation parameters to a client;
mixing water into the collision key, mixing forged key data, and recording the forged key data;
calculating a semi-abstract of the collision main key by adopting a power function modulo algorithm according to related calculation parameters, and sending the calculated semi-abstract of the collision main key to a client;
receiving a half abstract of a client-side collision main key and a full abstract of a server-side collision main key transmitted by a client side, and calculating to obtain the full abstract of the client-side collision main key according to the abstract of the client-side collision main key;
according to the full abstract of the server-side collision primary key and the full abstract of the client-side collision primary key, intersecting to obtain a common set;
the "water-blended" primary key data is removed from the consensus set, resulting in a true consensus set.
2. The data processing method based on finite field key agreement and differential privacy of claim 1, wherein the step of obtaining the relevant calculation parameters and sending the relevant calculation parameters to the client specifically comprises:
generating a 128-bit large prime number p and a 32-bit random number x, calculating an original root g of p, and sending p and g to a client;
wherein p satisfies the strong prime condition: i.e. a form where p is 2p '+ 1, where p' is a prime number.
3. The data processing method based on finite field key agreement and differential privacy as claimed in claim 1, wherein the step of mixing in forged primary key data is to mix in forged primary key data specifically in accordance with 1: 1.
4. The data processing method based on finite field key agreement and difference privacy as claimed in claim 2, wherein the step of computing the semi-digest of the collided primary key by using a power function modulo algorithm according to the related computation parameters specifically comprises:
A(k1)＝g^(x*k1)mod p；
where k1 denotes the server-side collision primary key, and a (k1) denotes the semi-digest of the server-side collision primary key.
5. The data processing method based on limited domain key agreement and differential privacy as claimed in claim 4, wherein the half digest of the client-side conflicting primary key and the full digest of the server-side conflicting primary key transmitted by the client-side are calculated by the following formula:
AB(k1)＝A(k1)^y mod p＝g^(x*k1)*y mod p；
B(k2)＝g^(y*k2)mod p；
wherein k2 represents the client-side collision primary key, B (k2) represents the half digest of the client-side collision primary key, AB (k1) represents the full digest of the server-side collision primary key, and y represents a 32-bit random number generated by the client;
the method for obtaining the full abstract of the client-side collision primary key through calculation of the half abstract of the client-side collision primary key specifically comprises the following steps:
AB(k2)＝B(k2)^x mod p＝g^(y*k2)*x mod p；
wherein AB (k2) represents the full digest of the client's clash primary key.
6. The data processing method based on the limited domain key negotiation and the differential privacy is characterized by comprising the client data processing steps, and specifically comprises the following steps:
receiving related calculation parameters sent by a server side and generating a 32-bit random number y;
calculating by adopting a power function modulo algorithm to obtain a semi-abstract of the clash key;
calculating to obtain a full abstract of the server side for colliding the main key according to the received half abstract of the server side for colliding the main key;
and sending the calculated semi-abstract of the colliding main key and the full abstract of the colliding main key of the server side to obtain a common set.
7. The data processing method based on finite field key agreement and differential privacy of claim 6, wherein the received related calculation parameters sent by the server side include a server-side generated large prime number p and an original root g thereof.
8. The data processing method based on the limited domain key agreement and the differential privacy as claimed in claim 7, wherein the step of calculating the semi-digest of the collided primary key by using the power function modulo algorithm specifically comprises:
B(k2)＝g^(y*k2)mod p；
wherein k2 represents the client-side collision primary key, and B (k2) represents the semi-abstract of the client-side collision primary key;
the step of obtaining the full abstract of the server end collision primary key through calculation according to the received half abstract of the server end collision primary key specifically comprises the following steps of:
AB(k1)＝A(k1)^y mod p；
wherein, A (k1) represents the half summary of the primary key of the server-side collision, and AB (k1) represents the full summary of the primary key of the server-side collision.
9. The data processing device based on the limited domain key agreement and the differential privacy is characterized by comprising a server side;
the server side comprises a communication module, a first calculation module, a first generation module, an adulteration module, an intersection module and a storage module;
the first generating module is used for generating parameters required by the first calculating module to calculate;
the adulteration module is used for mixing water in the colliding main key, mixing the forged main key data into the real main key data and storing the forged record in the storage module;
the first calculation module adopts a power function modulo algorithm to calculate a semi-abstract of the collision key after the water mixing and a full abstract of the collision key of the client;
the intersection solving module is used for solving the intersection of the full abstract of the server-side collision primary key and the full abstract of the client-side collision primary key to obtain a common set, and removing 'water-mixed' primary key data from the common set according to the counterfeit records stored in the storage module to obtain a real common set;
the communication module is used for realizing data interaction between the server side and the client side.
10. The data processing device based on the limited domain key agreement and the differential privacy is characterized by comprising a client;
the client comprises a transmission module, a second calculation module and a second generation module.
The second generating module is used for generating parameters required by the calculation of the second calculating module;
the second calculation module adopts a power function modulo algorithm to calculate the semi-abstract of the collision primary key of the second calculation module and the full abstract of the collision primary key of the server side.
The transmission module is used for receiving the data sent by the server and transmitting the data calculated by the second calculation module to the server.
CN202110742017.4A 2021-06-30 2021-06-30 Data processing method and device based on limited domain key agreement and differential privacy Pending CN113472533A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110742017.4A CN113472533A (en) 2021-06-30 2021-06-30 Data processing method and device based on limited domain key agreement and differential privacy

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110742017.4A CN113472533A (en) 2021-06-30 2021-06-30 Data processing method and device based on limited domain key agreement and differential privacy

Publications (1)

Publication Number Publication Date
CN113472533A true CN113472533A (en) 2021-10-01

Family

ID=77876919

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110742017.4A Pending CN113472533A (en) 2021-06-30 2021-06-30 Data processing method and device based on limited domain key agreement and differential privacy

Country Status (1)

Country Link
CN (1) CN113472533A (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101388770A (en) * 2008-10-20 2009-03-18 华为技术有限公司 Method, server and customer apparatus for acquiring dynamic host configuration protocol cipher
CN109639436A (en) * 2019-01-04 2019-04-16 平安科技（深圳）有限公司 The data property held verification method and terminal device based on salt figure
CN110210249A (en) * 2019-06-13 2019-09-06 上海富数科技有限公司 The system and method for track query function of hideing are realized based on data obfuscation
US10430605B1 (en) * 2018-11-29 2019-10-01 LeapYear Technologies, Inc. Differentially private database permissions system
CN111177762A (en) * 2019-12-30 2020-05-19 北京同邦卓益科技有限公司 Data processing method, device, server and federal learning system
CN111552978A (en) * 2020-04-21 2020-08-18 杭州趣链科技有限公司 Privacy protection set intersection solving method based on DH encryption and Hash table
CN113032840A (en) * 2021-05-26 2021-06-25 腾讯科技（深圳）有限公司 Data processing method, device, equipment and computer readable storage medium

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101388770A (en) * 2008-10-20 2009-03-18 华为技术有限公司 Method, server and customer apparatus for acquiring dynamic host configuration protocol cipher
US10430605B1 (en) * 2018-11-29 2019-10-01 LeapYear Technologies, Inc. Differentially private database permissions system
CN109639436A (en) * 2019-01-04 2019-04-16 平安科技（深圳）有限公司 The data property held verification method and terminal device based on salt figure
CN110210249A (en) * 2019-06-13 2019-09-06 上海富数科技有限公司 The system and method for track query function of hideing are realized based on data obfuscation
CN111177762A (en) * 2019-12-30 2020-05-19 北京同邦卓益科技有限公司 Data processing method, device, server and federal learning system
CN111552978A (en) * 2020-04-21 2020-08-18 杭州趣链科技有限公司 Privacy protection set intersection solving method based on DH encryption and Hash table
CN113032840A (en) * 2021-05-26 2021-06-25 腾讯科技（深圳）有限公司 Data processing method, device, equipment and computer readable storage medium

Similar Documents

Publication Publication Date Title
US10944575B2 (en) Implicitly certified digital signatures
Clark et al. A survey of authentication protocol literature
CN100388244C (en) Method for long-distance changing of communication cipher code
US10148422B2 (en) Implicitly certified public keys
EP2228942A1 (en) Securing communications sent by a first user to a second user
EP0661845B1 (en) System and method for message authentication in a non-malleable public-key cryptosystem
CN109309569A (en) The method, apparatus and storage medium of collaboration signature based on SM2 algorithm
CN1777097A (en) Enciphered data issuing method, enciphering device and programe, deciphering device and programe,
CN106549751A (en) Key exchange apparatus and method
CN107483191A (en) A kind of SM2 algorithm secret keys segmentation signature system and method
CN111698084B (en) Block chain-based concealed communication method
CN103155480B (en) Authenticate device and authentication method
CN115001775B (en) Data processing method, device, electronic equipment and computer readable storage medium
CN110855667A (en) Block chain encryption method, device and system
CN106603539B (en) Anti-desynchronization lightweight RFID bidirectional authentication method based on time factor
CN111371555A (en) Signature authentication method and system
CN107332658A (en) Interface realizing method and device based on chain type block chain technology
CN108270563A (en) A kind of method for interchanging data and system based on SM2 Encryption Algorithm
CN106487495B (en) Lightweight RFID authentication method based on integer chaos
CN113472533A (en) Data processing method and device based on limited domain key agreement and differential privacy
CN110419195A (en) Data managing method and system in IOT lightweight terminal environments based on proxy re-encryption
CN115550007A (en) Signcryption method and system with equivalence test function based on heterogeneous system
Taka Secure Communication by combined Diffe-Hellman key exchange Based AES Encryption and Arabic Text Steganography.
CN104469750A (en) Autonomous controllable mobile internet business method and device
Penubadi et al. Sustainable electronic document security: A comprehensive framework integrating encryption, digital signature and watermarking algorithms

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20211001

RJ01 Rejection of invention patent application after publication