Homomorphic encryption improves data packing for secure computation
Homomorphic Encryption with Coset Code Construction
Information TheoryCryptography and Security
Summary
Sometimes, people want to do math on secret information without opening the lock to see it. This paper shows a way to pack more secret messages into a single locked container, so fewer containers are needed. The authors also make sure that adding and multiplying the locked messages work safely without opening them. They prove that their method keeps data private under certain conditions.
What this means in practice
- •For cloud service providers: Send data encrypted with fewer ciphertext vectors to reduce bandwidth in secure cloud computations.
- •For enterprise security teams: Enable processing of encrypted sensitive records with packed ciphertexts to improve storage and transmission efficiency.
Authors
Haodong Yang, Venkata Gandikota
Abstract
Homomorphic encryption enables computation on input data without decrypting it. This paper extends a construction based on scalar message codes, utilizing coset codes to pack $k$ message symbols into a ciphertext vector of length $n$. For a given field and vector length, this packing method reduces the number of ciphertext vectors required to transmit a message record. A compatible family of evaluation codes supports public addition and multiplication operations up to a predetermined degree. We prove that the scheme achieves bounded chosen-plaintext security under the coordinate-label distinguishability assumption.