Back to Search
Start Over
Bootstrapping of FHE over the Integers with Large Message Space
- Source :
- Security and Communication Networks, Vol 2018 (2018)
- Publication Year :
- 2018
- Publisher :
- Hindawi Limited, 2018.
-
Abstract
- For the decryption of the fully homomorphic encryption (FHE) over the integers with the message space ZQ, Nuida and Kurosawa proposed a Q4λ-multiplicative-degree circuit to compute it at Eurocrypt 2015, where λ is the security parameter and the message size Q is a constant. Since the degree of the decryption circuit is polynomial in Q, the range of the message size Q is limited. In this work, we solve this open problem as long as Q is large enough (larger than λ). We represent the decryption circuit as a arithmetic polynomial of multiplicative degree 108·λ log3λ, which is independent of the message size Q except a constraint Q>λ. Moreover, the bootstrapping process requires only O(λ·logλ) number of multiplications to implement the decryption circuit, which is significantly lower than O(λ4) of Nuida and Kurosawa’s work. We also show the efficiency of the FHE scheme with message space ZQ compared to the FHE scheme with binary message space. As a result, we have that the former is preferable.
- Subjects :
- 021110 strategic, defence & security studies
Theoretical computer science
Article Subject
Computer Networks and Communications
Computer science
0211 other engineering and technologies
Bootstrapping (linguistics)
02 engineering and technology
Space (commercial competition)
lcsh:Technology (General)
0202 electrical engineering, electronic engineering, information engineering
lcsh:T1-995
020201 artificial intelligence & image processing
lcsh:Science (General)
lcsh:Q1-390
Information Systems
Subjects
Details
- ISSN :
- 19390122 and 19390114
- Volume :
- 2018
- Database :
- OpenAIRE
- Journal :
- Security and Communication Networks
- Accession number :
- edsair.doi.dedup.....c3b42f3f52cf1c37e258495f7b9a74c5