Geodesic
Post-quantum lattice-based e-voting for multiple candidates
Prikladnaya Diskretnaya Matematika. Supplement, no. 14 (2021), pp. 95-100.

Voir la notice de l'article provenant de la source Math-Net.Ru

In recent years, many effective lattice-based cryptographic schemes have emerged, including (fully) homomorphic encryption and a multi-party computation. Such lattice-based schemes are interesting because they are resistant to attacks by a quantum computer. In this paper, an electronic voting scheme is implemented that can efficiently work for multiple voting candidates. Moreover, two voting options are possible: a vote for a single candidate or a vote for any subset of candidates. There are many authorities in the scheme, the vote privacy is preserved in the case when at least one authority remains honest. The scheme is aimed at maintaining the vote privacy and verifiability of the results, therefore, various assumptions are used to comply with other often considered security features of electronic voting, e.g. each authority has the public keys of all admitted voters. The scheme is based on zero-knowledge proofs and a commitment scheme with homomorphic properties. Due to the zero-knowledge proofs, any member of the scheme can verify the voting results.
Keywords: lattices, e-voting, commitment scheme, zero-nowledge proof, amortized zero-knowledge opening proof. 
@article{PDMA_2021_14_a21,
     author = {D. A. Nabokov},
     title = {Post-quantum lattice-based e-voting for multiple candidates},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {95--100},
     publisher = {mathdoc},
     number = {14},
     year = {2021},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2021_14_a21/}
}
TY  - JOUR
AU  - D. A. Nabokov
TI  - Post-quantum lattice-based e-voting for multiple candidates
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2021
SP  - 95
EP  - 100
IS  - 14
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2021_14_a21/
LA  - ru
ID  - PDMA_2021_14_a21
ER  - 
%0 Journal Article
%A D. A. Nabokov
%T Post-quantum lattice-based e-voting for multiple candidates
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2021
%P 95-100
%N 14
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2021_14_a21/
%G ru
%F PDMA_2021_14_a21
D. A. Nabokov. Post-quantum lattice-based e-voting for multiple candidates. Prikladnaya Diskretnaya Matematika. Supplement, no. 14 (2021), pp. 95-100. http://geodesic.mathdoc.fr/item/PDMA_2021_14_a21/

[1] Del Pino R., Lyubashevsky V., Neven G., Seiler G., “Practical quantum-safe voting from lattices”, Proc. ACM SIGSAC Conf. Comput. Commun. Security, 2017, 1565–1581

[2] Langlois A., Stehlé D., “Worst-case to average-case reductions for module lattices”, Des. Codes Cryptogr., 75 (2015), 565–599 | DOI | MR | Zbl

[3] Lyubashevsky V. and Seiler G., “Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs”, LNCS, 10820, 2018, 204–224 | MR | Zbl

[4] Baum C., Damgård I., Lyubashevsky V., et al., “More efficient commitments from structured lattice assumptions”, LNCS, 11035, 2018, 368–385 | MR | Zbl

[5] Baum C., Bootle J., Cerulli A., et al., “Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits”, LNCS, 10992, 2018, 669–699 | MR | Zbl

[6] Attema T., Lyubashevsky V., and Seiler G., “Practical product proofs for lattice commitments”, LNCS, 12171, 2020, 470–499 | MR

[7] Esgin M., Nguyen N., Seiler G., “Practical exact proofs from lattices: New techniques to exploit fully-splitting rings”, Adv. Cryptology — ASIACRYPT 2020, 259–288