Legacy encryption systems depend on sharing a key (public or private) among the peers
involved in exchanging an encrypted message. However, this approach poses privacy …

Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …

Data privacy concerns are increasing significantly in the context of the Internet of Things,
cloud services, edge computing, artificial intelligence applications, and other applications …

This work describes a fast fully homomorphic encryption scheme over the torus (TFHE) that
revisits, generalizes and improves the fully homomorphic encryption (FHE) based on GSW …

In this paper, we revisit fully homomorphic encryption (FHE) based on GSW and its ring
variants. We notice that the internal product of GSW can be replaced by a simpler external …

The rise of machine learning as a service multiplies scenarios where one faces a privacy
dilemma: either sensitive user data must be revealed to the entity that evaluates the …

A fully homomorphic encryption (FHE) scheme allows anyone to transform an encryption of
a message, m, into an encryption of any (efficient) function of that message, f(m), without …

We finally close the long-standing problem of constructing a noninteractive zero-knowledge
(NIZK) proof system for any NP language with security based on the plain Learning With …

We propose a new notion of secure multiparty computation aided by a computationally-
powerful but untrusted" cloud" server. In this notion that we call on-the-fly multiparty …

In this paper, we present several methods to improve the evaluation of homomorphic
functions in TFHE, both for fully and for leveled homomorphic encryption. We propose two …