A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
From MaRDI portal
Publication:2799091
DOI10.1007/978-3-662-49099-0_4zbMath1377.94045OpenAlexW2255948324MaRDI QIDQ2799091
Michele Ciampi, Luisa Siniscalchi, Giuseppe Persiano, Ivan Visconti
Publication date: 8 April 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://link.springer.com/chapter/10.1007%2F978-3-662-49099-0_4
Related Items (10)
Confidential and efficient asset proof for bitcoin exchanges ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Interactive Oracle Proofs ⋮ A Shuffle Argument Secure in the Generic Model ⋮ A generic transform from multi-round interactive proof to NIZK ⋮ Efficient NIZK arguments with straight-line simulation and extraction ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hybrid commitments and their applications to zero-knowledge proof systems
- 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
- On Round-Optimal Zero Knowledge in the Bare Public-Key Model
- Making Sigma-Protocols Non-interactive Without Random Oracles
- The random oracle methodology, revisited
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
- Non-interactive and reusable non-malleable commitment schemes
- Efficient Zero Knowledge on the Internet
- Perfect Non-interactive Zero Knowledge for NP
- Zero Knowledge in the Random Oracle Model, Revisited
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Noninteractive Zero-Knowledge
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- The knowledge complexity of interactive proof-systems
- Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
- Why “Fiat-Shamir for Proofs” Lacks a Proof
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
- Advances in Cryptology - CRYPTO 2003
- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
- Zaps and Their Applications
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Automata, Languages and Programming
- Automata, Languages and Programming
- On Signatures of Knowledge
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
