Design and Analysis of Compact, Pairing-Free Distributed Verifiable Random Functions

Date

2026-7-31

Author

Özer, Arda Buğra

Metadata

Show full item record

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

Item Usage Stats

57
views

60
downloads

Cite This

Verifiable Random Functions (VRFs) are cryptographic primitives that generate unpredictable randomness together with a publicly verifiable proof of correct generation following the protocol, a critical requirement for decentralized applications in blockchain infrastructure, decentralized finance, and online gaming. While distributed VRFs (DVRFs) eliminate dependence on a single trusted authority, existing constructions face a fundamental dilemma: linear proof sizes in the threshold parameter (DDH-DVRF) or reliance on computationally expensive bilinear pairings (GLOW-DVRF, FlexiRand). This thesis resolves both facets of this dilemma with three contributions despite the downside of adding another interaction round amongst the parties involved in the generation. We first introduce DVRFwCP, a distributed VRF with constant-size, pairing-free proofs achieved by layering a threshold structure over a Chaum-Pedersen NIZK system, where we use an augmented secure distributed key generation to produce the required nonce. We then introduce Icy-DVRF, which eliminates the quadratic interaction bottleneck of DVRFwCP by integrating the FROST-style preprocessed nonces, reducing total per-evaluation communication from O(n^2 t) to O(t) while preserving constant-size proofs. Finally, we introduce IcyVeil, the first pairing-free output-private DVRF, which extends Icy-DVRF with a Schnorr-based blinding mechanism that conceals the VRF output until revealed by the user. We evaluate all three constructions theoretically and empirically via Solidity smart-contract implementation on the Ethereum Sepolia testnet. The measurements show a 43.02% reduction in on-chain verification gas cost compared to GLOW-DVRF.

Subject Keywords

Cryptography, Distributed Verifiable Random Function, Output Privacy, Blockchain, Smart Contracts

URI

https://hdl.handle.net/11511/119946

Collections

Graduate School of Applied Mathematics, Thesis