Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations

ePrint Report: Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations

Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi

We construct the first four-round non-malleable commitment scheme based solely on the black-box use of one-to-one one-way functions. Prior to our work, all non-malleable commitment schemes based on black-box use of polynomial-time cryptographic primitives require more than $16$ rounds of interaction.

A key tool for our construction is a proof system that satisfies a new definition of security that we call non-malleable zero-knowledge with respect …

box eprint report non