A generic transform from multi-round interactive proof to NIZK
From MaRDI portal
Publication:6088992
DOI10.1007/978-3-031-31371-4_16zbMath1526.94031OpenAlexW4367665628MaRDI QIDQ6088992
Adela Georgescu, Chen Qian, Weiqiang Wen, Adeline Roux-Langlois, Pierre-Alain Fouque
Publication date: 16 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-31371-4_16
Cites Work
- Unnamed Item
- Unnamed Item
- Hybrid commitments and their applications to zero-knowledge proof systems
- Zero-knowledge proofs of identity
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- The first collision for full SHA-1
- SOFIA: \(\mathcal{MQ}\)-based signatures in the QROM
- Signatures from sequential-OR proofs
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Does Fiat-Shamir require a cryptographic hash function?
- More efficient amortization of exact zero-knowledge proofs for LWE
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- New constructions of reusable designated-verifier NIZKs
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- 1-out-of-n Signatures from a Variety of Keys
- Blind Signature System
- Fiat-Shamir: from practice to theory
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
- How to Break MD5 and Other Hash Functions
- Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Theory of Cryptography
- Multi-theorem preprocessing NIZKs from lattices
This page was built for publication: A generic transform from multi-round interactive proof to NIZK
