Lattice-Based Proof of a Shuffle

DOI10.1007/978-3-030-43725-1_23MaRDI QIDQ6166544zbMATH OpenFDO

Authors Ramiro Martínez, Paz Morillo

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

zbMATH Keywords

post-quantume-votingmix-netsproof of a shuffleRLWE commitmentRLWE encryption

Mathematics Subject Classification ID

Cryptography (94A60) Voting theory (91B12) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Recommendations

• A proof of the shuffle conjecture
• scientific article; zbMATH DE number 1842502
• Lattice-based proof of shuffle and applications to electronic voting
• Proofs of Restricted Shuffles
• A Commitment-Consistent Proof of a Shuffle
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
• Shuffling lattices
• Proof of the 2-part compositional shuffle conjecture
• The shuffle conjecture

Cites work

• scientific article; zbMATH DE number 1618058 (Why is no real title available?)
• scientific article; zbMATH DE number 1676659 (Why is no real title available?)
• scientific article; zbMATH DE number 1303140 (Why is no real title available?)
• scientific article; zbMATH DE number 1955805 (Why is no real title available?)
• scientific article; zbMATH DE number 1504554 (Why is no real title available?)
• scientific article; zbMATH DE number 1842502 (Why is no real title available?)
• A Commitment-Consistent Proof of a Shuffle
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• A decade of lattice cryptography
• A homomorphic LWE based E-voting scheme
• Amortization with fewer equations for proving knowledge of small secrets
• Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• Lattice-based Cryptography
• More efficient commitments from structured lattice assumptions
• Non-interactive zero-knowledge proofs in the quantum random oracle model
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Post-quantum security of Fiat-Shamir
• Proofs of Restricted Shuffles
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• Verifiable Shuffle of Large Size Ciphertexts
• Zero-knowledge argument for polynomial evaluation with application to blacklists

Cited in

(7)

• Shuffling lattices
• Proofs of Restricted Shuffles
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
• scientific article; zbMATH DE number 1842502 (Why is no real title available?)
• A short proof that shuffle squares are 7-avoidable
• Lattice-based proof of shuffle and applications to electronic voting
• Improved lattice-based mix-nets for electronic voting

This page was built for publication: Lattice-Based Proof of a Shuffle

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