You are looking at a specific version 20200423:043751 of this paper. See the latest version.

Paper 2019/1147

Batching non-membership proofs with bilinear accumulators

Steve Thakur

Abstract

In this short paper, we provide protocols to batch and aggregate multiple non-membership proofs into a single proof of constant size with bilinear accumulators. We subsequently use the accumulator to construct a bilinear Vector Commitment with constant sized openings and a linear public parameter. Furthermore, we have designed the protocols so that the Verifier needs a constant amount of storage for verification despite the linear public parameter. We also provide ways to speed up the verification of membership and non-membership proofs and to shift most of the computational burden from the Verifier to the Prover. Since all the protocols are public coin, they can be made non-interactive with a Fiat-Shamir heuristic.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
AccumulatorsVector Commitmentsbilinear pairingszero knowledgeverifiable computation
Contact author(s)
stevethakur01 @ gmail com
History
2022-10-04: last of 21 revisions
2019-10-07: received
See all versions
Short URL
https://ia.cr/2019/1147
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.