Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 13 min ago
PreprintCC BY 4.0arXiv

Homomorphic Encryption with Coset Code Construction

  • Haodong Yang
  • Venkata Gandikota
Open at sourcePDFDOICite

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.

Related

  1. GKS Fully Homomorphic Encryption: Security Analysis
    John Graham, Soundes Marzougui, Miloš Pavlović +1
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. Fully Homomorphic Encryption for Statistical Modeling
    Balasubramanian Narasimhan
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. A Continuous Projection Converse and a Weighted Construction for Uniquely Decodable Code Pairs
    Lei Yu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. LiftDiff: Guided Discrete Diffusion for Quantum Code Construction
    Yotam Peled, Eliya Nachmani
    arXivPreprintCC BY 4.0Full textGeneral mathematicsQuantum physics & quantum informationarXiv
  5. Chordal Codes: Code Construction and Efficient Gaussian-Elimination Decoding
    Yulin Chen, Laigang Guo, Tong Li +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{yang2026homomorphic,
  title = {{Homomorphic Encryption with Coset Code Construction}},
  author = {Haodong Yang and Venkata Gandikota},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.31437},
  eprint = {2610.31437},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.31437},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Homomorphic Encryption with Coset Code Construction
AU  - Haodong Yang
AU  - Venkata Gandikota
PY  - 2026
DA  - 2026/10/22
PB  - arXiv
DO  - 10.48550/arxiv.2610.31437
UR  - https://arxiv.org/abs/2610.31437
AB  - 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.
ER  -