Practical and Verifiable Electronic Sortition
This addresses the problem of making electronic sortition more practical and secure for applications requiring random selection, though it appears incremental as it builds on existing verifiable delay function technology.
The paper tackled the impracticality of existing verifiable e-sortition systems, which suffer from computationally expensive verification or denial-of-service vulnerabilities, by proposing a scheme based on verifiable delay functions that enables efficient constant-time verification with respect to the registration phase duration.
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.