Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
From MaRDI portal
Publication:5458603
DOI10.1007/978-3-540-78967-3_22zbMath1149.94319OpenAlexW2143374261MaRDI QIDQ5458603
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
Related Items
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, Mix-nets from re-randomizable and replayable CCA-secure public-key encryption, Lattice-Based Proof of a Shuffle, Dory: efficient, transparent arguments for generalised inner products and polynomial commitments, Formal and Precise Analysis of Soundness of Several Shuffling Schemes, 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