Cryptology ePrint Archive: Report 2019/761

Athena: A verifiable, coercion-resistant voting system with linear complexity

Ben Smyth

Abstract: Seminal work by Juels, Catalano & Jakobsson delivered a verifiable, coercion-resistant voting system with quadratic complexity. This manuscript attempts to advance the state-of-the-art by delivering a voting system with equivalent security and linear complexity.

Category / Keywords: cryptographic protocols / election schemes

Date: received 28 Jun 2019, last revised 16 Jul 2019

Contact author: research at bensmyth com

Available format(s): PDF | BibTeX Citation

Version: 20190716:135306 (All versions of this report)

Short URL: ia.cr/2019/761


[ Cryptology ePrint archive ]