Encoding data for homomorphic computation and performing homomorphic computation on encoded data
In some aspects, a method for generating encoded plaintext data in a plaintext vector space includes obtaining a plurality of vectors of plaintext elements, where each plaintext element is an element of a first finite field. The method further includes encoding the plurality of vectors of plaintext elements to a vector of field elements, where each vector of plaintext elements is encoded to a respective field element of the vector of field elements, each of the field elements is an element of a second finite field, and the second finite field is a finite extension field of the first finite field. The method additionally includes encoding the vector of field elements into an element of the plaintext vector space to produce the encoded plaintext data for homomorphic encryption and computation.
1 . A method for generating encoded plaintext data in a plaintext vector space, comprising:
obtaining a plurality of vectors of plaintext elements, wherein each plaintext element is an element of a first finite field;
encoding the plurality of vectors of plaintext elements to a vector of field elements, wherein each vector of plaintext elements is encoded to a respective field element of the vector of field elements, each of the field elements is an element of a second finite field, and the second finite field is a finite extension field of the first finite field;
encoding the vector of field elements into an element of the plaintext vector space to produce the encoded plaintext data;
encrypting the encoded plaintext data to produce a ciphertext; and
performing homomorphic computation on the ciphertext, wherein performing homomorphic computation comprises:
generating a plurality of linear maps based on the encoded plaintext data;
performing, on the ciphertext, a decoding operation of an outer recode operation based on a first linear map of the plurality of linear maps, the decoding operation generating an outer vector of ciphertexts;
performing, on each entry of the outer vector of ciphertexts, an inner recode operation based on a second linear map of the plurality of linear maps, the inner recoding operation generating a respective refreshed ciphertext, the respective refreshed ciphertexts forming a refreshed outer vector of ciphertexts; and
performing, on the refreshed outer vector of ciphertexts, an encoding operation of the outer recode operation based on the first linear map, the encoding operation generating a refreshed ciphertext encrypting the plaintext data.
2 . The method of claim 1 , wherein encoding the plurality of vectors of plaintext elements to the vector of field elements is based on a first reverse multiplication friendly embedding (RMFE) scheme, and encoding the vector of field elements into the element of the plaintext vector space is based on a second RMFE scheme.
3 . The method of claim 2 , wherein each of the first RMFE scheme and the second RMFE scheme comprises generating a respective polynomial that lies in the plaintext vector space.
4 . The method of claim 2 , wherein the first RMFE scheme comprises generating a respective encoded element based on a respective algebraic function field, and the second RMFE scheme comprises generating a respective polynomial.
5 . The method of claim 1 , wherein:
performing the inner recode operation based on the second linear map of the plurality of linear maps comprises:
performing a first transformation on the second linear map to generate the respective refreshed ciphertext, the first transformation comprising an optimized post-multiplication linear map evaluation; and
performing the encoding operation of the outer recode operation based on the first linear map comprises:
performing a second transformation on the first linear map to generate the refreshed ciphertext encrypting the plaintext data, the second transformation comprising a linear map evaluation with linearized polynomials.
6 . The method of claim 1 , wherein the outer recode operation is performed prior to the inner recode operation.
7 . The method of claim 1 , wherein the inner recode operation is performed prior to the outer recode operation.
8 . A system for generating encoded plaintext data in a plaintext vector space, comprising:
a memory; and
at least one processor communicatively coupled to the memory and configured to perform operations comprising:
obtaining a plurality of vectors of plaintext elements, wherein each plaintext element is an element of a first finite field;
encoding the plurality of vectors of plaintext elements to a vector of field elements, wherein each vector of plaintext elements is encoded to a respective field element of the vector of field elements, each of the field elements is an element of a second finite field, and the second finite field is a finite extension field of the first finite field;
encoding the vector of field elements into an element of the plaintext vector space to produce the encoded plaintext data;
encrypting the encoded plaintext data to produce a ciphertext; and
performing homomorphic computation on the ciphertext, wherein performing homomorphic computation comprises:
generating a plurality of linear maps based on the encoded plaintext data;
performing, on the ciphertext, a decoding operation of an outer recode operation based on a first linear map of the plurality of linear maps, the decoding operation generating an outer vector of ciphertexts;
performing, on each entry of the outer vector of ciphertexts, an inner recode operation based on a second linear map of the plurality of linear maps, the inner recoding operation generating a respective refreshed ciphertext, the respective refreshed ciphertexts forming a refreshed outer vector of ciphertexts; and
performing, on the refreshed outer vector of ciphertexts, an encoding operation of the outer recode operation based on the first linear map, the encoding operation generating a refreshed ciphertext encrypting the plaintext data.
9 . The system of claim 8 , wherein encoding the plurality of vectors of plaintext elements to the vector of field elements is based on a first reverse multiplication friendly embedding (RMFE) scheme, and encoding the vector of field elements into the element of the plaintext vector space is based on a second RMFE scheme.
10 . The system of claim 9 , wherein each of the first RMFE scheme and the second RMFE scheme comprises generating a respective polynomial that lies in the plaintext vector space.
11 . The system of claim 9 , wherein the first RMFE scheme comprises generating a respective encoded element based on a respective algebraic function field, and the second RMFE scheme comprises generating a respective polynomial.
12 . The system of claim 8 , wherein:
performing the inner recode operation based on the second linear map of the plurality of linear maps comprises:
performing a first transformation on the second linear map to generate the respective refreshed ciphertext, the first transformation comprising an optimized post-multiplication linear map evaluation; and
performing the encoding operation of the outer recode operation based on the first linear map comprises:
performing a second transformation on the first linear map to generate the refreshed ciphertext encrypting the plaintext data, the second transformation comprising a linear map evaluation with linearized polynomials.
13 . The system of claim 8 , wherein the outer recode operation is performed prior to the inner recode operation.
14 . The system of claim 8 , wherein the inner recode operation is performed prior to the outer recode operation.
15 . A non-transitory computer-readable medium for generating encoded plaintext data in a plaintext vector space, the non-transitory computer-readable medium comprising instructions that are operable, when executed by data processing apparatus, to perform operations comprising:
obtaining a plurality of vectors of plaintext elements, wherein each plaintext element is an element of a first finite field;
encoding the plurality of vectors of plaintext elements to a vector of field elements, wherein each vector of plaintext elements is encoded to a respective field element of the vector of field elements, each of the field elements is an element of a second finite field, and the second finite field is a finite extension field of the first finite field;
encoding the vector of field elements into an element of the plaintext vector space to produce the encoded plaintext data;
encrypting the encoded plaintext data to produce a ciphertext; and
performing homomorphic computation on the ciphertext, wherein performing homomorphic computation comprises:
generating a plurality of linear maps based on the encoded plaintext data;
performing, on the ciphertext, a decoding operation of an outer recode operation based on a first linear map of the plurality of linear maps, the decoding operation generating an outer vector of ciphertexts;
performing, on each entry of the outer vector of ciphertexts, an inner recode operation based on a second linear map of the plurality of linear maps, the inner recoding operation generating a respective refreshed ciphertext, the respective refreshed ciphertexts forming a refreshed outer vector of ciphertexts; and
performing, on the refreshed outer vector of ciphertexts, an encoding operation of the outer recode operation based on the first linear map, the encoding operation generating a refreshed ciphertext encrypting the plaintext data.
16 . The non-transitory computer-readable medium of claim 15 , wherein encoding the plurality of vectors of plaintext elements to the vector of field elements is based on a first reverse multiplication friendly embedding (RMFE) scheme, and encoding the vector of field elements into the element of the plaintext vector space is based on a second RMFe scheme.
17 . The non-transitory computer-readable medium of claim 16 , wherein the first RMFE scheme and the second RMFE scheme comprises generating a respective polynomial that lies in the plaintext vector space.
18 . The non-transitory computer-readable medium of claim 16 , wherein the first RMFE scheme comprises generating a respective encoded element based on a respective algebraic function field, and the second RMFE scheme comprises generating a respective polynomial.
19 . The non-transitory computer-readable medium of claim 15 , wherein:
performing the inner recode operation based on the second linear map of the plurality of linear maps comprises:
performing a first transformation on the second linear map to generate the respective refreshed ciphertext, the first transformation comprising an optimized post-multiplication linear map evaluation; and
performing the encoding operation of the outer recode operation based on the first linear map comprises:
performing a second transformation on the first linear map to generate the refreshed ciphertext encrypting the plaintext data, the second transformation comprising a linear map evaluation with linearized polynomials.
20 . The non-transitory computer-readable medium of claim 15 , wherein the outer recode operation is performed prior to the inner recode operation.