Proofs of Restricted Shuffles
From MaRDI portal
Publication:3558306
Recommendations
- A proof of the shuffle conjecture
- scientific article; zbMATH DE number 1842502
- Lattice-Based Proof of a Shuffle
- Proof of the 2-part compositional shuffle conjecture
- Bijective proofs of shuffle compatibility results
- A Commitment-Consistent Proof of a Shuffle
- A Bijective Proof of Stanley's Shuffling Theorem
- The shuffle conjecture
- New combinatorial formulations of the shuffle conjecture
Cited in
(16)- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
- Verifiable multi-party computation with perfectly private audit trail
- Malleable proof systems and applications
- A short proof that shuffle squares are 7-avoidable
- A Bijective Proof of Stanley's Shuffling Theorem
- scientific article; zbMATH DE number 1842502 (Why is no real title available?)
- Succinct malleable NIZKs and an application to compact shuffles
- Formal and precise analysis of soundness of several shuffling schemes
- Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
- Improving the Performance of Cryptographic Voting Protocols
- Lattice-Based Proof of a Shuffle
- PFE: linear active security, double-shuffle proofs, and low-complexity communication
- Efficient verifiable mixnets from lattices, revisited
- Special soundness revisited
- Computationally secure pattern matching in the presence of malicious adversaries
- More efficient shuffle argument from unique factorization
This page was built for publication: Proofs of Restricted Shuffles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558306)