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

Secure aggregation consists of computing the sum of data collected from multiple sources
without disclosing these individual inputs. Secure aggregation has been found useful for …

Identity-based cryptosystems mean that public keys can be directly derived from user
identifiers, such as telephone numbers, email addresses, and social insurance number, and …

In a homomorphic signature scheme, a user Alice signs some large dataset x using her
secret signing key and uploads the signed data to an untrusted remote server. The server …

We address the problem in which a client stores a large amount of data with an untrusted
server in such a way that, at any moment, the client can ask the server to compute a function …

In this paper, we present the first inner-product encryption (IPE) schemes that are
unbounded in the sense that the public parameters do not impose additional limitations on …

We define and construct a new primitive called a fully homomorphic message authenticator.
With such scheme, anybody can perform arbitrary computations over authenticated data and …

Abstract Structure-preserving signatures (SPS) are a powerful building block for
cryptographic protocols. We introduce SPS on equivalence classes (SPS-EQ), which allow …

Non-interactive zero-knowledge (NIZK) proofs for algebraic relations in a group, such as the
Groth-Sahai proofs, are an extremely powerful tool in pairing-based cryptography. A series …

Homomorphic message authenticators allow the holder of a (public) evaluation key to
perform computations over previously authenticated data, in such a way that the produced …