Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
type: Item
instance of: scholarly article
title: Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
DOI: 10.1007/978-3-031-15802-5_16
author: Susumu Kiyoshima
published in: Advances in Cryptology – CRYPTO 2022
publication date: 2023-06-12T00:00:00Z
Mathematics Subject Classification ID: 68Txx
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7694627
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-031-15802-5 16
OpenAlex ID: W4312659586
cites work: Promise zero knowledge and its applications to round optimal MPC
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Multi-collision resistant hash functions and their applications
cites work: 3-Message Zero Knowledge Against Human Ignorance
cites work: The hunting of the SNARK
cites work: On the existence of extractable one-way functions
cites work: Weakly extractable one-way functions
cites work: Multi-collision resistance: a paradigm for keyless hash functions
cites work: Weak zero-knowledge beyond the black-box barrier
cites work: One-message zero knowledge and non-malleable commitments
cites work: On round optimal statistical zero knowledge arguments
cites work: Q3826476
cites work: Extractable Perfectly One-Way Functions
cites work: Memory Delegation
cites work: Individual simulations
cites work: Leakage-Resilient Zero Knowledge
cites work: On the Composition of Zero-Knowledge Proof Systems
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: Definitions and properties of zero-knowledge proof systems
cites work: Delegating Computation
cites work: Q4249347
cites work: Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
cites work: Distinguisher-dependent simulation in two rounds and its applications
cites work: SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
cites work: How to delegate computations publicly
cites work: How to delegate computations
cites work: Collision resistant hashing for paranoids: dealing with multiple collisions
cites work: Q4434874
cites work: On lattices, learning with errors, random linear codes, and cryptography
description: scientific article; zbMATH DE number 7694627