Paper 2024/1130

Distributed Verifiable Random Function With Compact Proof

Ahmet Ramazan Ağırtaş, Nethermind, London, UK
Arda Buğra Özer, Institute of Applied Mathematics, Middle East Technical University, Ankara, Türkiye
Zülfükar Saygı, Department of Mathematics, TOBB University of Economics and Technology, Ankara, Türkiye
Oğuz Yayla, Institute of Applied Mathematics, Middle East Technical University, Ankara, Türkiye
Abstract

Verifiable Random Functions (VRFs) are cryptographic primitives that generate unpredictable randomness along with proofs that are verifiable, a critical requirement for blockchain applications in decentralized finance, online gaming, and more. Existing VRF constructions often rely on centralized entities, creating security vulnerabilities. Distributed VRFs (DVRFs) offer a decentralized alternative but face challenges like large proof sizes or dependence on computationally expensive bilinear pairings. In this research, a unique distributed VRF (DVRF) system called DVRFwCP with considerable improvements is proposed. DVRFwCP has constant-size proofs, which means that the size of the proof does not change based on the number of participants. This overcomes a significant drawback of earlier DVRF systems, which saw proof size increase with participant count. Furthermore, DVRFwCP produces more efficient verification than previous systems by eliminating the requirement for bilinear pairings throughout the verification process. These innovations contribute to a more secure and scalable solution for generating verifiable randomness in decentralized environments. We compare our construction to well-established DVRF instantiations such as DDH-DVRF and GLOW-DVRF while also pointing out the major improvement in the estimated gas cost of these algorithms.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
CryptographyVerifiable Random FunctionDistributed Verifiable Random FunctionBlockchain
Contact author(s)
a r agirtas @ gmail com
abozer @ gmail com
zsaygi @ etu edu tr
oguz @ metu edu tr
History
2024-07-12: approved
2024-07-11: received
See all versions
Short URL
https://ia.cr/2024/1130
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/1130,
      author = {Ahmet Ramazan Ağırtaş and Arda Buğra Özer and Zülfükar Saygı and Oğuz Yayla},
      title = {Distributed Verifiable Random Function With Compact Proof},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1130},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1130}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.