Practical and Verifiable Electronic Sortition

TL;DR

This paper introduces a practical verifiable electronic sortition scheme that allows for constant-time verification, overcoming previous computational inefficiencies and denial-of-service vulnerabilities.

Contribution

The paper presents a novel verifiable e-sortition scheme leveraging verifiable delay functions for efficient verification, improving practicality over existing systems.

Findings

Verification time is constant regardless of registration duration

Preliminary design and implementation demonstrate feasibility

Future work aims to further improve practicality

Abstract

Existing verifiable e-sortition systems are impractical due to computationally expensive verification (linear to the duration of the registration phase, T) or the ease of being denial of service. Based on the advance in verifiable delay functions, we propose a verifiable e-sortition scheme whose result can be efficiently verified in constant time with respect to T. We present the preliminary design and implementation, and explore future directions to further enhance practicability.