Cryptology ePrint Archive: Report 2021/843

Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (Timed) Assumptions

Brandon Broadnax and Jeremias Mechler and Jörn Müller-Quade

Abstract: Starting with the work of Rivest et al. in 1996, timed assumptions have found many applications in cryptography, building e.g. the foundation of the blockchain technology. They also have been used in the context of classical MPC, e.g. to enable fairness. We follow this line of research to obtain composable generic MPC in the plain model. This approach comes with a major advantage regarding environmental friendliness, a property coined by Canetti et al. (FOCS 2013). Informally, this means that our constructions do not “hurt” game-based security properties of protocols that hold against polynomial-time adversaries when executed alone. As an additional property, they can be plugged into any UC-secure protocol without loss of security. Towards proving the security of our constructions, we introduce a variant of the UC security notion that captures timed cryptographic assumptions. Combining standard timed commitments and standard polynomial-time hardness assumptions, we construct a composable commitment scheme in the plain model. As this construction is constant-round and black-box, we obtain the first fully environmentally friendly composable constant-round black-box generic MPC protocol in the plain model from standard (timed) assumptions.

Category / Keywords: foundations /

Date: received 21 Jun 2021

Contact author: jeremias mechler at kit edu

Available format(s): PDF | BibTeX Citation

Version: 20210621:193831 (All versions of this report)

Short URL: ia.cr/2021/843


[ Cryptology ePrint archive ]