Paper 2022/820
Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash
Abstract
We construct a public-coin 3-round zero-knowledge argument for NP assuming (i) the sub-exponential hardness of the learning with errors (LWE) problem and (ii) the existence of keyless multi-collision-resistant hash functions against slightly super-polynomial-time adversaries. These assumptions are almost identical to those that were used recently to obtain a private-coin 3-round zero-knowledge argument [Bitansky et al., STOC 2018]. (The difference is that we assume sub-exponential hardness instead of quasi-polynomial hardness for the LWE problem.)
Note: (June 23, 2022) Minor revision to add a citation and make a cosmetic change.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- A major revision of an IACR publication in CRYPTO 2022
- Keywords
- zero-knowledge multi-collision-resistant hash
- Contact author(s)
- susumu kiyoshima @ ntt-research com
- History
- 2022-06-24: revised
- 2022-06-22: received
- See all versions
- Short URL
- https://ia.cr/2022/820
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/820,
author = {Susumu Kiyoshima},
title = {Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash},
howpublished = {Cryptology ePrint Archive, Paper 2022/820},
year = {2022},
note = {\url{https://eprint.iacr.org/2022/820}},
url = {https://eprint.iacr.org/2022/820}
}
