You are looking at a specific version 20200825:203047 of this paper. See the latest version.

Paper 2020/419

Pointproofs: Aggregating Proofs for Multiple Vector Commitments

Sergey Gorbunov and Leonid Reyzin and Hoeteck Wee and Zhenfei Zhang

Abstract

Vector commitments enable a user to commit to a sequence of values and provably reveal one or many values at specific positions at a later time. In this work, we construct Pointproofs--a new vector commitment scheme that supports non-interactive aggregation of proofs across multiple commitments. Our construction enables any third party to aggregate a collection of proofs with respect to different, independently computed commitments into a single proof represented by an elliptic curve point of 48-bytes. In addition, our scheme is hiding: a commitment and proofs for some values reveal no information about the remaining values. We build Pointproofs and demonstrate how to apply them to blockchain smart contracts. In our example application, Pointproofs reduce bandwidth overheads for propagating a block of transactions by at least 60% compared to prior state-of-art vector commitments. Pointproofs are also efficient: on a single-thread, it takes 0.08 seconds to generate a proof for 8 values with respect to one commitment, 0.25 seconds to aggregate 4000 such proofs across multiple commitments into one proof, and 23 seconds (0.7 ms per value proven) to verify the aggregated proof.

Note: References to improved crypto libraries plus minor corrections

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Minor revision. ACM CCS 2020
DOI
10.1145/3372297.3417244
Keywords
commitmentsblockchainaggregation
Contact author(s)
reyzin @ bu edu
History
2020-08-25: last of 2 revisions
2020-04-15: received
See all versions
Short URL
https://ia.cr/2020/419
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.