A Ciphertext Statistical Method Based on Homomorphic Encryption
A statistical method, fully homomorphic encryption technology, applied in the field of ciphertext statistics based on homomorphic encryption, can solve problems such as inability to directly use word frequency and other information statistical operations, decryption failure, time-consuming increase, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0079] The following takes Gentry integer homomorphic encryption as an example to illustrate the specific implementation steps of this scheme.
[0080] KenGen(λ): Generate n-bit private key γ is the length of the public key, guaranteeing the maximum q i is odd, and put q 0 Record as the largest. choose let x 0 =q 0 p+2r 0 ,let For i=1,...,τ, the public key pk=0 , x 1 ,...,x τ >( is an in (-x 0 / 2,x 0 / 2, an integer of ])
[0081] Enc(pq, m ∈ {0, 1}: encryption operation, randomly select a subset Choose a random number r∈(-2 ρ ,2 ρ ),
[0082] Dec(p, c): decryption operation,
[0083] Evaluate(pq,c 1 , c 2 ,...,c t ): Perform operations that meet the requirements of homomorphism on the ciphertext.
[0084] The encryption parameters for initializing homomorphic encryption are as follows.
[0085] Table 1 Encryption parameter list
[0086]
[0087]
[0088] Set plain text set The content of each text is as follows
[0089] Table 2 text c...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


