Paper 2023/933
More Efficient Lattice-Based Electronic Voting from NTRU
Abstract
In recent years, there has been much focus on developing core cryptographic primitives based on lattice assumptions, driven by the NIST call for post-quantum key encapsulation and digital signature algorithms. However, more work must be conducted on efficient privacy-preserving protocols based on quantum-safe assumptions.
Electronic voting is one such privacy-preserving protocol whose adoption is increasing across the democratic world. E-voting offers both a fast and convenient alternative to postal voting whilst further ensuring cryptographic privacy of votes and offering full verifiability of the process. Owing to the sensitivity of voting and its infrastructure challenges, it is crucial to ensure security against quantum computers is baked into e-voting solutions.
We present an e-voting scheme from quantum-safe assumptions based on the hardness of the RLWE and NTRU lattice problems, providing concrete parameters and an efficient implementation. Our design achieves a factor
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in CIC 2024
- DOI
- 10.62056/a69qudhdj
- Keywords
- Lattice CryptographyElectronic VotingNTRU
- Contact author(s)
-
patrickhough @ pm me
caroline sandsbraten @ ntnu no
tjerand silde @ ntnu no - History
- 2025-01-13: last of 2 revisions
- 2023-06-14: received
- See all versions
- Short URL
- https://ia.cr/2023/933
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/933, author = {Patrick Hough and Caroline Sandsbråten and Tjerand Silde}, title = {More Efficient Lattice-Based Electronic Voting from {NTRU}}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/933}, year = {2023}, doi = {10.62056/a69qudhdj}, url = {https://eprint.iacr.org/2023/933} }