Lattice-Based Proof of Shuffle and Applications to Electronic Voting

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

doi:10.1007/978-3-030-75539-3_10

Lattice-Based Proof of Shuffle and Applications to Electronic Voting

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

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.

Original language	English
Title of host publication	Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings
Editors	Kenneth G. Paterson
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	227-251
Number of pages	25
ISBN (Print)	9783030755386
DOIs	https://doi.org/10.1007/978-3-030-75539-3_10
State	Published - 2021
Externally published	Yes
Event	Cryptographer's Track at the RSA Conference, CT-RSA 2021 - Virtual, Online Duration: 17 May 2021 → 20 May 2021

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12704 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Cryptographer's Track at the RSA Conference, CT-RSA 2021
City	Virtual, Online
Period	17/05/21 → 20/05/21

Bibliographical note

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.

Funding

C. Baum–This work was funded by the European Research Council (ERC) under the European Unions’ Horizon 2020 research and innovation programme under grant agreement No. 669255 (MPCPRO). Part of this work was done while visiting NTNU in Trondheim.

Funders	Funder number
European Unions’ Horizon 2020 research and innovation programme
Horizon 2020 Framework Programme	669255
European Commission

Keywords

Electronic voting
Implementation
Lattice-based cryptography
Proof of shuffle
Return codes
Verifiable encryption

Access to Document

10.1007/978-3-030-75539-3_10

Cite this

Aranha, D. F., Baum, C., Gjøsteen, K., Silde, T., & Tunge, T. (2021). Lattice-Based Proof of Shuffle and Applications to Electronic Voting. In K. G. Paterson (Ed.), Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings (pp. 227-251). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12704 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-75539-3_10

Aranha, Diego F. ; Baum, Carsten ; Gjøsteen, Kristian et al. / Lattice-Based Proof of Shuffle and Applications to Electronic Voting. Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings. editor / Kenneth G. Paterson. Springer Science and Business Media Deutschland GmbH, 2021. pp. 227-251 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{831c53d7b99a43188de19bd477c67dcc,

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

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{\textquoteright}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.",

keywords = "Electronic voting, Implementation, Lattice-based cryptography, Proof of shuffle, Return codes, Verifiable encryption",

author = "Aranha, {Diego F.} and Carsten Baum and Kristian Gj{\o}steen and Tjerand Silde and Thor Tunge",

note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; Cryptographer's Track at the RSA Conference, CT-RSA 2021 ; Conference date: 17-05-2021 Through 20-05-2021",

year = "2021",

doi = "10.1007/978-3-030-75539-3_10",

language = "אנגלית",

isbn = "9783030755386",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "227--251",

editor = "Paterson, {Kenneth G.}",

booktitle = "Topics in Cryptology-CT-RSA 2021 - Cryptographers{\textquoteright} Track at the RSA Conference, Proceedings",

address = "גרמניה",

}

Aranha, DF, Baum, C, Gjøsteen, K, Silde, T & Tunge, T 2021, Lattice-Based Proof of Shuffle and Applications to Electronic Voting. in KG Paterson (ed.), Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12704 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 227-251, Cryptographer's Track at the RSA Conference, CT-RSA 2021, Virtual, Online, 17/05/21. https://doi.org/10.1007/978-3-030-75539-3_10

Lattice-Based Proof of Shuffle and Applications to Electronic Voting. / Aranha, Diego F.; Baum, Carsten; Gjøsteen, Kristian et al.
Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings. ed. / Kenneth G. Paterson. Springer Science and Business Media Deutschland GmbH, 2021. p. 227-251 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12704 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Aranha, Diego F.

AU - Baum, Carsten

AU - Gjøsteen, Kristian

AU - Silde, Tjerand

AU - Tunge, Thor

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

KW - Electronic voting

KW - Implementation

KW - Lattice-based cryptography

KW - Proof of shuffle

KW - Return codes

KW - Verifiable encryption

UR - http://www.scopus.com/inward/record.url?scp=85111021928&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-75539-3_10

DO - 10.1007/978-3-030-75539-3_10

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85111021928

SN - 9783030755386

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 227

EP - 251

BT - Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings

A2 - Paterson, Kenneth G.

PB - Springer Science and Business Media Deutschland GmbH

T2 - Cryptographer's Track at the RSA Conference, CT-RSA 2021

Y2 - 17 May 2021 through 20 May 2021

ER -

Aranha DF, Baum C, Gjøsteen K, Silde T, Tunge T. Lattice-Based Proof of Shuffle and Applications to Electronic Voting. In Paterson KG, editor, Topics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings. Springer Science and Business Media Deutschland GmbH. 2021. p. 227-251. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-75539-3_10

Lattice-Based Proof of Shuffle and Applications to Electronic Voting

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this