Verifiable encodings in multigroup fully homomorphic encryption

TL;DR

This paper introduces verifiable encoding techniques using homomorphic authenticators in multigroup fully homomorphic encryption, enabling secure and verifiable computations across multiple user groups with potential applications in resource-constrained environments.

Contribution

It presents a novel verifiable solution for multigroup fully homomorphic encryption incorporating homomorphic authenticators, extending previous work to multikey, multiparty, and single-user cases.

Findings

Developed a verifiable primitive for multigroup FHE

Extended the approach to multikey, multiparty, and single-user scenarios

Proposed future research directions for resource-constrained settings

Abstract

This article presents the application of homomorphic authenticators, replication encodings to be precise, to multigroup fully homomorphic encryption schemes. Following the works of Gennaro and Wichs on homomorphic authenticators in combination with the work of multigroup schemes by Kwak et al. we present a verifiable solution for a fully homomorphic primitive that includes the multikey, multiparty and single-user cases. Furthermore, we propose a line of prospective research in constrained-resource scenarios.