Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Efficient Zero-Knowledge Argument for Correctness of a Shuffle - MaRDI portal

Efficient Zero-Knowledge Argument for Correctness of a Shuffle

From MaRDI portal
Publication:2894413

DOI10.1007/978-3-642-29011-4_17zbMath1297.94045OpenAlexW111294696MaRDI QIDQ2894413

Stephanie Bayer, Jens Groth

Publication date: 29 June 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_17




Related Items (23)

More efficient shuffle argument from unique factorizationUpdateable Inner Product Argument with Logarithmic Verifier and ApplicationsAutomata evaluation and text search protocols with simulation-based securityImproved zero-knowledge argument of encrypted extended permutationMaking Private Function Evaluation Safer, Faster, and SimplerShorter lattice-based zero-knowledge proofs for the correctness of a shuffleHyperPlonk: Plonk with linear-time prover and high-degree custom gatesAlmost tightly-secure re-randomizable and replayable CCA-secure public key encryptionPAPR: publicly auditable privacy revocation for anonymous credentialsA theory of composition for differential obliviousnessOn the impossibility of algebraic vector commitments in pairing-free groupsMix-nets from re-randomizable and replayable CCA-secure public-key encryptionRemoving the Strong RSA Assumption from Arguments over the IntegersComputationally secure pattern matching in the presence of malicious adversariesMarlin: preprocessing zkSNARKs with universal and updatable SRSLinearly-homomorphic signatures and scalable mix-netsNon-interactive anonymous routerAn improvement of multi-exponentiation with encrypted bases argument: smaller and fasterNew Techniques for Non-interactive Shuffle and Range ArgumentsOn publicly-accountable zero-knowledge and small shuffle argumentsEncryption Switching ProtocolsHow to Challenge and Cast Your e-VoteTwo-sided malicious security for private intersection-sum with cardinality




This page was built for publication: Efficient Zero-Knowledge Argument for Correctness of a Shuffle