Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
From MaRDI portal
Publication:6155263
DOI10.1007/978-3-031-15802-5_16OpenAlexW4312659586MaRDI QIDQ6155263
Publication date: 12 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15802-5_16
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Definitions and properties of zero-knowledge proof systems
- One-message zero knowledge and non-malleable commitments
- Multi-collision resistant hash functions and their applications
- Collision resistant hashing for paranoids: dealing with multiple collisions
- Distinguisher-dependent simulation in two rounds and its applications
- The hunting of the SNARK
- Promise zero knowledge and its applications to round optimal MPC
- Weakly extractable one-way functions
- On round optimal statistical zero knowledge arguments
- Individual simulations
- Delegating Computation
- 3-Message Zero Knowledge Against Human Ignorance
- Extractable Perfectly One-Way Functions
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- On the Composition of Zero-Knowledge Proof Systems
- Memory Delegation
- Leakage-Resilient Zero Knowledge
- Weak zero-knowledge beyond the black-box barrier
- How to delegate computations publicly
- Multi-collision resistance: a paradigm for keyless hash functions
- How to delegate computations
- On the existence of extractable one-way functions
- Advances in Cryptology – CRYPTO 2004
- On lattices, learning with errors, random linear codes, and cryptography
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
