Paper Info
Title
Coercion-Resistant Voting in Linear Time via Fully Homomorphic Encryption: Towards a Quantum-Safe Scheme.
Abstract
We present an approach for performing the tallying work in the coercion-resistant JCJ voting protocol, introduced by Juels, Catalano, and Jakobsson, in linear time using fully homomorphic encryption (FHE). The suggested enhancement also paves the path towards making JCJ quantum-resistant, while leaving the underlying structure of JCJ intact. The exhaustive, comparison-based approach of JCJ using plaintext equivalence tests leads to a quadratic blow-up in the number of votes, which makes the tallying process rather impractical in realistic settings with a large number of voters. We show how the removal of invalid votes can be done in linear time via a solution based on recent advances in various FHE primitives such as hashing, zero-knowledge proofs of correct decryption, verifiable shuffles and threshold FHE. We conclude by touching upon some of the advantages and challenges of such an approach, followed by a discussion of further security and post-quantum considerations.
Year
Venue
DocType
2019
arXiv: Cryptography and Security
Journal
Volume
Citations 
PageRank 
abs/1901.02560
0
0.34
References 
Authors
24
4
Name
Order
Citations
PageRank
Peter B. Rønne1129.33
Arash Atashpendar293.21
Kristian Gjøsteen302.70
Peter Y. A. Ryan472866.96