CN117640066B - Multi-user joint encryption and decryption method based on homomorphic encryption - Google Patents
Multi-user joint encryption and decryption method based on homomorphic encryption Download PDFInfo
- Publication number
- CN117640066B CN117640066B CN202410109715.4A CN202410109715A CN117640066B CN 117640066 B CN117640066 B CN 117640066B CN 202410109715 A CN202410109715 A CN 202410109715A CN 117640066 B CN117640066 B CN 117640066B
- Authority
- CN
- China
- Prior art keywords
- decryption
- ciphertext
- user side
- user terminal
- execution
- 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
- 238000000034 method Methods 0.000 title claims abstract description 27
- 238000004364 calculation method Methods 0.000 claims abstract description 7
- 239000011159 matrix material Substances 0.000 claims description 18
- 238000006467 substitution reaction Methods 0.000 claims description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005336 cracking Methods 0.000 description 1
- 238000003745 diagnosis Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000012502 risk assessment Methods 0.000 description 1
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Abstract
The invention discloses a multi-user joint encryption and decryption method based on homomorphic encryption, which comprises the following steps: calculating to obtain a secret key of each user, wherein the secret key comprises a location base and a public module base; the first execution user side encrypts self plaintext information based on a self secret key to obtain a first execution user side ciphertext; the current execution user side (the rest execution user side except the first execution user side and the last execution user side) obtains the current execution user side ciphertext based on the last execution user side ciphertext, self plaintext information and self secret key; finally, the executing user side obtains a final ciphertext based on the last executing user side ciphertext, self plaintext information and self secret key; and each decryption user end sequentially decrypts the final ciphertext by using the own position base to obtain a final decryption result. The invention realizes homomorphic encryption calculation under the multi-user scene on the premise of ensuring the data security.
Description
Technical Field
The invention relates to the technical field of information security, in particular to a multi-user combined encryption and decryption method based on homomorphic encryption.
Background
Cryptographic techniques are techniques for encrypting important confidential information using cryptographic algorithms to prevent cracking of the confidential information in an information system. Generally, a cryptographic technique necessarily involves encryption and decryption. The advent of new cryptographic techniques, particularly those represented by homomorphic encryption, has enabled operations under ciphertext. Homomorphic operation comprises two basic operations of addition homomorphic operation and multiplication homomorphic operation, and the basic operations correspond to addition operation and multiplication operation in encryption and decryption processes respectively. Through homomorphic operation, the data can be encrypted and then operated, and then decrypted to obtain the result of the original data, so that the safety and privacy of the data are protected.
The homomorphic encryption technology of multiple users is an extension of the common homomorphic operation technology, and the sharing and calculation of data can be realized under the condition that the user data is not exposed by using the homomorphic encryption technology of multiple users, so that the private data of the users is protected. At present, the homomorphic encryption technology of multiple users has wide application prospect in multiple fields. For example, healthcare institutions need to share patient medical record information for diagnosis and treatment by doctors, banks need to share customer transaction data for risk assessment and credit rating, etc.
Therefore, how to provide a homomorphic encryption-based joint encryption and decryption method suitable for multiple users is a problem that needs to be solved by those skilled in the art.
Disclosure of Invention
In view of the above, the present invention aims to provide a multi-user joint encryption and decryption method based on homomorphic encryption.
In order to achieve the above purpose, the present invention adopts the following technical scheme:
a multi-user joint encryption and decryption method based on homomorphic encryption comprises the following steps:
s1: obtaining the position base of each user terminal based on the key of each user terminal;
s2: based on the position base and the public mode base of each user terminal, obtaining the secret key of each user terminal;
s3: determining the execution sequence of each user side according to homomorphic operation functions to be executed;
the first execution user side encrypts self plaintext information based on a self secret key to obtain a first execution user side ciphertext, and sends the first execution user side ciphertext to the second execution user side;
s4: the rest executing user terminals except the first executing user terminal and the last executing user terminal all carry out the following operations:
the current execution user side obtains a current execution user side ciphertext based on a previous execution user side ciphertext, self plaintext information and a self secret key, and sends the current execution user side ciphertext to a next execution user side;
s5: finally, the executing user side obtains a final ciphertext based on the last executing user side ciphertext, self plaintext information and self secret key, and sends the final ciphertext to all executing user sides;
s6: determining decryption sequence of each user terminal;
and each decryption user end sequentially decrypts the final ciphertext by using the own position base to obtain a final decryption result.
Preferably, S1 further comprises:
based on user terminal U i Key userky i And random numbers to generate a user terminal U i Is a position group W of (2) i ={W i [1],W i [2],W i [j],...,W i [n]},0≤W i [j]< t, n represents a positional group W i The number of elements included, t, represents the number of redundancy items in a redundancy vector.
Preferably, S2 further comprises:
common mode base b= { B 1 ,b 2 ,…,b n Obtained by negotiations at each client, b 1 < b 2 < … < b n And b 1 ,b 2 ,…,b n Every two are mutually equal.
Preferably, S3 further comprises:
s31: first execution user terminal U 1 By itself plain text information X 1 Calculated as information P to be encrypted 1 =X 1 *amp+e 1 The method comprises the steps of carrying out a first treatment on the surface of the Wherein amp represents the magnification, e 1 Representing random positive integer noise;
s32: based on the formulaCalculating to obtain first execution user side ciphertext；W i [j]Representing the position group W i R represents a redundancy value.
Preferably, S4 further comprises:
s41: currently executing user terminal U i By itself plain text information X i Calculated as information P to be encrypted i =X i *amp+e i； Wherein amp represents the magnification, e i Representing random positive integer noise;
s42: information P to be encrypted i Ciphertext C of user side with last execution i-1 Performing addition/multiplication alignment operation to obtain aligned P i With C after alignment i-1 ；
S43: p after alignment i With C after alignment i-1 Substitution formulaPerforming replacement operation to obtain a current execution user terminal U i Ciphertext (ciphertext)Wherein c i-1 [j][k]Representing post-alignment C i-1 ⊚ of the sequence represent homomorphic addition or homomorphic multiplication.
Preferably, S6 further comprises:
the rest decryption clients except the final decryption client all perform the following operations:
current decryption user terminal U i By self-position basis W i Decrypting the i-1 th decryption matrixPerforming reverse permutation operation and adding a random number +.>Obtaining the ith decryption matrix；
Ith decryption matrix Z i The specific calculation formula of (2) is as follows:；
current decryption user terminal U i Decrypting the ith decryption matrix Z i Send to the next decryption user terminal U i+1 ；
Wherein, the 0 th decryption matrix Z 0 For the final ciphertext C m 。
Preferably, S6 further comprises:
finally, decrypting the user's own position base W m Decrypting the m-1 th decryption matrix Z m-1 And extracting the real modulus component in the model, and decrypting by using the Chinese remainder theorem to obtain an intermediate result T.
Preferably, S6 further comprises:
based on the formulaCalculating a final decryption result corresponding to the intermediate result T; wherein order is m Representing the final ciphertext C m To the power of the amp.
Compared with the prior art, the invention discloses a multi-user combined encryption and decryption method based on homomorphic encryption, which has the following beneficial technical effects:
1) The invention can support independent encryption among a plurality of user terminals, and each user terminal uses own secret key to generate secret keys which are independent of other user terminals;
2) The size of the ciphertext obtained by encryption is irrelevant to the number of users, the compactness requirement of homomorphic encryption is met, and the storage cost of the ciphertext is greatly reduced.
3) The invention realizes homomorphic encryption calculation under the multi-user scene on the premise of ensuring the data security.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required to be used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only embodiments of the present invention, and that other drawings can be obtained according to the provided drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a multi-user joint encryption and decryption method based on homomorphic encryption.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
As shown in fig. 1, the embodiment of the invention discloses a multi-user joint encryption and decryption method based on homomorphic encryption, which comprises the following steps:
s1: obtaining the position base of each user terminal based on the key of each user terminal;
s2: based on the position base and the public mode base of each user terminal, obtaining the secret key of each user terminal;
s3: determining the execution sequence of each user side according to homomorphic operation functions to be executed;
the first execution user side encrypts self plaintext information based on a self secret key to obtain a first execution user side ciphertext, and sends the first execution user side ciphertext to the second execution user side;
s4: the rest executing user terminals except the first executing user terminal and the last executing user terminal all carry out the following operations:
the current execution user side obtains a current execution user side ciphertext based on a previous execution user side ciphertext, self plaintext information and a self secret key, and sends the current execution user side ciphertext to a next execution user side;
s5: finally, the executing user side obtains a final ciphertext based on the last executing user side ciphertext, self plaintext information and self secret key, and sends the final ciphertext to all executing user sides;
s6: determining decryption sequence of each user terminal;
and each decryption user end sequentially decrypts the final ciphertext by using the own position base to obtain a final decryption result.
In one embodiment, S1 further comprises:
based on user terminal U i Key userky i And random numbers to generate a user terminal U i Is a position group W of (2) i ={W i [1],W i [2],W i [j],...,W i [n]},0≤W i [j]< t, n represents a positional group W i The number of elements included, t, represents the number of redundancy items in a redundancy vector.
In this embodiment, it is assumed that the ue participating in homomorphic operation includes ue U 1 User terminal U 2 And user terminal U 3 User terminal U 1 Possessing self plaintext information X 1 User terminal U 2 Possessing self plaintext information X 2 User terminal U 3 Possessing self plaintext information X 3 Now, it is necessary to calculate (X 1 +X 2 ）*X 3 Results of (2);
in this embodiment, t=2, n=6, and the ue U 1 Is set as W 1 ={W 1 [1],W 1 [2],W 1 [3],W 1 [4],W 1 [5],W 1 [6]} = {0,1,0,1,0,1}; user terminal U 2 Is set as W 2 ={W 2 [1],W 2 [2],W 2 [3],W 2 [4],W 2 [5],W 2 [6]} = {1,1,1,0,0,0}; user terminal U 3 Is set as W 3 ={W 3 [1],W 3 [2],W 3 [3],W 3 [4],W 3 [5],W 3 [6]}={1,1,0,0,1,1}。
In a certain embodiment, S2 further comprises:
common mode base b= { B 1 ,b 2 ,…,b n Obtained by negotiations at each client, b 1 < b 2 < … < b n And b 1 ,b 2 ,…,b n Every two are mutually equal.
In one embodiment, S3 further comprises:
s31: first execution user terminal U 1 By itself plain text information X 1 Calculated as information P to be encrypted 1 =X 1 *amp+e 1 The method comprises the steps of carrying out a first treatment on the surface of the Wherein amp represents the magnification, e 1 Representing random positive integer noise;
s32: based on the formulaCalculating to obtain first execution user side ciphertext，W i [j]Representing the position group W i R represents a redundancy value.
In the present embodiment of the present invention, in the present embodiment,
；
first execution user terminal U 1 Ciphertext C of first execution user side 1 Is sent to a second execution user terminal U 2 ；
In one embodiment, S4 further comprises:
s41: currently executing user terminal U i By itself plain text information X i Calculated as information P to be encrypted i =X i *amp+e i；
S42: information P to be encrypted i Ciphertext C of user side with last execution i-1 Performing addition/multiplication alignment operation to obtain aligned P i With C after alignment i-1 ；
S43: p after alignment i With C after alignment i-1 Substitution formulaPerforming replacement operation to obtain a current execution user terminal U i Ciphertext (ciphertext)Wherein c i-1 [j][k]Representing post-alignment C i-1 ⊚ of the sequence represent homomorphic addition or homomorphic multiplication.
In this embodiment:
second execution user terminal U 2 By itself plain text information X 2 Calculated as information P to be encrypted 2 =X 2 *amp+e 2 The method comprises the steps of carrying out a first treatment on the surface of the Wherein amp represents the magnification, e 2 Representing random positive integer noise;
information P to be encrypted 2 Ciphertext C of first execution user side 1 Performing addition alignment operation to obtain aligned P 2 With C after alignment 1 ；
P after alignment 2 With C after alignment 1 Substituted into formulaPerforming replacement operation; obtaining second execution user side ciphertext->:
；
Second execution user terminal U 2 Second execution user side ciphertext C 2 Send to the third execution user terminal U 3 ，
Third execution user terminal U 3 By itself plain text information X 3 Calculated as information P to be encrypted 3 =X 3 *amp+e 3 The method comprises the steps of carrying out a first treatment on the surface of the Wherein amp represents the magnification, e 3 Representing random positive integer noise;
information P to be encrypted 3 Ciphertext C of second execution user side 2 Performing multiplication alignment operation to obtain aligned P 3 With C after alignment 2 ；
P after alignment 3 With C after alignment 2 Substituted into formulaPerforming replacement operation; obtain the third execution client ciphertext->:
；
In one embodiment, S6 further comprises:
the rest decryption clients except the final decryption client all perform the following operations:
current decryption user terminal U i By self-position basis W i Decrypting the i-1 th decryption matrixPerforming reverse permutation operation and adding a random number +.>Obtaining the ith decryption matrix；
Ith decryption matrix Z i The specific calculation formula of (2) is as follows:；
current decryption user terminal U i Decrypting the ith decryption matrix Z i Send to the next decryption user terminal U i+1 ；
Wherein, the 0 th decryption matrix Z 0 For the final ciphertext C m 。
In this embodiment:
；
user terminal U 1 Use of bitsPut base W 1 For Z 0 Inverse permutation and random positive integer noiseScrambling to obtain:
；
user terminal U 1 Will Z 1 Is sent to the user terminal U 2 User terminal U 2 Using position base W 2 For Z 1 Inverse permutation and random positive integer noiseScrambling to obtain:
；
user terminal U 2 Will Z 2 Is sent to the user terminal U 3 。
In one embodiment, S6 further comprises:
finally, decrypting the user's own position base W m Decrypting the m-1 th decryption matrix Z m-1 And extracting the real modulus component in the model, and decrypting by using the Chinese remainder theorem to obtain an intermediate result T.
In this embodiment:
user terminal U 3 According to the Chinese remainder theorem, use the position base W 3 For Z 2 Decryption:
and (3) calculating in advance:，/>，/>；
will Z 2 Z in (b) 2 [1][W 3 [1]],z 2 [2][W 3 [2]]，z 2 [3][W 3 [3]]，z 2 [4][W 3 [4]],z 2 [5][W 3 [5]]，z 2 [6][W 3 [6]]Extracting to construct a congruence type
；
Calculating components from the Chinese remainder theoremThen, the result T of the above-mentioned congruence formula is calculated as:
；
wherein e 1 、 e 2 、e 3 、 And->Are all much smaller than amp;
so T can be expressed as:;
where e represents mixed noise.
In one embodiment, S6 further comprises:
based on the formulaCalculating a final decryption result corresponding to the intermediate result T; wherein order is m Representing the final ciphertext C m To the power of the amp.
It should be noted that: the order value of a ciphertext is the power of the amp in the ciphertext.
In the present embodiment, due to order m =2, so T is divided by amp 2 The post-mixed noise becomes a decimal part, and the decimal part is removed to obtain a final result output=t amp after homomorphic operation -2 According to homomorphism propertiesIt can be seen that there must be output= (X) 1 +X 2 )*X 3 。
Finally, taking ciphertext X and ciphertext Y as examples to describe the addition alignment and multiplication alignment of the invention:
aligning the ciphertext X with the ciphertext Y according to the order value of the ciphertext X and the order value of the ciphertext Y:
if the order value of X is less than the order value of Y, then Y remains unchanged,
updating X as:；
if the order value of X is greater than the order value of Y, X remains unchanged,
update Y to:；
if the ciphertext X and the ciphertext Y execute the addition operation, the order value of the addition calculation result ciphertext Z+ is equal to the larger value of the order value in the ciphertext X and the ciphertext Y, namely；
If the ciphertext X and the ciphertext Y perform multiplication, the order value of the result ciphertext Z is equal to the sum of the orders of X and Y, i.e.；
Wherein order is z+ Represents the order value, order, of ciphertext Z + z* Order value representing ciphertext Z x Representing the order value, order, of ciphertext X y Representing the order value of ciphertext Y.
The order value of a ciphertext is the power of the amp in the ciphertext.
In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant points refer to the description of the method section.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (4)
1. A multi-user joint encryption and decryption method based on homomorphic encryption is characterized by comprising the following steps:
s1: obtaining the position base of each user terminal based on the key of each user terminal;
s1 further comprises:
based on user terminal U i Key userky i And random numbers to generate a user terminal U i Is a position group W of (2) i ＝{W i [1],W i [2],W i [j],...,W i [n]},0≤W i [j]< t, n represents a positional group W i The number of the included elements, t, represents the number of redundant items in one redundant vector;
s2: based on the position base and the public mode base of each user terminal, obtaining the secret key of each user terminal;
s2 further comprises:
common mode base b= { B 1 ,b 2 ,…,b n Obtained by negotiations at each client, b 1 <b 2 <…<b n And b 1 ,b 2 ,…,b n Every two are mutually mass;
s3: determining the execution sequence of each user side according to homomorphic operation functions to be executed;
the first execution user side encrypts self plaintext information based on a self secret key to obtain a first execution user side ciphertext, and sends the first execution user side ciphertext to the second execution user side;
s3 further comprises:
s31: first execution user terminal U 1 By itself plain text information X 1 Calculated as information P to be encrypted 1 ＝X 1 *amp+e 1 The method comprises the steps of carrying out a first treatment on the surface of the Wherein amp represents the magnification, e 1 Representing random positive integer noise;
s32: based on the formulaCalculating to obtain a first execution user side ciphertext C 1 ＝{c 1 [j][k]|1≤j≤n，0≤k＜t}，W i [j]Representing the position group W i R represents a redundancy value;
s4: the rest executing user terminals except the first executing user terminal and the last executing user terminal all carry out the following operations:
the current execution user side obtains a current execution user side ciphertext based on a previous execution user side ciphertext, self plaintext information and a self secret key, and sends the current execution user side ciphertext to a next execution user side;
s4 further comprises:
s41: currently executing user terminal U i By itself plain text information X i Calculated as information P to be encrypted i ＝X i *amp+e i The method comprises the steps of carrying out a first treatment on the surface of the Wherein amp represents the magnification, e i Representing random positive integer noise;
s42: information P to be encrypted i Ciphertext C of user side with last execution i-1 Performing addition/multiplication alignment operation to obtain aligned P i With C after alignment i-1 ；
S43: p after alignment i With C after alignment i-1 Substitution formulaPerforming replacement operation to obtain a current execution user terminal U i Ciphertext C i ＝{c 1 [j][k]1.ltoreq.j.ltoreq.n, 0.ltoreq.j.ltoreq.k, where c i-1 [j][k]Representing post-alignment C i-1 Elements of (a) and (b); />Representing homomorphic addition or homomorphic multiplication;
s5: finally, the executing user side obtains a final ciphertext based on the last executing user side ciphertext, self plaintext information and self secret key, and sends the final ciphertext to all executing user sides;
s6: determining decryption sequence of each user terminal;
and each decryption user end sequentially decrypts the final ciphertext by using the own position base to obtain a final decryption result.
2. The method for multi-user joint encryption and decryption based on homomorphic encryption of claim 1, wherein S6 further comprises:
the rest decryption clients except the final decryption client all perform the following operations:
current decryption user terminal U i By self-position basis W i Decrypting the i-1 th decryption matrix Z i-1 ＝{z i-1 [j][k]1 j is less than or equal to n,0 is less than or equal to k is less than or equal to t, and a random number e 'is added by reverse substitution operation' i Obtaining the ith decryption matrix Z i ＝{z i [j][k]|1≤j≤n，0≤k＜t}；
Ith decryption matrix Z i The specific calculation formula of (2) is as follows: z i [j][k]＝z i-1 [j][k+W i [j]mod t]+e′ i mod b j ；
Current decryption user terminal U i Decrypting the ith decryption matrix Z i Send to the next decryption user terminal U i+1 ；
Wherein, the 0 th decryption matrix Z 0 For the final ciphertext C m 。
3. The method for multi-user joint encryption and decryption based on homomorphic encryption according to claim 2, wherein S6 further comprises:
finally, the decryption user side utilizes itselfPosition group W m Decrypting the m-1 th decryption matrix Z m-1 And extracting the real modulus component in the model, and decrypting by using the Chinese remainder theorem to obtain an intermediate result T.
4. The method for multi-user joint encryption and decryption based on homomorphic encryption according to claim 3, wherein S6 further comprises:
based on the formulaCalculating a final decryption result corresponding to the intermediate result T; wherein order is m Representing the final ciphertext C m To the power of the amp.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410109715.4A CN117640066B (en) | 2024-01-26 | 2024-01-26 | Multi-user joint encryption and decryption method based on homomorphic encryption |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410109715.4A CN117640066B (en) | 2024-01-26 | 2024-01-26 | Multi-user joint encryption and decryption method based on homomorphic encryption |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117640066A CN117640066A (en) | 2024-03-01 |
| CN117640066B true CN117640066B (en) | 2024-04-05 |
Family
ID=90023822
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410109715.4A Active CN117640066B (en) | 2024-01-26 | 2024-01-26 | Multi-user joint encryption and decryption method based on homomorphic encryption |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117640066B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112737764A (en) * | 2020-12-11 | 2021-04-30 | 华东师范大学 | Lightweight multi-user multi-data all-homomorphic data encryption packaging method |
| CN115242369A (en) * | 2022-05-11 | 2022-10-25 | 西安电子科技大学 | Multi-key homomorphic encryption-based federal learning privacy protection method and device |
| CN116049851A (en) * | 2023-01-28 | 2023-05-02 | 北京隐算科技有限公司 | Ciphertext processing system and method based on full homomorphic encryption |
| CN116915382A (en) * | 2023-09-14 | 2023-10-20 | 北京隐算科技有限公司 | Multi-user privacy protection method based on mode component homomorphism |
| CN117118617A (en) * | 2023-10-24 | 2023-11-24 | 北京隐算科技有限公司 | Distributed threshold encryption and decryption method based on mode component homomorphism |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2873186B1 (en) * | 2012-07-26 | 2018-03-07 | NDS Limited | Method and system for homomorphicly randomizing an input |
| KR102423885B1 (en) * | 2015-05-08 | 2022-07-21 | 한국전자통신연구원 | Method and system for additive homomorphic encryption scheme with error detection functionality |
-
2024
- 2024-01-26 CN CN202410109715.4A patent/CN117640066B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112737764A (en) * | 2020-12-11 | 2021-04-30 | 华东师范大学 | Lightweight multi-user multi-data all-homomorphic data encryption packaging method |
| CN115242369A (en) * | 2022-05-11 | 2022-10-25 | 西安电子科技大学 | Multi-key homomorphic encryption-based federal learning privacy protection method and device |
| CN116049851A (en) * | 2023-01-28 | 2023-05-02 | 北京隐算科技有限公司 | Ciphertext processing system and method based on full homomorphic encryption |
| CN116915382A (en) * | 2023-09-14 | 2023-10-20 | 北京隐算科技有限公司 | Multi-user privacy protection method based on mode component homomorphism |
| CN117118617A (en) * | 2023-10-24 | 2023-11-24 | 北京隐算科技有限公司 | Distributed threshold encryption and decryption method based on mode component homomorphism |
Non-Patent Citations (1)
| Title |
|---|
| 云计算环境中基于策略的多用户全同态加密方法;刘青 等;广西大学学报(自然科学版);20160625(第03期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117640066A (en) | 2024-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106961336B (en) | A kind of key components trustship method and system based on SM2 algorithm | |
| CN111314089B (en) | SM 2-based two-party collaborative signature method and decryption method | |
| CN107196926B (en) | Cloud outsourcing privacy set comparison method and device | |
| CN109728906A (en) | Anti- quantum calculation asymmet-ric encryption method and system based on unsymmetrical key pond | |
| CN113114451A (en) | Data statistical analysis method and system for enterprise cloud ERP system based on homomorphic encryption | |
| CN112383397B (en) | Heterogeneous signcryption communication method based on biological characteristics | |
| CN109660338A (en) | Anti- quantum calculation digital signature method and anti-quantum calculation digital signature system based on pool of symmetric keys | |
| CN111865555B (en) | Homomorphic encryption method based on k-Lin hypothesis | |
| CN109951292B (en) | Simplified SM9 digital signature separation interaction generation method and system | |
| CN107425971A (en) | Terminal and its data method for encryption/decryption and device without certificate | |
| CN117118617B (en) | Distributed threshold encryption and decryption method based on mode component homomorphism | |
| CN110380846A (en) | A kind of electronic health record patient endorsement method and system | |
| JP2024506026A (en) | Threshold key exchange | |
| CN109728905A (en) | Anti- quantum calculation MQV cryptographic key negotiation method and system based on unsymmetrical key pond | |
| Wang et al. | Privacy preserving computations over healthcare data | |
| CN116522366B (en) | Multiparty data processing method suitable for big data, storage medium and product | |
| CN116318696B (en) | Proxy re-encryption digital asset authorization method under condition of no initial trust of two parties | |
| Dong et al. | Enabling privacy preserving record linkage systems using asymmetric key cryptography | |
| CN117640066B (en) | Multi-user joint encryption and decryption method based on homomorphic encryption | |
| CN109981254A (en) | A kind of miniature public key encryption method based on limited Lee's type group's resolution problem | |
| US10356056B2 (en) | Method and system for privacy-preserving order statistics in a star network | |
| Ansah et al. | Relevance of elliptic curve cryptography in modern-day technology | |
| US20060104447A1 (en) | Discrete logarithm-based cryptography using the Shafarevich-Tate group | |
| Sun et al. | Cryptanalysis of Aydos et al.'s ECC-based wireless authentication protocol | |
| Gritti et al. | Empowering personal health records with cloud computing: How to encrypt with forthcoming fine-grained policies efficiently |
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 |