Vehicular Ad Hoc Networks (VANETs) are powerful platforms for vehicular data services and
applications. The increasing number of vehicles has made the vehicular network diverse …

Accumulation is a simple yet powerful primitive that enables incrementally verifiable
computation (IVC) without the need for recursive SNARKs. We provide a generic, efficient …

Digital signature is a fundamental primitive with numerous applications. Following the
development of pairing-based cryptography, several taking advantage of this setting have …

This paper presents Dory, a transparent setup, public-coin interactive argument for inner-
pairing products between committed vectors of elements of two source groups. For a product …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …

BBS signatures were implicitly proposed by Boneh, Boyen, and Shacham (CRYPTO'04) as
part of their group signature scheme, and explicitly cast as stand-alone signatures by …

Zero knowledge proof system which has received extensive attention since it was proposed
is an important branch of cryptography and computational complexity theory. Thereinto …

A recent line of works–initiated by Gordon, Katz and Vaikuntanathan (Asiacrypt 2010)–gave
lattice-based constructions allowing users to authenticate while remaining hidden in a …

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 a novel notion of quasi-adaptive non-interactive zero-knowledge (NIZK) proofs for
probability distributions on parameterized languages. It is quasi-adaptive in the sense that …