A shuffle argument secure in the generic model

DOI10.1007/978-3-662-53890-6_28MaRDI QIDQ2953798zbMATH OpenOpenAlexFDO

Authors Prastudy Fauzi, Helger Lipmaa, Michal Zajac

Publication date 6 January 2017

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

Full work available at URL https://doi.org/10.1007/978-3-662-53890-6_28

zbMATH Keywords

bilinear pairingscommon reference stringgeneric bilinear group modelmix-netshuffle argumentzero knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• An efficient pairing-based shuffle argument
• Efficient culpably sound NIZK shuffle argument without random oracles
• A more efficient computationally sound non-interactive zero-knowledge shuffle argument
• A non-interactive shuffle argument with low trust assumptions
• Verifiable Shuffle of Large Size Ciphertexts

Cites work

• A more efficient computationally sound non-interactive zero-knowledge shuffle argument
• A Non-interactive Shuffle with Pairing Based Verifiability
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• A verifiable secret shuffle of homomorphic encryptions
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology – CRYPTO 2004
• An algebraic framework for Diffie-Hellman assumptions
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Automated unbounded analysis of cryptographic constructions in the generic group model
• Cryptography and Coding
• Efficient culpably sound NIZK shuffle argument without random oracles
• Exponentiating in pairing groups
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• scientific article; zbMATH DE number 1583798 (Why is no real title available?)
• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• New techniques for noninteractive zero-knowledge
• On the existence of extractable one-way functions
• On the size of pairing-based non-interactive arguments
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Prover-efficient commit-and-prove zero-knowledge SNARKs
• Quadratic span programs and succinct NIZKs without PCPs
• Short pairing-based non-interactive zero-knowledge arguments
• Square span programs with applications to succinct NIZK arguments
• Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
• The knowledge complexity of interactive proof-systems
• The realm of the pairings
• Why ``Fiat-Shamir for proofs lacks a proof

Cited in

(7)

• On subversion-resistant SNARKs
• On publicly-accountable zero-knowledge and small shuffle arguments
• Efficient culpably sound NIZK shuffle argument without random oracles
• A more efficient computationally sound non-interactive zero-knowledge shuffle argument
• Succinct malleable NIZKs and an application to compact shuffles
• A non-interactive shuffle argument with low trust assumptions
• More efficient shuffle argument from unique factorization

This page was built for publication: A shuffle argument secure in the generic model

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