Cryptology ePrint Archive: Report 2014/858

Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds

Dana Dachman-Soled and Jonathan Katz and Vanishree Rao

Abstract: Cryptographic protocols with adaptive security ensure that security holds against an adversary who can dynamically determine which parties to corrupt as the protocol progresses---or even after the protocol is finished. In the setting where all parties may potentially be corrupted, and secure erasure is not assumed, it has been a long-standing open question to design secure-computation protocols with adaptive security running in constant rounds.

Here, we show a constant-round, universally composable protocol for computing any functionality, tolerating a malicious, adaptive adversary corrupting any number of parties. Interestingly, our protocol can compute all functionalities, not just adaptively well-formed ones.

Category / Keywords: cryptographic protocols / adaptive security

Date: received 19 Oct 2014, last revised 26 Nov 2014

Contact author: jkatz at cs umd edu

Available format(s): PDF | BibTeX Citation

Version: 20141126:143003 (All versions of this report)

Short URL: ia.cr/2014/858

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]