Security, privacy, and decentralized trust management in VANETs: a review of current research and future directions
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 …
applications. The increasing number of vehicles has made the vehicular network diverse …
Protostar: generic efficient accumulation/folding for special-sound protocols
Accumulation is a simple yet powerful primitive that enables incrementally verifiable
computation (IVC) without the need for recursive SNARKs. We provide a generic, efficient …
computation (IVC) without the need for recursive SNARKs. We provide a generic, efficient …
Short randomizable signatures
D Pointcheval, O Sanders - Topics in Cryptology-CT-RSA 2016: The …, 2016 - Springer
Digital signature is a fundamental primitive with numerous applications. Following the
development of pairing-based cryptography, several taking advantage of this setting have …
development of pairing-based cryptography, several taking advantage of this setting have …
Dory: Efficient, transparent arguments for generalised inner products and polynomial commitments
J Lee - Theory of Cryptography Conference, 2021 - Springer
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 …
pairing products between committed vectors of elements of two source groups. For a product …
Proofs, arguments, and zero-knowledge
J Thaler - Foundations and Trends® in Privacy and Security, 2022 - nowpublishers.com
Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …
prover to provide a guarantee that it performed a requested computation correctly …
Revisiting BBS signatures
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 …
part of their group signature scheme, and explicitly cast as stand-alone signatures by …
A survey of noninteractive zero knowledge proof system and its applications
H Wu, F Wang - The scientific world journal, 2014 - Wiley Online Library
Zero knowledge proof system which has received extensive attention since it was proposed
is an important branch of cryptography and computational complexity theory. Thereinto …
is an important branch of cryptography and computational complexity theory. Thereinto …
Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions
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 …
lattice-based constructions allowing users to authenticate while remaining hidden in a …
Fully secure unbounded inner-product and attribute-based encryption
T Okamoto, K Takashima - International Conference on the Theory and …, 2012 - Springer
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 …
unbounded in the sense that the public parameters do not impose additional limitations on …
Shorter quasi-adaptive NIZK proofs for linear subspaces
CS Jutla, A Roy - Journal of Cryptology, 2017 - Springer
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 …
probability distributions on parameterized languages. It is quasi-adaptive in the sense that …