Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash

DOI10.1007/978-3-031-15802-5_16MaRDI QIDQ6155263zbMATH OpenOpenAlexFDO

Authors Susumu Kiyoshima

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

Mathematics Subject Classification ID

Cryptography (94A60) Artificial intelligence (68Txx)

Recommendations

• On round optimal statistical zero knowledge arguments
• Public-coin parallel zero-knowledge for NP
• Multi-collision resistance: a paradigm for keyless hash functions
• Constant-round leakage-resilient zero-knowledge from collision resistance
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors

Cites work

• scientific article; zbMATH DE number 4101089 (Why is no real title available?)
• scientific article; zbMATH DE number 1302862 (Why is no real title available?)
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• 3-message zero knowledge against human ignorance
• Advances in Cryptology – CRYPTO 2004
• Collision resistant hashing for paranoids: dealing with multiple collisions
• Definitions and properties of zero-knowledge proof systems
• Delegating computation: interactive proofs for muggles
• Distinguisher-dependent simulation in two rounds and its applications
• Extractable Perfectly One-Way Functions
• Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
• How to delegate computations
• How to delegate computations publicly
• Individual simulations
• Leakage-resilient zero knowledge
• Memory delegation
• Multi-collision resistance: a paradigm for keyless hash functions
• Multi-collision resistant hash functions and their applications
• On lattices, learning with errors, random linear codes, and cryptography
• On round optimal statistical zero knowledge arguments
• On the Composition of Zero-Knowledge Proof Systems
• On the existence of extractable one-way functions
• One-message zero knowledge and non-malleable commitments
• Promise zero knowledge and its applications to round optimal MPC
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
• The hunting of the SNARK
• Weak zero-knowledge beyond the black-box barrier
• Weakly extractable one-way functions

Cited in

(2)

• Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model

This page was built for publication: Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155263)