[Resource Topic] 2024/1112: HERatio: Homomorphic Encryption of Rationals using Laurent Polynomials

Welcome to the resource topic for 2024/1112

Title:
HERatio: Homomorphic Encryption of Rationals using Laurent Polynomials

Authors: Luke Harmon, Gaetan Delavignette, Hanes Oliveira

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.

ePrint: https://eprint.iacr.org/2024/1112

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .