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 …

The learning with errors (LWE) problem has become a central building block of modern
cryptographic constructions. This work collects and presents hardness results for concrete …

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 …

Rapid advances in quantum computing, together with the announcement by the National
Institute of Standards and Technology (NIST) to define new standards for digitalsignature …

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 …

At IEEE Security & Privacy 2015, Bos, Costello, Naehrig, and Stebila proposed an
instantiation of Peikert's ring-learning-with-errors–based (Ring-LWE) key exchange protocol …

In many cases, machine learning and privacy are perceived to be at odds. Privacy concerns
are especially relevant when the involved data are sensitive. This paper deals with the …

• Increase noise parameter for Kyber512 In the round-2 submission of Kyber, the decryption
error for Kyber512 was rather conservative, while at the same time, there were requests to …

Public key cryptography protocols, such as RSA and elliptic curve cryptography, will be
rendered insecure by Shor's algorithm when large-scale quantum computers are built …