Lattice-Based Proof of Shuffle and Applications to Electronic Voting

Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde, Thor Tunge

Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

Abstract

A verifiable shuffle of known values is a method for proving that a collection of commitments opens to a given collection of known messages, without revealing a correspondence between commitments and messages. We propose the first practical verifiable shuffle of known values for lattice-based commitments. Shuffles of known values have many applications in cryptography, and in particular in electronic voting. We use our verifiable shuffle of known values to build a practical lattice-based cryptographic voting system that supports complex ballots. Our scheme is also the first construction from candidate post-quantum secure assumptions to defend against compromise of the voter’s computer using return codes. We implemented our protocol and present benchmarks of its computational runtime. The size of the verifiable shuffle is 17 τ KB and takes time 33 τ ms for τ voters. This is around 5 times faster and at least 50% smaller per vote than the lattice-based voting scheme by del Pino et al. (ACM CCS 2017), which can only handle yes/no-elections.

OriginalsprogEngelsk
TitelTopics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings
RedaktørerKenneth G. Paterson
Antal sider25
UdgivelsesstedCham
ForlagSpringer
Publikationsdato2021
Sider227-251
ISBN (Trykt)978-3-030-75538-6
ISBN (Elektronisk)978-3-030-75539-3
DOI
StatusUdgivet - 2021
BegivenhedThe Cryptographer's Track at the RSA Conference 2021 - San Francisco, USA
Varighed: 17 maj 202121 maj 2021
https://sites.google.com/site/ctrsa2021/

Konference

KonferenceThe Cryptographer's Track at the RSA Conference 2021
Land/OmrådeUSA
BySan Francisco
Periode17/05/202121/05/2021
Internetadresse
NavnLecture Notes in Computer Science
Vol/bind12704
ISSN0302-9743

Fingeraftryk

Dyk ned i forskningsemnerne om 'Lattice-Based Proof of Shuffle and Applications to Electronic Voting'. Sammen danner de et unikt fingeraftryk.

Citationsformater