A Non-interactive Shuffle with Pairing Based Verifiability

DOI10.1007/978-3-540-76900-2_4zbMath1153.94387OpenAlexW1676299812MaRDI QIDQ5387092

Steve Lu, Jens Groth

Publication date: 15 May 2008

Published in: Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76900-2_4

zbMATH Keywords

non-interactive zero-knowledgeShufflemix-netbilinear group

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (13)

More efficient shuffle argument from unique factorization ⋮ QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Reconciling non-malleability with homomorphic encryption ⋮ A Shuffle Argument Secure in the Generic Model ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ Verifiable Elections That Scale for Free ⋮ Linearly-homomorphic signatures and scalable mix-nets ⋮ Co-sound Zero-Knowledge with Public Keys ⋮ New Techniques for Non-interactive Shuffle and Range Arguments ⋮ Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge ⋮ Optimally Sound Sigma Protocols Under DCRA ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

This page was built for publication: A Non-interactive Shuffle with Pairing Based Verifiability