Paper 2024/1112 Original: eprint.iacr.org/2024/1112 ↗
HERatio: Homomorphic Encryption of Rationals using Laurent Polynomials
Abstract
In this work we present $\mathsf{HERatio}$, a homomorphic encryption scheme that builds on the scheme of Brakerski, and Fan and Vercauteren. Our scheme naturally accepts Laurent polynomials as inputs, allowing it to work with rationals via their bounded base-$b$ expansions. This eliminates the need for a specialized encoder and streamlines encryption, while maintaining comparable efficiency to BFV. To achieve this, we introduce a new variant of the Polynomial Learning With Errors (PLWE) problem which employs Laurent polynomials instead of the usual ``classic'' polynomials, and provide a reduction to the PLWE problem.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2024-07-08: last updated
- 2024-07-08: published
- Short URL
- https://ia.cr/2024/1112
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/1112,
author = {Luke Harmon and Gaetan Delavignette and Hanes Oliveira},
title = {HERatio: Homomorphic Encryption of Rationals using Laurent Polynomials},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1112},
year = {2024},
url = {https://eprint.iacr.org/2024/1112}
}