Find in Library

In most homomorphic encryption schemes based on RLWE, native plaintexts are represented as polynomials in a ring <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi mathvariant="double-struck">Z</mi><mi>t</mi></msub><mrow><mo>[</mo><mi>x</mi><mo>]</mo></mrow><mo>/</mo><msup><mi>x</mi><mi>N</mi></msup><mo>+</mo><mn>1</mn></mrow></semantics></math></inline-formula>, where <i>t</i> is a plaintext modulus and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mi>x</mi><mi>N</mi></msup><mo>+</mo><mn>1</mn></mrow></semantics></math></inline-formula> is a cyclotomic polynomial with a degree power of two. An encoding scheme should be used to transform some natural data types (such as integers and rational numbers) into polynomials in the ring. After homomorphic computations on the polynomial aare finished, the decoding procedure is invoked to obtain the results. We employ the Hensel code for encoding rational numbers and construct a high-precision leveled homomorphic encryption scheme with double-CRT. The advantage of our scheme is that the limitations of previous works are avoided, such as unexpected decoding results and loss of precision. Moreover, the plaintext space can be adjusted simply by changing a hyper-parameter to adapt to different computation tasks.