Constant-Size Proofs Secure Distributed Verifiable Random Functions Efficiently
Cryptographers developed a Distributed Verifiable Random Function with proofs of constant size, eliminating bilinear pairings for faster, pairing-free verification.
