Reference : Coercion-Resistant Voting in Linear Time via Fully Homomorphic Encryption: Towards a ...

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	Focus Areas :	Security, Reliability and Trust
	To cite this reference:	http://hdl.handle.net/10993/37791

Title :	Coercion-Resistant Voting in Linear Time via Fully Homomorphic Encryption: Towards a Quantum-Safe Scheme
Language :	English
Author, co-author :	Roenne, Peter [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Atashpendar, Arash [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) >]
Publication date :	2020
Main document title :	Financial Cryptography and Data Security 2019. FC 2019: International Workshops, CIW, VOTING, and WTSC
Publisher :	Springer
Peer reviewed :	Yes
Audience :	International
Event name :	Financial Cryptography and Data Security 2019
Event date :	From 18-02-2019 to 22-02-2019
Keywords :	[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
Abstract :	[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.
Permalink :	http://hdl.handle.net/10993/37791
Other URL :	https://arxiv.org/abs/1901.02560

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access coercion-resistant_voting_in_linear_time_via_FHE_author_preprint.pdf Author preprint 381.68 kB View/Open

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map