Efficient Zero-Knowledge Argument for Correctness of a Shuffle
From MaRDI portal
Recommendations
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- A more efficient computationally sound non-interactive zero-knowledge shuffle argument
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
- Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
- Applied Cryptography and Network Security
- Efficient culpably sound NIZK shuffle argument without random oracles
- scientific article; zbMATH DE number 1842502
- On publicly-accountable zero-knowledge and small shuffle arguments
Cited in
(56)- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Linearly-homomorphic signatures and scalable mix-nets
- Non-interactive anonymous router
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- On publicly-accountable zero-knowledge and small shuffle arguments
- Two-sided malicious security for private intersection-sum with cardinality
- Improved zero-knowledge argument of encrypted extended permutation
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
- Efficient culpably sound NIZK shuffle argument without random oracles
- New Techniques for Non-interactive Shuffle and Range Arguments
- Encryption switching protocols
- Automata evaluation and text search protocols with simulation-based security
- An implementation of a universally verifiable electronic voting scheme based on shuffling
- Non-interactive Zero-Knowledge Arguments for Voting
- Verifiable Rotation of Homomorphic Encryptions
- A Verifiable Secret Shuffe of Homomorphic Encryptions
- scientific article; zbMATH DE number 1842502 (Why is no real title available?)
- Verifiable elections that scale for free
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Making private function evaluation safer, faster, and simpler
- A Non-interactive Shuffle with Pairing Based Verifiability
- An Efficient Aggregate Shuffle Argument Scheme
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- Removing the strong RSA assumption from arguments over the integers
- Verifiable Shuffle of Large Size Ciphertexts
- How to challenge and cast your e-vote
- Public Key Cryptography – PKC 2004
- A verifiable secret shuffle of homomorphic encryptions
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
- PAPR: publicly auditable privacy revocation for anonymous credentials
- A theory of composition for differential obliviousness
- On the impossibility of algebraic vector commitments in pairing-free groups
- Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
- OnionPIR: effective protection of sensitive metadata in online communication networks
- Maliciously secure multi-client ORAM
- Scored anonymous credentials
- Practical construction for secure trick-taking games even with cards set aside
- Non-interactive anonymous router with quasi-linear router computation
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
- Succinct verification of compressed sigma protocols in the updatable SRS setting
- Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
- Mangrove: a scalable framework for folding-based SNARKs
- Shuffle arguments based on subset-checking
- Efficient succinct zero-knowledge arguments in the CL framework
- Permutation argument via bases transformation
- Efficient verifiable mixnets from lattices, revisited
- Jackpot: non-interactive aggregatable lotteries
- Shuffle invariance of the super-RSK algorithm
- Short paper: naysayer proofs
- More efficient lattice-based electronic voting from NTRU
- Secret-shared shuffle from authenticated correlations
- Computationally secure pattern matching in the presence of malicious adversaries
- Lattice-based proof of shuffle and applications to electronic voting
- More efficient shuffle argument from unique factorization
This page was built for publication: Efficient Zero-Knowledge Argument for Correctness of a Shuffle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894413)
