Processing encrypted signals requires special properties of the underlying encryption
scheme. A possible choice is the use of homomorphic encryption. In this paper, we propose …

Cryptographic primitives are fundamental building blocks for designing security protocols to
achieve confidentiality, authentication, integrity and non-repudiation. It is not too much to say …

A threshold signature scheme enables distributed signing among n players such that any
subgroup of size t+1 can sign, whereas any group with t or fewer players cannot. While there …

We present a zero-knowledge argument for NP with low communication complexity, low
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …

Cryptography is an indispensable tool used to protect information in computing systems. It is
used everywhere and by billions of people worldwide on a daily basis. It is used to protect …

We give new methods for generating and using “strong trapdoors” in cryptographic lattices,
which are simultaneously simple, efficient, easy to implement (even in parallel), and …

We propose the first fully homomorphic encryption scheme, solving an old open problem.
Such a scheme allows one to compute arbitrary functions over encrypted data without the …

In recent years, lattice-based cryptography has been recognized for its many attractive
properties, such as strong provable security guarantees and apparent resistance to quantum …

We describe Charm, an extensible framework for rapidly prototy** cryptographic systems.
Charm provides a number of features that explicitly support the development of new …

While threshold signature schemes have been presented before, there has never been an
optimal threshold signature algorithm for DSA. The properties of DSA make it quite …