Lattice-based proof of shuffle and applications to electronic voting

DOI10.1007/978-3-030-75539-3_10zbMATH Open1479.94115OpenAlexW3157647410MaRDI QIDQ826259FDOQ826259

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

Publication date: 20 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75539-3_10

Recommendations

• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
• Lattice-Based Proof of a Shuffle
• Verifiable elections that scale for free
• Verifiable Shuffle of Large Size Ciphertexts
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle

zbMATH Keywords

implementationlattice-based cryptographyelectronic votingverifiable encryptionproof of shufflereturn codes

Mathematics Subject Classification ID

Cryptography (94A60) Voting theory (91B12)

Cites Work

• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• (Leveled) fully homomorphic encryption without bootstrapping
• Lattice signatures without trapdoors
• An improved compression technique for signatures based on learning with errors
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• A toolkit for ring-LWE cryptography
• On the concrete hardness of learning with errors
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• More efficient commitments from structured lattice assumptions
• Practical product proofs for lattice commitments
• A homomorphic LWE based E-voting scheme
• COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
• One-shot verifiable encryption from lattices
• Lattice-Based Proof of a Shuffle

Cited In (11)

• Correction, Optimisation and Secure and Efficient Application of PBD Shuffling
• Lattice-Based Proof of a Shuffle
• Improved lattice-based mix-nets for electronic voting
• Post-quantum online voting scheme
• A homomorphic LWE based E-voting scheme
• Verifiable elections that scale for free
• Zero-knowledge range arguments for signed fractional numbers from lattices
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
• Provable security against decryption failure attacks from LWE
• Lattice-based zero-knowledge proofs in action: applications to electronic voting
• Shuffle arguments based on subset-checking

This page was built for publication: Lattice-based proof of shuffle and applications to electronic voting

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