Paper 2025/1787 Original: eprint.iacr.org/2025/1787 ↗
Four-round Statistical Non-malleable Zero-knowledge
Abstract
We present a 4-round statistical non-malleable zero-knowledge (statistical NMZK) argument for NP in the plain model under standard hardness assumptions. Our construction can be based on any collision-resistant hash function and injective one-way function, and it guarantees simulation extractability in the delayed-input, one-many setting. Before this work, 4-round constructions were known for computational NMZK but not for statistical NMZK.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2026-06-19: last updated
- 2025-09-30: published
- Short URL
- https://ia.cr/2025/1787
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2025/1787,
author = {Susumu Kiyoshima},
title = {Four-round Statistical Non-malleable Zero-knowledge},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1787},
year = {2025},
url = {https://eprint.iacr.org/2025/1787}
}