Optimally Sound Sigma Protocols Under DCRA

DOI10.1007/978-3-319-70972-7_10zbMath1460.94053OpenAlexW2741362857MaRDI QIDQ5854433

Helger Lipmaa

Publication date: 17 March 2021

Published in: Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-70972-7_10

zbMATH Keywords

homomorphic encryptiondesignated verifiernon-interactive zero knowledgeculpable soundnessoptimal soundnessregistered public key model

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles
• Improved OR-Composition of Sigma-Protocols
• Designated Verifier Proofs and Their Applications
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• Square Span Programs with Applications to Succinct NIZK Arguments
• Making Sigma-Protocols Non-interactive Without Random Oracles
• NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
• Efficient Circuit-Size Independent Public Key Encryption with KDM Security
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Perfect NIZK with Adaptive Soundness
• Co-sound Zero-Knowledge with Public Keys
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Quadratic Span Programs and Succinct NIZKs without PCPs
• An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
• A Non-interactive Shuffle with Pairing Based Verifiability
• New Techniques for Noninteractive Zero-Knowledge
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Theory of Cryptography
• Advances in Cryptology - ASIACRYPT 2003