[Resource Topic] 2020/1161: KVaC: Key-Value Commitments for Blockchains and Beyond

Welcome to the resource topic for 2020/1161

KVaC: Key-Value Commitments for Blockchains and Beyond

Authors: Shashank Agrawal, Srinivasan Raghuraman


As blockchains grow in size, validating new transactions becomes more and more resource intensive. To deal with this, there is a need to discover compact encodings of the (effective) state of a blockchain – an encoding that allows for efficient proofs of membership and updates. In the case of account-based cryptocurrencies, the state can be represented by a key-value map, where keys are the account addresses and values consist of account balance, nonce, etc. We propose a new commitment scheme for key-value maps whose size does not grow with the number of keys, yet proofs of membership are of constant-size. In fact, both the encoding and the proofs consist of just two and three group elements respectively (in groups of unknown order like class groups). Verifying and updating proofs involves just a few group exponentiations. Additive updates to key values enjoy the same level of efficiency too. Key-value commitments can be used to build dynamic accumulators and vector commitments, which find applications in group signatures, anonymous credentials, verifiable databases, interactive oracle proofs, etc. Using our new key-value commitment, we provide the most efficient constructions of (sub)vector commitments to date.

ePrint: https://eprint.iacr.org/2020/1161

Talk: https://www.youtube.com/watch?v=EjsW0ah8_BY

Slides: https://iacr.org/submit/files/slides/2020/asiacrypt/ac2020/306/slides.pptx

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .