A Shuffle Argument Secure in the Generic Model

DOI10.1007/978-3-662-53890-6_28zbMath1407.94105OpenAlexW2556389018MaRDI QIDQ2953798

Helger Lipmaa, Prastudy Fauzi, Michał Zając

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 pairingszero knowledgemix-netshuffle argumentcommon reference stringgeneric bilinear group model

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

More efficient shuffle argument from unique factorization ⋮ On subversion-resistant SNARKs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A verifiable secret shuffle of homomorphic encryptions
• Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles
• A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
• Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs
• An Algebraic Framework for Diffie-Hellman Assumptions
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument
• Square Span Programs with Applications to Succinct NIZK Arguments
• Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
• The Realm of the Pairings
• Exponentiating in Pairing Groups
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• The knowledge complexity of interactive proof-systems
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• Why “Fiat-Shamir for Proofs” Lacks a Proof
• Quadratic Span Programs and Succinct NIZKs without PCPs
• On the existence of extractable one-way functions
• Advances in Cryptology – CRYPTO 2004
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• A Non-interactive Shuffle with Pairing Based Verifiability
• New Techniques for Noninteractive Zero-Knowledge
• Advances in Cryptology - CRYPTO 2003
• On the Size of Pairing-Based Non-interactive Arguments
• Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model
• Cryptography and Coding

This page was built for publication: A Shuffle Argument Secure in the Generic Model