An efficient scheme for proving a shuffle
From MaRDI portal
Recommendations
- A Commitment-Consistent Proof of a Shuffle
- A proof of the shuffle conjecture
- Lattice-Based Proof of a Shuffle
- Proofs of Restricted Shuffles
- An efficient pairing-based shuffle argument
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Formal and precise analysis of soundness of several shuffling schemes
- Proof of the 2-part compositional shuffle conjecture
Cited in
(34)- Shuffle factorization is unique
- An efficient pairing-based shuffle argument
- Linearly-homomorphic signatures and scalable mix-nets
- On publicly-accountable zero-knowledge and small shuffle arguments
- Improved zero-knowledge argument of encrypted extended permutation
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
- New Techniques for Non-interactive Shuffle and Range Arguments
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Structure-preserving signatures and commitments to group elements
- An implementation of a universally verifiable electronic voting scheme based on shuffling
- A short proof that shuffle squares are 7-avoidable
- Privacy Preserving Data Mining within Anonymous Credential Systems
- Simplified Submission of Inputs to Protocols
- Proofs of Restricted Shuffles
- A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting
- Correction, Optimisation and Secure and Efficient Application of PBD Shuffling
- A Commitment-Consistent Proof of a Shuffle
- Formal and precise analysis of soundness of several shuffling schemes
- An Efficient Aggregate Shuffle Argument Scheme
- Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
- Electronic jury voting protocols
- A verifiable secret shuffle of homomorphic encryptions
- Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
- Lattice-Based Proof of a Shuffle
- Practical construction for secure trick-taking games even with cards set aside
- Shuffle arguments based on subset-checking
- Efficient succinct zero-knowledge arguments in the CL framework
- Efficient verifiable mixnets from lattices, revisited
- Shuffle invariance of the super-RSK algorithm
- Special soundness revisited
- Special soundness in the random oracle model
- On the complexity of iterated shuffle
- More efficient shuffle argument from unique factorization
This page was built for publication: An efficient scheme for proving a shuffle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4783736)
