Efficient NIZK arguments with straight-line simulation and extraction

DOI10.1007/978-3-031-20974-1_1zbMath1527.94029OpenAlexW4312555105MaRDI QIDQ6164391

Ivan Visconti, Michele Ciampi

Publication date: 28 July 2023

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20974-1_1

zbMATH Keywords

non-interactive zero-knowledge proofcommon reference string modelFiat-Shamir type transform

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-knowledge proofs of knowledge for group homomorphisms
• Strengthening zero-knowledge protocols using signatures
• A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
• Improved OR-Composition of Sigma-Protocols
• Indistinguishable Proofs of Work or Knowledge
• Bounded-concurrent secure multi-party computation with a dishonest majority
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Knowledge Complexity of Interactive Proof Systems
• An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
• Advances in Cryptology - CRYPTO 2003
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Theory of Cryptography
• Improved straight-line extraction in the random oracle model with applications to signature aggregation

This page was built for publication: Efficient NIZK arguments with straight-line simulation and extraction