Verifiable encodings in multigroup fully homomorphic encryption

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/17/2019

Danger of using fully homomorphic encryption: A look at Microsoft SEAL

Fully homomorphic encryption is a promising crypto primitive to encrypt ...
research
09/06/2020

Efficiency Improvements for Encrypt-to-Self

Recent work by Pijnenburg and Poettering (ESORICS'20) explores the novel...
research
03/19/2023

Geometric Stability Estimates For 3D-Object Encryption Through Permutations and Rotations

We compute precise estimates for dimensions of 3D-encryption techniques ...
research
10/08/2018

Fully Homomorphic Image Processing

Fully homomorphic encryption has allowed devices to outsource computatio...
research
02/12/2023

Randomly Choose an Angle from an Immense Number of Angles to Rotate Qubits, Compute and Reverse

This paper studies information-theoretically secure quantum homomorphic ...
research
03/01/2022

FHEBench: Benchmarking Fully Homomorphic Encryption Schemes

Fully Homomorphic Encryption (FHE) emerges one of the most promising sol...
research
03/20/2023

Practical Solutions in Fully Homomorphic Encryption – A Survey Analyzing Existing Acceleration Methods

Fully homomorphic encryption (FHE) has experienced significant developme...

Please sign up or login with your details

Forgot password? Click here to reset