Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle

DOI10.1007/978-3-540-78967-3_22MaRDI QIDQ5458603zbMATH OpenOpenAlexFDO

Authors Jens Groth, Yuval Ishai

Publication date 15 April 2008

Published in Advances in Cryptology – EUROCRYPT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78967-3_22

zbMATH Keywords

homomorphic encryptionmix-netShufflesub-linear communicationzero-knowledge argument

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
• A more efficient computationally sound non-interactive zero-knowledge shuffle argument
• Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
• Applied Cryptography and Network Security
• A non-interactive shuffle argument with low trust assumptions
• Efficient culpably sound NIZK shuffle argument without random oracles
• On publicly-accountable zero-knowledge and small shuffle arguments
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security

Cited in

(23)

• Transparent SNARKs from DARK compilers
• Linearly-homomorphic signatures and scalable mix-nets
• Efficient range proofs with transparent setup from bounded integer commitments
• On publicly-accountable zero-knowledge and small shuffle arguments
• Tight state-restoration soundness in the algebraic group model
• Black-box accumulation based on lattices
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
• An optimized inner product argument with more application scenarios
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• Formal and precise analysis of soundness of several shuffling schemes
• A Non-interactive Shuffle with Pairing Based Verifiability
• Verifiable Shuffle of Large Size Ciphertexts
• A verifiable secret shuffle of homomorphic encryptions
• Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
• Lattice-Based Proof of a Shuffle
• Efficient transparent polynomial commitments for zk-SNARKs
• Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
• Shuffle arguments based on subset-checking
• Efficient succinct zero-knowledge arguments in the CL framework
• Efficient verifiable mixnets from lattices, revisited
• Shuffle invariance of the super-RSK algorithm

This page was built for publication: Sub-linear 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 Q5458603)