Proofs of Restricted Shuffles
From MaRDI portal
Publication:3558306
DOI10.1007/978-3-642-12678-9_7zbMATH Open1284.94117OpenAlexW2171228961MaRDI QIDQ3558306FDOQ3558306
Authors: Björn Terelius, Douglas Wikström 
Publication date: 4 May 2010
Published in: Progress in cryptology -- AFRICACRYPT 2010. Third international conference on cryptology in Africa, Stellenbosch, South Africa, May 3--6, 2010. Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12678-9_7
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 (14)
- More efficient shuffle argument from unique factorization
- Lattice-Based Proof of a Shuffle
- PFE: linear active security, double-shuffle proofs, and low-complexity communication
- Title not available (Why is that?)
- Improving the Performance of Cryptographic Voting Protocols
- Verifiable multi-party computation with perfectly private audit trail
- Formal and precise analysis of soundness of several shuffling schemes
- Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
- Computationally secure pattern matching in the presence of malicious adversaries
- A Bijective Proof of Stanley's Shuffling Theorem
- Malleable proof systems and applications
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
- A short proof that shuffle squares are 7-avoidable
- Succinct malleable NIZKs and an application to compact shuffles
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)
