Haodong Yang, Venkata Gandikota · 2026 · arXiv (Cornell University)
DOI: 10.48550/arxiv.2610.31437 · cited by 0 works (OpenAlex) · open-access PDF
Encryption homomorphic memungkinkan perhitungan pada data input tanpa mendekripsi. kertas ini memperluas konstruksi berdasarkan kode pesan skalar, menggunakan kode koset untuk membungkus simbol pesan $k$ ke dalam vektor teks cipher dengan panjang $n$. Untuk bidang dan panjang vektor tertentu, metode pembungkusan ini mengurangi jumlah vektor teks cipher yang dibutuhkan untuk mengirimkan catatan pesan. Keluarga kode evaluasi yang kompatibel mendukung penambahan publik dan operasi multiplikasi hingga tingkat yang ditentukan sebelumnya.
Machine translation (Meta M2M100); the English original follows.
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.
Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese
Topics: Ciphertext, Homomorphic encryption, Coset, Mathematics, Bounded function, Encryption
GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.31437, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txtSources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange