Reference : Coercion-Resistant Voting in Linear Time via Fully Homomorphic Encryption: Towards a ...
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/37791
Coercion-Resistant Voting in Linear Time via Fully Homomorphic Encryption: Towards a Quantum-Safe Scheme
English
Roenne, Peter [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Atashpendar, Arash mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Kristian, Gjøsteen [Norwegian University of Science and Technology, NTNU, Norway]
Ryan, Peter [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
In press
Financial Cryptography and Data Security 2019. FC 2019: International Workshops, CIW, VOTING, and WTSC
Springer
Yes
International
Financial Cryptography and Data Security 2019
From 18-02-2019 to 22-02-2019
[en] Secure E-Voting ; Coercion-Resistance ; Fully Homomorphic Encryption ; Post-Quantum Cryptography ; Quantum-Secure ; Linear Time Complexity ; Threshold Cryptography ; Deniability ; Zero-Knowledge Proof ; Homomorphic Hashing
[en] 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 pairwise 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.
http://hdl.handle.net/10993/37791
https://arxiv.org/abs/1901.02560

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
coercion-resistant_voting_in_linear_time_via_FHE_author_preprint.pdfAuthor preprint173.06 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.