Distributed Verifiable Random Function with Compact Proof

Date

2025-01-01

Author

Ağırtaş, Ahmet Ramazan
Özer, Arda Buğra
Saygı, Zülfükar
Yayla, Oğuz

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

27
views

0
downloads

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. However, DVRFwCP necessitates an extra step of interaction between the participants. 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.

Subject Keywords

Blockchain, Cryptography, Distributed Verifiable Random Function, Verifiable Random Function

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85214219068&origin=inward
https://hdl.handle.net/11511/113152

DOI

https://doi.org/10.1007/978-3-031-76934-4_8

Conference Name

8th International Symposium on Cyber Security, Cryptology, and Machine Learning, CSCML 2024

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Citation Formats

A. R. Ağırtaş, A. B. Özer, Z. Saygı, and O. Yayla, “Distributed Verifiable Random Function with Compact Proof,” Be’er-Sheva, İsrail, 2025, vol. 15349 LNCS, Accessed: 00, 2025. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85214219068&origin=inward.