The following pages link to Proofs of Restricted Shuffles (Q3558306):
Displaying 4 items.
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- More efficient shuffle argument from unique factorization (Q826262) (← links)
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle (Q2670855) (← links)
- Verifiable Multi-party Computation with Perfectly Private Audit Trail (Q2822682) (← links)
