Practical and Verifiable Electronic Sortition
Hsun Lee, Hsu-Chun Hsiao

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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Distributed systems and fault tolerance · Digital Rights Management and Security
