Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle

DOI10.1007/978-3-662-63958-0_27zbMath1492.91116OpenAlexW3157502586MaRDI QIDQ2670855

Ramiro Martínez, Javier Herranz, Manuel A. Sánchez

Publication date: 1 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-662-63958-0_27

zbMATH Keywords

lattice-based cryptographyzero-knowledgeelectronic votingverifiable shuffle

Mathematics Subject Classification ID

Voting theory (91B12) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice-based proof of shuffle and applications to electronic voting
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Securing Abe's mix-net against malicious verifiers via witness indistinguishability
• A non-PCP approach to succinct quantum-safe zero-knowledge
• The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Lattice Signatures without Trapdoors
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Proofs of Restricted Shuffles
• A Commitment-Consistent Proof of a Shuffle
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• On Ideal Lattices and Learning with Errors over Rings
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• A Permutation Network
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Verifiable Shuffle of Large Size Ciphertexts
• Lattice-Based Proof of a Shuffle

This page was built for publication: Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle