A New Approach to Post-Quantum Non-Malleability

TL;DR

This paper introduces the first constant-round post-quantum non-malleable commitment scheme based on minimal assumptions, simplifying previous multi-round protocols and enabling new applications in quantum-secure multiparty computation.

Contribution

It presents a novel technique for constant-round non-malleable commitments in the post-quantum setting, with an elementary proof and broad implications.

Findings

Achieves constant-round non-malleable commitments under minimal assumptions.

Provides an elementary proof of security for classical non-malleable commitments.

Enables first constant-round quantum-secure multiparty computation in the plain model.

Abstract

We provide the first $\mathit{constant}$-$\mathit{round}$ construction of post-quantum non-malleable commitments under the minimal assumption that $\mathit{post}$-$\mathit{quantum}$ $\mathit{one}$-$\mathit{way}$ $\mathit{functions}$ exist. We achieve the standard notion of non-malleability with respect to commitments. Prior constructions required $\Omega(\log^*\lambda)$ rounds under the same assumption. We achieve our results through a new technique for constant-round non-malleable commitments which is easier to use in the post-quantum setting. The technique also yields an almost elementary proof of security for constant-round non-malleable commitments in the classical setting, which may be of independent interest. When combined with existing work, our results yield the first constant-round quantum-secure multiparty computation for both classical and quantum functionalities $\mathit{in}$ $\mathit{the}$ $\mathit{plain}$ $\mathit{model}$, under the $\mathit{polynomial}$ hardness of quantum fully-homomorphic encryption and quantum learning with errors.