I will present the first verifiable shuffle based on presumably quantum-safe primitives using lattice-based cryptography. The protocol is inspired by the work of Neff (CCS 2001), using the fact that roots of polynomials are stable under permutation. The building blocks of the shuffle are lattice-based commitments and zero-knowledge proofs of linear relations, e.g., using Baum et al. (SCN 2018).

We present two cryptographic voting protocols:

- A simple system which a Ballot Box and a Shuffle-Decryption server a la the Norwegian electronic voting system used in 2011 and 2013. This protocol was published at CT-RSA 2021.

- A more standard system with a mix-net consisting of several Shuffle servers and a distributed decryption protocol with several Decryption servers, e.g. similar to what they are planning to use in Switzerland. Paper is in submission.

"Lattice-Based Proof of Shuffle and Applications to Electronic Voting"

Diego F. Aranha, Carsten Baum, Kristian Gjoesteen, Tjerand Silde and Thor Tunge: 

https://eprint.iacr.org/2021/338.

===============

https://umd.zoom.us/j/97585901703?pwd=T1hBZFFMdnV5VXdiaVdtaWo0RnNmZz09

Meeting ID: 975 8590 1703

Passcode: lattices??