International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Four-round Statistical Non-malleable Zero-knowledge

Authors:
Susumu Kiyoshima , NTT Social Informatics Laboratories
Download:
Search ePrint
Search Google
Conference: TCC 2025
Abstract: We present a 4-round statistical non-malleable zero-knowledge (NMZK) argument 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.
BibTeX
@inproceedings{tcc-2025-36195,
  title={Four-round Statistical Non-malleable Zero-knowledge},
  publisher={Springer-Verlag},
  author={Susumu Kiyoshima},
  year=2025
}