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

Dana Dachman-Soled, 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.

Available format(s)
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
Contact author(s)
jkatz @ cs umd edu
History
2014-11-26: revised
See all versions
Short URL
https://ia.cr/2014/858

CC BY

BibTeX

@misc{cryptoeprint:2014/858,
author = {Dana Dachman-Soled and Jonathan Katz and Vanishree Rao},
title = {Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds},
howpublished = {Cryptology ePrint Archive, Paper 2014/858},
year = {2014},
note = {\url{https://eprint.iacr.org/2014/858}},
url = {https://eprint.iacr.org/2014/858}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.