Four-round Statistical Non-malleable Zero-knowledge

Susumu Kiyoshima

Paper 2025/1787

Four-round Statistical Non-malleable Zero-knowledge

Susumu Kiyoshima

, NTT Social Informatics Laboratories

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.

Note: (June 19, 2026) Minor editorial revisions only: corrected typos and refined phrasing throughout for improved readability. No technical content changed.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: A major revision of an IACR publication in TCC 2025
DOI: 10.1007/978-3-032-12290-2_5
Contact author(s): susumu kiyoshima @ ntt com
History: 2026-06-19: revised; 2025-09-30: received; See all versions
Short URL: https://ia.cr/2025/1787
License: CC BY

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},
      doi = {10.1007/978-3-032-12290-2_5},
      url = {https://eprint.iacr.org/2025/1787}
}