Hash functions have always attracted a lot of attention in modern cryptography because of
their hard to invert nature. However, all previous constructions of cryptographic primitives …

Functional Commitments (FC) allow one to reveal functions of committed data in a succinct
and verifiable way. In this paper we put forward the notion of additive-homomorphic FC and …

Driven by the open problem raised by Hofheinz and Kiltz 34, we study the formalization of
lattice-based programmable hash function (PHF), and give two types of constructions by …

Homomorphic authenticators (HAs) enable a client to authenticate a large collection of data
elements m_1, ..., m_t and outsource them, along with the corresponding authenticators, to …

Cloud computing provides the clients with diversified services in a flexible manner. Recently,
the cloud platforms have been the basic underling-support for The IoT and mobile …

In a non-interactive zero-knowledge (NIZK) proof, a prover can non-interactively convince a
verifier of a statement without revealing any additional information. Thus far, numerous …

We build the first unleveled fully homomorphic signature scheme in the standard model. Our
scheme is not constrained by any a-priori bound on the depth of the functions that can be …

We construct more efficient cryptosystems with provable security against adaptive attacks,
based on simple and natural hardness assumptions in the standard model. Concretely, we …

We study the problem of privacy-preserving proofs on streamed authenticated data. In this
setting, a server receives a continuous stream of data from a trusted data provider, and is …

Demanding computations are increasingly outsourced to cloud platforms. For such
outsourced computations, the efficient verifiability of results is a crucial requirement. When …