Improved lattice-based mix-nets for electronic voting

DOI10.1007/978-3-031-08896-4_6OpenAlexW3214377493MaRDI QIDQ2104424

Jaan Kristjan Kaasik, Valeh Farzaliyev, Jan Willemson

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08896-4_6

zbMATH Keywords

implementationzero-knowledge proofselectronic votinglattice-based post-quantum cryptographymix-nets

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)

Uses Software

• cuHE

Cites Work

• cuHE
• Lattice-based proof of shuffle and applications to electronic voting
• Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• More efficient commitments from structured lattice assumptions
• Practical product proofs for lattice commitments
• The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
• Revisiting post-quantum Fiat-Shamir
• cuHE: A Homomorphic Encryption Accelerator Library
• A Homomorphic LWE Based E-voting Scheme
• Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• On Ideal Lattices and Learning with Errors over Rings
• Progress in Cryptology - INDOCRYPT 2004
• Computationally Binding Quantum Commitments
• Theory of Cryptography
• Lattice-Based Proof of a Shuffle

This page was built for publication: Improved lattice-based mix-nets for electronic voting