Post-quantum lattice-based e-voting for multiple candidates

DOI10.17223/2226308X/14/21MaRDI QIDQ6898752zbMATH OpenFDO

Authors D. A. Nabokov

Publication date 17 November 2025

Published in Prikladnaya Diskretnaya Matematika. Supplement (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17223/2226308X/14/21

zbMATH Keywords

latticescommitment schemee-votingamortized zero-knowledge opening proofzero-nowledge proof

Mathematics Subject Classification ID

Game theory, economics, finance, and other social and behavioral sciences (91-XX) Information and communication theory, circuits (94-XX)

Cites work

• More efficient commitments from structured lattice assumptions
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Practical product proofs for lattice commitments
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Worst-case to average-case reductions for module lattices

This page was built for publication: Post-quantum lattice-based e-voting for multiple candidates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6898752)