CryptoDB
Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations
| Authors: |
|
|---|---|
| Download: | |
| Presentation: | Slides |
| Conference: | TCC 2022 |
| Abstract: | 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 to commitments. In a nutshell, such a proof system can be safely run in parallel with any (potentially interactive) commitment scheme. We provide an instantiation of this tool using the MPC-in-the-Head approach in combination with BMR. The resulting protocol makes black-box use of one-to-one one-way functions. |
BibTeX
@inproceedings{tcc-2022-32568,
title={Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations},
publisher={Springer-Verlag},
author={Michele Ciampi and Emmanuela Orsini and Luisa Siniscalchi},
year=2022
}