Lattice-Based Proof of a Shuffle
From MaRDI portal
Publication:6166544
DOI10.1007/978-3-030-43725-1_23zbMath1520.91138MaRDI QIDQ6166544
Paz Morillo, Ramiro Martínez, Unnamed Author
Publication date: 3 August 2023
Published in: Financial Cryptography and Data Security (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/180187
Voting theory (91B12) Cryptography (94A60) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Related Items (3)
Lattice-based proof of shuffle and applications to electronic voting ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ Improved lattice-based mix-nets for electronic voting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Amortization with fewer equations for proving knowledge of small secrets
- More efficient commitments from structured lattice assumptions
- Post-quantum security of Fiat-Shamir
- A Homomorphic LWE Based E-voting Scheme
- A Decade of Lattice Cryptography
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- Proofs of Restricted Shuffles
- On Ideal Lattices and Learning with Errors over Rings
- Lattice-based Cryptography
- 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
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack
- Verifiable Shuffle of Large Size Ciphertexts
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Lattice-Based Proof of a Shuffle
