Paper packs homomorphic ciphertexts using coset codes
Original title: Homomorphic Encryption with Coset Code Construction
The scheme packs k symbols into a length-n ciphertext and claims bounded chosen-plaintext security.
An arXiv paper extends scalar-message homomorphic encryption by using coset codes to pack k message symbols into a ciphertext vector of length n. The authors say this cuts the number of ciphertext vectors needed for a record, and a family of evaluation codes supports public addition and multiplication up to a set degree. They prove bounded chosen-plaintext security under a coordinate-label distinguishability assumption.
Unconfirmed: Security holds only under the authors’ coordinate-label distinguishability assumption; no independent review is stated.
- Packing uses coset codes over a given field and vector length.
- Evaluation codes allow public addition and multiplication up to a predetermined degree.
- Security is proven under the coordinate-label distinguishability assumption.
From the original article
1 min read at arxiv.orgHomomorphic 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.
By Haodong Yang · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.