Cryptology ePrint Archive: Report 2021/1499

Improved Lattice-Based Mix-Nets for Electronic Voting

Valeh Farzaliyev and Jan Willemson and Jaan Kristjan Kaasik

Abstract: Mix-networks were first proposed by Chaum in the late 1970s -- early 1980s as a general tool for building anonymous communication systems. Classical mix-net implementations rely on standard public key primitives (e.g. ElGamal encryption) that will become vulnerable when a sufficiently powerful quantum computer will be built. Thus, there is a need to develop quantum-resistant mix-nets. This paper focuses on the application case of electronic voting where the number of votes to be mixed may reach hundreds of thousands or even millions. We propose an improved architecture for lattice-based post-quantum mix-nets featuring more efficient zero-knowledge proofs while maintaining established security assumptions. Our current implementation scales up to 100000 votes, still leaving a lot of room for future optimisation.

Category / Keywords: public-key cryptography / Lattice-based post-quantum cryptography, mix-nets, zero-knowledge proofs, electronic voting, implementation

Original Publication (with minor differences): ICISC 2021

Date: received 11 Nov 2021

Contact author: janwil at cyber ee

Available format(s): PDF | BibTeX Citation

Note: This is an extended version of a paper to appear in ICISC 2021, with proof details added in the apepndices.

Version: 20211115:125646 (All versions of this report)

Short URL: ia.cr/2021/1499


[ Cryptology ePrint archive ]