Lattice-based zero-knowledge proofs in action: applications to electronic voting

DOI10.1007/S00145-024-09530-5MaRDI QIDQ6655871FDO

Authors Valeh Farzaliyev, Calvin Pärn, Heleen Saarse, Jan Willemson

Publication date 27 December 2024

Published in Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

lattice-based cryptographyzero-knowledge proofselectronic voting

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A homomorphic LWE based E-voting scheme
• Post-quantum online voting scheme
• Lattice-based proof of shuffle and applications to electronic voting
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
• A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing

Cites work

• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• A homomorphic LWE based E-voting scheme
• A new identification scheme based on syndrome decoding
• Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
• COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
• Commitments and efficient zero-knowledge proofs from learning parity with noise
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
• LaBRADOR: compact proofs for R1CS from Module-SIS
• Lattice signatures without trapdoors
• Lattice-based proof of shuffle and applications to electronic voting
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• More efficient commitments from structured lattice assumptions
• On ideal lattices and learning with errors over rings
• On the concrete hardness of learning with errors
• One-shot verifiable encryption from lattices
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Practical product proofs for lattice commitments
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• 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
• cuHE: a homomorphic encryption accelerator library

This page was built for publication: Lattice-based zero-knowledge proofs in action: applications to electronic voting

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