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 …

Future communication networks need to harness the available spectrum more efficiently to
cater the requirements of the ever-increasing digital devices. Higher data rate with low …

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 …

This paper reveals an intrinsic relationship between secure cloud storage and secure
network coding for the first time. Secure cloud storage was proposed only recently while …

A homomorphic signature scheme for a class of functions C allows a client to sign and
upload elements of some data set D on a server. At any later point, the server can derive a …