A Non-interactive Shuffle with Pairing Based Verifiability

DOI10.1007/978-3-540-76900-2_4MaRDI QIDQ5387092zbMATH OpenOpenAlexFDO

Authors Jens Groth, Steve Lu

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

bilinear groupmix-netnon-interactive zero-knowledgeShuffle

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Verifiable Shuffle of Large Size Ciphertexts
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• A verifiable secret shuffle of homomorphic encryptions

Cited in

(27)

• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• An efficient pairing-based shuffle argument
• Linearly-homomorphic signatures and scalable mix-nets
• Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Reconciling non-malleability with homomorphic encryption
• New Techniques for Non-interactive Shuffle and Range Arguments
• Malleable proof systems and applications
• A shuffle argument secure in the generic model
• The kernel matrix Diffie-Hellman assumption
• Secure Multi-party Shuffling
• How to Shuffle in Public
• Co-sound Zero-Knowledge with Public Keys
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• Applied Cryptography and Network Security
• Succinct malleable NIZKs and an application to compact shuffles
• Verifiable elections that scale for free
• QA-NIZK arguments of same opening for bilateral commitments
• VERIFICATION OF A PAILLIER BASED SHUFFLE USING REPRESENTATIONS OF THE SYMMETRIC GROUP
• A Sender Verifiable Mix-Net and a New Proof of a Shuffle
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Verifiable Shuffle of Large Size Ciphertexts
• Optimally sound sigma protocols under DCRA
• Public Key Cryptography – PKC 2004
• A verifiable secret shuffle of homomorphic encryptions
• A non-interactive shuffle argument with low trust assumptions
• More efficient shuffle argument from unique factorization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387092)