Paper 2023/002

Ring Verifiable Random Functions and Zero-Knowledge Continuations

Jeffrey Burdges, Web 3.0 Foundation
Oana Ciobotaru, OpenZeppelin
Handan Kılınç Alper, Web 3.0 Foundation
Alistair Stewart, Web 3.0 Foundation
Sergey Vasilyev, Web 3.0 Foundation
Abstract

We introduce a new cryptographic primitive, named ring verifiable random function (ring VRF). Ring VRF combines properties of VRF and ring signatures, offering verifiable unique, pseudorandom outputs while ensuring anonymity of the output and message authentication. We design its security in the universal composability (UC) framework and construct two protocols secure in our model. We also formalize a new notion of zero-knowledge (ZK) continuations allowing for the reusability of proofs by randomizing and enhancing the efficiency of one of our ring VRF schemes. We instantiate this notion with our protocol SpecialG which allows a prover to reprove a statement in a constant time and be unlikable to the previous proof(s).

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
anonymous VRFVRFring signaturezero-knowledge proofsidentityanonymous credentialsrate limitingrationing
Contact author(s)
jeff @ web3 foundation
oana ciobotaru @ gmail com
handankilinc1 @ gmail com
alistair @ web3 foundation
sergey @ web3 foundation
History
2023-10-19: last of 3 revisions
2023-01-01: received
See all versions
Short URL
https://ia.cr/2023/002
License
Creative Commons Attribution-NonCommercial-NoDerivs
CC BY-NC-ND

BibTeX

@misc{cryptoeprint:2023/002,
      author = {Jeffrey Burdges and Oana Ciobotaru and Handan Kılınç Alper and Alistair Stewart and Sergey Vasilyev},
      title = {Ring Verifiable Random Functions and Zero-Knowledge Continuations},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/002},
      year = {2023},
      url = {https://eprint.iacr.org/2023/002}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.