Lattice-based proof of shuffle and applications to electronic voting
type: Item
instance of: scholarly article
title: Lattice-based proof of shuffle and applications to electronic voting
zbMATH Open document ID: 1479.94115
DOI: 10.1007/978-3-030-75539-3_10
author: Diego F. Aranha
author: Carsten Baum
author: Kristian Gjøsteen
author: Tjerand Silde
author: Thor Tunge
publication date: 2021-12-20T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 91B12
zbMATH DE Number: 7449879
zbMATH Keywords: lattice-based cryptography
zbMATH Keywords: proof of shuffle
zbMATH Keywords: verifiable encryption
zbMATH Keywords: return codes
zbMATH Keywords: electronic voting
zbMATH Keywords: implementation
MaRDI profile type: Publication
full work available at URL: 978-3-030-75539-3 10
OpenAlex ID: W3157647410
cites work: On the concrete hardness of learning with errors
cites work: Practical product proofs for lattice commitments
cites work: An Improved Compression Technique for Signatures Based on Learning with Errors
cites work: More efficient commitments from structured lattice assumptions
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: A Homomorphic LWE Based E-voting Scheme
cites work: Lattice-Based Proof of a Shuffle
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
cites work: Lattice Signatures without Trapdoors
cites work: One-Shot Verifiable Encryption from Lattices
cites work: A Toolkit for Ring-LWE Cryptography
cites work: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
cites work: COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
description: scientific article; zbMATH DE number 7449879