CN114282251A - Data intersection solving method and system and data encryption method - Google Patents
Data intersection solving method and system and data encryption method Download PDFInfo
- Publication number
- CN114282251A CN114282251A CN202111629671.0A CN202111629671A CN114282251A CN 114282251 A CN114282251 A CN 114282251A CN 202111629671 A CN202111629671 A CN 202111629671A CN 114282251 A CN114282251 A CN 114282251A
- Authority
- CN
- China
- Prior art keywords
- data
- intersection
- hash
- key
- provider
- 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
Links
Images
Landscapes
- Storage Device Security (AREA)
Abstract
The application discloses a method and a system for solving intersection of data and a data encryption method, wherein the method comprises the following steps: receiving first splicing data spliced by a data requester by using a secret key and a verification data set needing verification, and generating a first hash set; receiving a second hash set generated by the data provider by using a second splicing data spliced by the key and the query data set corresponding to the verification data set; matching in the second hash set by using the first hash set to obtain an intersection of the first hash set and the second hash set; and sending the intersection to the data requester, wherein the key is obtained by pre-negotiation between the data requester and the data provider. When the hash calculation is carried out, the hash calculation is carried out on the data set, meanwhile, the key obtained by the data provider and the data requester through pre-negotiation is added, the hash calculation is carried out on the key and the data set together, the situation that the hash set is cracked in a hash collision mode can be avoided, and the safety is improved.
Description
Technical Field
The invention relates to the field of data security, in particular to a method and a system for solving intersection of data and a data encryption method.
Background
The technical problem to be solved by the invention is as follows: under the large background of trying to break through a digital island in order to accelerate the orderly sharing of data, the problem that the data need to be shared and the intersection of the data needs to be solved under the scene of privacy protection is solved.
In recent years, the informatization process is deepened, the data growth speed is increased, and data becomes an important asset. The data can obtain the huge value of the data through sharing interaction, and a data island is broken through. Privacy Set Intersection (PSI) belongs to the specific application problem in the field of secure multi-party computing, has important theoretical significance and strong application value, and can solve a plurality of scene problems in breaking a data island, such as: in financial wind control, whether to borrow more money or not is an important wind control index. Through the PSI scheme, the bank A can know which of the client lists have multi-head loans without revealing client information to the bank B.
Therefore, a more secure method for intersection of three-party data is needed.
Disclosure of Invention
In view of the above, the present invention provides a method, a system and a method for data intersection, which are safer. The specific scheme is as follows:
a method of intersection of data, comprising:
receiving first splicing data spliced by a data requester by using a secret key and a verification data set needing verification, and generating a first hash set;
receiving a second hash set generated by a data provider by using the second splicing data spliced by the key and the query data set corresponding to the verification data set;
matching in the second hash set by using the first hash set to obtain an intersection of the first hash set and the second hash set;
sending the intersection to the data requester so that the data requester can know the data in the verification data set owned by the data provider;
the key is obtained by pre-negotiating between the data requester and the data provider.
Optionally, the process of receiving the second hash set generated by the data provider using the key and the query data set corresponding to the verification data set includes:
and receiving the data provider, and processing the second hash set by using the Bloom Filter to obtain the Bitset corresponding to the second hash set.
Optionally, the process of obtaining an intersection between the first hash set and the second hash set by using the first hash set to perform matching in the second hash set includes:
and matching the first Hash set with the Bitset to obtain the intersection.
Optionally, after sending the intersection to the data requestor, the method further includes:
sending the intersection to the data provider so that the data provider finds the intersection data corresponding to the intersection;
receiving a ciphertext obtained by encrypting the intersection data by the data provider by using the key;
and sending the ciphertext to the data requester so that the data requester decrypts the ciphertext by using the key to obtain the intersection data.
The invention also discloses a data encryption method, which is applied to a data request party and comprises the following steps:
splicing by using a secret key and a verification data set needing to be verified to obtain first spliced data;
performing hash calculation by using the first splicing data to generate a first hash set;
sending the first hash set to a data transaction center;
receiving the intersection sent by the data transaction center;
the key is obtained by pre-negotiating between the data requester and the data provider.
Optionally, the method further includes:
receiving a ciphertext sent by the data transaction center and encrypted by the data provider by using the key;
and decrypting the ciphertext by using the secret key to obtain intersection data.
The invention also discloses a data encryption method, which is applied to a data provider and comprises the following steps:
splicing the key and the query data set corresponding to the verification data set to obtain second spliced data;
performing hash calculation by using the second splicing data to generate a second hash set;
sending the second hash set to a data transaction center;
the key is obtained by pre-negotiating between a data requester and the data provider.
Optionally, the process of generating the second hash set by using the key and the query data set corresponding to the verification data set includes:
processing the second hash set by using a Bloom Filter to obtain a Bitset corresponding to the second hash set;
the process of sending the second hash set to a data transaction center includes:
and sending the Bitset to the data transaction center.
Optionally, the method further includes:
receiving the intersection sent by the data transaction center;
searching intersection data corresponding to the intersection;
encrypting the intersection data by using the key to obtain an encrypted ciphertext;
and sending the ciphertext to the data transaction center.
The invention also discloses a data intersection solving system, which is applied to a data transaction center and comprises the following components:
the requester receiving module is used for receiving first splicing data which are spliced by a data requester by using a secret key and a verification data set needing verification, and generating a first hash set;
the provider receiving module is used for receiving a second hash set generated by the data provider by using the second splicing data obtained by splicing the key and the query data set corresponding to the verification data set;
the intersection solving module is used for matching in the second hash set by using the first hash set to obtain an intersection of the first hash set and the second hash set;
the first intersection sending module is used for sending the intersection to the data requester so that the data requester can know the data in the verification data set owned by the data provider;
the key is obtained by pre-negotiating between the data requester and the data provider.
In the invention, the method for solving the intersection of the data comprises the following steps: receiving first splicing data spliced by a data requester by using a secret key and a verification data set needing verification, and generating a first hash set; receiving a second hash set generated by the data provider by using a second splicing data spliced by the key and the query data set corresponding to the verification data set; matching in the second hash set by using the first hash set to obtain an intersection of the first hash set and the second hash set; sending the intersection to a data requester so that the data requester can know data in a verification data set owned by a data provider; the key is obtained by pre-negotiating between the data requester and the data provider.
When the hash calculation is carried out, the hash calculation is carried out on the data set, meanwhile, the key obtained by the data provider and the data requester through pre-negotiation is added, and the hash calculation is carried out on the key and the data set together, so that the hash set can be prevented from being cracked in a hash collision mode, and the safety is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
FIG. 1 is a schematic flow chart of a method for solving intersection of data according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart of another data intersection method disclosed in the embodiment of the present invention;
FIG. 3 is a schematic diagram of another three-party process for intersection data calculation according to the embodiment of the present invention;
FIG. 4 is a schematic diagram of a data exchange process according to an embodiment of the present invention;
FIG. 5 is a schematic flow chart of a data encryption method according to an embodiment of the present invention;
FIG. 6 is a flow chart of another data encryption method disclosed in the embodiment of the present invention;
FIG. 7 is a schematic diagram illustrating a procedure of generating and sending intersection data according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a data intersection solving system disclosed in the embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The embodiment of the invention discloses a method for solving intersection of data, which is applied to a data transaction center and is shown in figure 1, and the method comprises the following steps:
s11: and receiving first splicing data spliced by the data requester by using the key and the verification data set needing verification to generate a first hash set.
Specifically, the key is obtained by pre-negotiating between the data requester and the data provider, and the data requesterNegotiating a pair of keys k between an issuer and a data providerABThe method can be obtained through physical routes, by means of public key cryptography or by means of a DH key agreement algorithm and the like.
Specifically, the data requester needs to determine whether the data provider has part or all of the data in the verification data set, so as to determine whether to subsequently continue to acquire the required data from the data provider, and therefore, the data requester needs to send the verification data set to a third party, so as to perform determination.
For example, a data requestor possesses a verification data set
And the data set S is to be validatedBIntersection with query data of data provider, data requestor for all bi∈SACalculation of bi'＝H(bi||kAB) And obtaining a first hash set, wherein H () is a secure hash algorithm.
Specifically, before the first hash set is generated, the verification data set does not need to be encrypted by using the key, and only hash calculation is performed on the key and the verification data together.
S12: and receiving a second hash set generated by the data provider by using the second splicing data spliced by the key and the query data set corresponding to the verification data set.
Specifically, after receiving the first hash set sent by the data requestor, the data provider may be notified that the data requestor initiates data intersection verification, and the data provider is required to provide a query data set corresponding to the verification data set for data intersection verification.
Specifically, after the data provider knows that data intersection verification needs to be performed, the data provider also needs to perform splicing by using the key and the query data set corresponding to the verification data set to obtain second spliced data, and then performs hash calculation on the second spliced data to generate a second hash set, and sends the second hash set to a third party so as to perform intersection verification subsequently at the third party.
For example, a data provider owns a data set SA＝{a0,a1,…,anAFor all a }i∈SACalculate hi＝H(ai||kAB) And obtaining a second hash set.
S13: and matching the first hash set in the second hash set to obtain an intersection of the first hash set and the second hash set.
Specifically, after receiving the first hash set and the second hash set, the intersection matching operation may be performed, where the amount of the second hash combined data is greater than that of the first hash set, and it is also necessary to determine which data in the first hash set is included in the second hash set by using the first hash set, so that the first hash set is used to perform matching in the second hash set, and the intersection between the first hash set and the second hash set is obtained.
Specifically, the intersection includes data in which the first hash set and the second hash set in the hash form coincide.
S14: and sending the intersection to the data requester so that the data requester can know the data in the verification data set owned by the data provider.
Specifically, after the intersection matching is completed, the intersection can be sent to the data requester, so that the data requester can know that the data provider has the data in the verification data set according to the intersection, and the data intersection judgment is completed.
Therefore, when the hash calculation is carried out, the hash calculation is carried out on the data set, the key obtained by the data provider and the data requester through pre-negotiation is added, the hash calculation is carried out on the key and the data set together, the hash set can be prevented from being cracked in a hash collision mode, and the safety is improved.
The embodiment of the invention discloses a specific data intersection solving method, and compared with the previous embodiment, the embodiment further explains and optimizes the technical scheme. Referring to fig. 2 and 3, specifically:
s21: a first hash set generated by a data requestor using a key and a verification data set requiring verification is received.
For example, in FIG. 3 the data requestor sends a first set of hashes { b }i' } to a data transaction center.
S22: and receiving the Bitset corresponding to the second hash set, which is obtained by processing the second hash set by the data provider by using the Bloom Filter.
Specifically, the second hash set of the data provider includes a large amount of data, for example, the data requester needs to query part of the bank a and whether the information of the customer is recorded in the data provider bank B, the bank a only needs to provide the first hash set including the information of the specified customer, the data amount is small, the bank B does not know that the bank a needs to query the information of the customer, and only knows that the customer information needs to be queried, so the bank B needs to package all the customer information grasped by the bank B to generate the second hash set, so that the situation that the data are all queried and have no missing can be avoided, but the data amount of the second hash set is huge, the data transmission is slow, the matching time is increased, and the efficiency is reduced. For this reason, in order to solve this problem, the data provider uses Bloom Filter technology to process the second hash set, so as to obtain a Bitset with a smaller data size corresponding to the second hash set, which is equivalent to performing data compression on the second hash set, thereby increasing the transmission speed of sending data to the data transaction center, for example, in fig. 3, the data provider sends Bitset (bf) to the data transaction center.
S23: and matching the first Hash set with the Bitset to obtain an intersection.
Specifically, the first hash set is used to generate no corresponding Bitset based on Bloom Filter, only the positions on the Bitset corresponding to the hash values in the first hash set are calculated, whether the positions on the Bitset corresponding to the hash values in the first hash set are already located on the data already recorded on the Bitset corresponding to the second hash set is judged, if yes, it is determined that the same data exist on the second hash set, and if no data exists on the Bitset, it is determined that the hash values corresponding to the positions in the first hash set do not exist on the second hash set, so as to obtain the intersection of the first hash set and the second hash set.
S24: and sending the intersection to the data requester so that the data requester can know the data in the verification data set owned by the data provider.
In particular, for example, the data exchange center returns the presence of b in FIG. 3i' to the data requestor.
The key is obtained by pre-negotiating between the data requester and the data provider.
Specifically, as shown in fig. 4, after the data requester receives the intersection, it is ready to receive the required intersection data, and meanwhile, the data provider also needs to make the intersection data according to the intersection and send the intersection data to the data requester, where the specific process includes S31 to S33; wherein the content of the first and second substances,
s31: and sending the intersection to the data provider so that the data provider finds the intersection data corresponding to the intersection.
Specifically, a service logic may be set in the data center in advance, that is, after the intersection is sent to the data requester, the intersection is sent to the data provider at the same time, so that the data provider finds the intersection data corresponding to the intersection.
For example, the data exchange returns h in FIG. 3i' to the data provider.
S32: and receiving a ciphertext obtained by encrypting the intersection data by the data provider by using the key.
Specifically, the data provider encrypts the intersection data by using the key to obtain an encrypted ciphertext, so that data leakage caused by direct reading of the plaintext after the data is transmitted to the data transaction center can be avoided, and the security of the data is ensured by encryption.
S33: and sending the ciphertext to the data requester so that the data requester decrypts the ciphertext by using the key to obtain the intersection data.
Specifically, the data transaction center sends the received ciphertext to the data requester to complete all data transaction processes, and data are encrypted in the whole process of the data transaction process, so that the problem of data leakage is solved.
Correspondingly, the embodiment of the present invention further discloses a data encryption method, which is applied to a data requester, and as shown in fig. 5, the method includes:
s41: splicing by using a secret key and a verification data set needing to be verified to obtain first spliced data;
s42: performing hash calculation by using the first splicing data to generate a first hash set;
s43: sending the first hash set to a data transaction center;
s44: receiving an intersection sent by a data transaction center;
the key is obtained by pre-negotiating between the data requester and the data provider.
Specifically, after the data request party needs to perform data intersection matching, a first hash set generated by using the key and the verification data set needing to be verified can be used, and the first hash set is sent to the data transaction center, so that the first hash set performs intersection solving in the data transaction center.
Therefore, when the hash calculation is carried out, the hash calculation is carried out on the data set, the key obtained by the data provider and the data requester through pre-negotiation is added, the hash calculation is carried out on the key and the data set together, the hash set can be prevented from being cracked in a hash collision mode, and the safety is improved.
Specifically, after receiving a ciphertext sent by the data transaction center and encrypted by the data provider using the key, the ciphertext can be decrypted using the same key stored locally, so as to obtain intersection data.
In addition, an embodiment of the present invention further discloses a data encryption method, which is shown in fig. 6 and applied to a data provider, and the method includes:
s51: splicing the key and the query data set corresponding to the verification data set to obtain second spliced data;
s52: performing hash calculation by using the second splicing data to generate a second hash set;
s53: sending the second hash set to a data transaction center;
the key is obtained by pre-negotiating between the data requester and the data provider.
Therefore, when the hash calculation is carried out, the hash calculation is carried out on the data set, the key obtained by the data provider and the data requester through pre-negotiation is added, the hash calculation is carried out on the key and the data set together, the hash set can be prevented from being cracked in a hash collision mode, and the safety is improved.
Specifically, in order to reduce the data transmission amount, in step S51, a process of generating a second hash set by using the key and the query data set corresponding to the verification data set may specifically be to process the second hash set by using a Bloom Filter, so as to obtain a Bitset corresponding to the second hash set; accordingly, the process of S52 sending the second hash set to the data transaction center is sending a Bitset to the data transaction center.
Further, after performing intersection matching, the data provider may also send intersection data obtained after the intersection matching to the data requester, so that the data requester obtains desired data, and the specific process may be as shown in fig. 7, including S61 to S64; wherein the content of the first and second substances,
s61: receiving an intersection sent by a data transaction center;
s62: searching intersection data corresponding to the intersection;
s63: encrypting the intersection data by using the key to obtain an encrypted ciphertext;
s64: and sending the ciphertext to a data transaction center.
Specifically, the data provider receives the intersection comprising the overlapped part of the verification data set and the query data set, searches for corresponding intersection data by using the intersection, for example, the intersection comprises the ID of the user required by the data requester, the data provider can find other personal information of the corresponding user, namely, the intersection data, according to the ID of the user, encrypt the intersection data by using the key to obtain the encrypted ciphertext, and then send the encrypted ciphertext to the data transaction center to complete the whole data exchange process.
In addition, the embodiment of the invention also discloses a data intersection solving system, which is applied to a data transaction center and comprises the following components:
the requester receiving module 11 is configured to receive a first hash set generated by a data requester by using a first concatenation data obtained by concatenating a secret key and a verification data set to be verified;
the provider receiving module 12 is configured to receive a second hash set generated by the data provider by using the key and second concatenation data obtained by concatenating the query data set corresponding to the verification data set;
the intersection solving module 13 is configured to perform matching in the second hash set by using the first hash set to obtain an intersection of the first hash set and the second hash set;
a first intersection sending module 14, configured to send an intersection to a data requestor, so that the data requestor knows data in a verification data set owned by a data provider;
the key is obtained by pre-negotiating between the data requester and the data provider.
Specifically, the provider receiving module 12 is specifically configured to receive the data provider, and process the second hash set by using a Bloom Filter, to obtain a Bitset corresponding to the second hash set.
Specifically, the intersection solving module 13 is specifically configured to match the first hash set with the Bitset to obtain an intersection.
Specifically, the method may further include:
the second intersection sending module is used for sending the intersection to the data provider so that the data provider can find the intersection data corresponding to the intersection;
the ciphertext receiving module is used for receiving a ciphertext obtained by encrypting the intersection data by the data provider by using the key;
and the ciphertext sending module is used for sending the ciphertext to the data requester so that the data requester decrypts the ciphertext by using the key to obtain the intersection data.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The technical content provided by the present invention is described in detail above, and the principle and the implementation of the present invention are explained in this document by applying specific examples, and the above description of the examples is only used to help understanding the method of the present invention and the core idea thereof; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
Claims (10)
1. A data intersection method is applied to a data transaction center and comprises the following steps:
receiving first splicing data spliced by a data requester by using a secret key and a verification data set needing verification, and generating a first hash set;
receiving a second hash set generated by a data provider by using the second splicing data spliced by the key and the query data set corresponding to the verification data set;
matching in the second hash set by using the first hash set to obtain an intersection of the first hash set and the second hash set;
sending the intersection to the data requester so that the data requester can know the data in the verification data set owned by the data provider;
the key is obtained by pre-negotiating between the data requester and the data provider.
2. The data intersection method of claim 1, wherein the receiving a second hash set generated by a data provider using the key and a query data set corresponding to the validation data set comprises:
and receiving the data provider, and processing the second hash set by using the Bloom Filter to obtain the Bitset corresponding to the second hash set.
3. The data intersection method according to claim 2, wherein the step of matching in the second hash set by using the first hash set to obtain the intersection of the first hash set and the second hash set comprises:
and matching the first Hash set with the Bitset to obtain the intersection.
4. The data intersection method of any one of claims 1 to 3, wherein after sending the intersection to the data requestor, further comprising:
sending the intersection to the data provider so that the data provider finds the intersection data corresponding to the intersection;
receiving a ciphertext obtained by encrypting the intersection data by the data provider by using the key;
and sending the ciphertext to the data requester so that the data requester decrypts the ciphertext by using the key to obtain the intersection data.
5. A data encryption method, applied to a data requester, comprising:
splicing by using a secret key and a verification data set needing to be verified to obtain first spliced data;
performing hash calculation by using the first splicing data to generate a first hash set;
sending the first hash set to a data transaction center;
receiving the intersection sent by the data transaction center;
the key is obtained by pre-negotiating between the data requester and the data provider.
6. The data encryption method of claim 5, further comprising:
receiving a ciphertext sent by the data transaction center and encrypted by the data provider by using the key;
and decrypting the ciphertext by using the secret key to obtain intersection data.
7. A data encryption method is applied to a data provider and comprises the following steps:
splicing the key and the query data set corresponding to the verification data set to obtain second spliced data;
performing hash calculation by using the second splicing data to generate a second hash set;
sending the second hash set to a data transaction center;
the key is obtained by pre-negotiating between a data requester and the data provider.
8. The data encryption method of claim 7, wherein the process of generating the second hash set using the key and the query data set corresponding to the validation data set comprises:
processing the second hash set by using a Bloom Filter to obtain a Bitset corresponding to the second hash set;
the process of sending the second hash set to a data transaction center includes:
and sending the Bitset to the data transaction center.
9. The data encryption method according to claim 7 or 8, further comprising:
receiving the intersection sent by the data transaction center;
searching intersection data corresponding to the intersection;
encrypting the intersection data by using the key to obtain an encrypted ciphertext;
and sending the ciphertext to the data transaction center.
10. A data intersection system is applied to a data transaction center and comprises:
the requester receiving module is used for receiving first splicing data which are spliced by a data requester by using a secret key and a verification data set needing verification, and generating a first hash set;
the provider receiving module is used for receiving a second hash set generated by the data provider by using the second splicing data obtained by splicing the key and the query data set corresponding to the verification data set;
the intersection solving module is used for matching in the second hash set by using the first hash set to obtain an intersection of the first hash set and the second hash set;
the first intersection sending module is used for sending the intersection to the data requester so that the data requester can know the data in the verification data set owned by the data provider;
the key is obtained by pre-negotiating between the data requester and the data provider.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111629671.0A CN114282251A (en) | 2021-12-28 | 2021-12-28 | Data intersection solving method and system and data encryption method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111629671.0A CN114282251A (en) | 2021-12-28 | 2021-12-28 | Data intersection solving method and system and data encryption method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114282251A true CN114282251A (en) | 2022-04-05 |
Family
ID=80877267
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111629671.0A Pending CN114282251A (en) | 2021-12-28 | 2021-12-28 | Data intersection solving method and system and data encryption method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114282251A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115065459A (en) * | 2022-06-13 | 2022-09-16 | 青岛大学 | Multi-party privacy set intersection method, device, equipment and storage medium |
-
2021
- 2021-12-28 CN CN202111629671.0A patent/CN114282251A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115065459A (en) * | 2022-06-13 | 2022-09-16 | 青岛大学 | Multi-party privacy set intersection method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112367169B (en) | Data encryption and decryption method, device, equipment and storage medium | |
| US10903976B2 (en) | End-to-end secure operations using a query matrix | |
| EP3639232B1 (en) | Anti-replay attack authentication protocol | |
| CN106664206B (en) | Efficient method for authenticated communication | |
| WO2022126967A1 (en) | Blockchain-based data supervision method, apparatus and device, and storage medium | |
| CN111130803B (en) | Method, system and device for digital signature | |
| US20180212753A1 (en) | End-To-End Secure Operations Using a Query Vector | |
| CN111431713B (en) | Private key storage method and device and related equipment | |
| US20100070766A1 (en) | Authentication Method, Client, Server And System | |
| US20130028419A1 (en) | System and a method for use in a symmetric key cryptographic communications | |
| CN114024710A (en) | Data transmission method, device, system and equipment | |
| WO2020065633A1 (en) | Method, user device, management device, storage medium and computer program product for key management | |
| CN110677382A (en) | Data security processing method, device, computer system and storage medium | |
| CN113674077A (en) | Consumption credit risk prevention method, system, equipment and storage medium | |
| CN110942382A (en) | Electronic contract generating method and device, computer equipment and storage medium | |
| CN116340331A (en) | Large instrument experimental result evidence-storing method and system based on blockchain | |
| CN114282251A (en) | Data intersection solving method and system and data encryption method | |
| CN110048852B (en) | Quantum communication service station digital signcryption method and system based on asymmetric key pool | |
| KR20070083087A (en) | Method for encryption of finance transaction data | |
| CN109412799B (en) | System and method for generating local key | |
| KR100384183B1 (en) | End-to-end data encryption/decryption method and device for mobile data communication | |
| CN114896616A (en) | Policy processing method and system based on block chain | |
| CN114553557A (en) | Key calling method, key calling device, computer equipment and storage medium | |
| CN113065146A (en) | Homomorphic encryption method for block chain data protection | |
| Altarawneh | A strong combination of cryptographic techniques to secure cloud-hosted 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 |