An efficient pairing-based shuffle argument
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1842502
- An Efficient Aggregate Shuffle Argument Scheme
- More efficient shuffle argument from unique factorization
- On the complexity of iterated shuffle
- A generalization of the perfect shuffle
- New Techniques for Non-interactive Shuffle and Range Arguments
- CacheShuffle: a family of oblivious shuffles
- Perfect shuffling by lazy swaps
- A proof of the shuffle conjecture
- A Non-interactive Shuffle with Pairing Based Verifiability
Cited in
(18)- More efficient shuffle argument from unique factorization
- A unified framework for non-universal SNARKs
- New Techniques for Non-interactive Shuffle and Range Arguments
- A more efficient computationally sound non-interactive zero-knowledge shuffle argument
- Efficient culpably sound NIZK shuffle argument without random oracles
- A shuffle argument secure in the generic model
- scientific article; zbMATH DE number 1842502 (Why is no real title available?)
- Another look at extraction and randomization of Groth's zk-SNARK
- On QA-NIZK in the BPK model
- Linearly-homomorphic signatures and scalable mix-nets
- Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
- On publicly-accountable zero-knowledge and small shuffle arguments
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- A non-interactive shuffle argument with low trust assumptions
- Shuffle algorithm for singular 2-D system
- Identity-based authenticated encryption with identity confidentiality
- Shuffle arguments based on subset-checking
- Efficient succinct zero-knowledge arguments in the CL framework
This page was built for publication: An efficient pairing-based shuffle argument
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703916)
