A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
From MaRDI portal
Publication:2128576
DOI10.1007/978-3-030-84245-1_20zbMath1486.94114OpenAlexW3192998623MaRDI QIDQ2128576
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_20
Related Items (5)
Witness-succinct universally-composable SNARKs ⋮ A generic transform from multi-round interactive proof to NIZK ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ A detailed analysis of Fiat-Shamir with aborts
Cites Work
- Unnamed Item
- Another look at ``provable security
- Tightly-secure key-encapsulation mechanism in the quantum random oracle model
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- SOFIA: \(\mathcal{MQ}\)-based signatures in the QROM
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- More efficient commitments from structured lattice assumptions
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Practical product proofs for lattice commitments
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- How to record quantum queries, and applications to quantum indifferentiability
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Post-quantum security of Fiat-Shamir
- Mitigating Multi-target Attacks in Hash-Based Signatures
- Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
- On the Non-malleability of the Fiat-Shamir Transform
- Quantum Proofs of Knowledge
- Lattice Signatures without Trapdoors
- Secure Identity-Based Encryption in the Quantum Random Oracle Model
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- Random Oracles in a Quantum World
- Trapdoors for hard lattices and new cryptographic constructions
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A new identification scheme based on syndrome decoding
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
