Two-Round Maliciously Secure Computation with Super-Polynomial Simulation

Autor:	Amit Agarwal, Vipul Goyal, James Bartusek, Giulio Malavolta, Dakshita Khurana
Rok vydání:	2021
Předmět:	Polynomial business.industry Computer science Computation Secure multi-party computation business Protocol (object-oriented programming) Computer network
Zdroj:	Theory of Cryptography ISBN: 9783030904586 TCC (1)
DOI:	10.1007/978-3-030-90459-3_22
Popis:	We propose the first maliciously secure multi-party computation (MPC) protocol for general functionalities in two rounds, without any trusted setup. Since polynomial-time simulation is impossible in two rounds, we achieve the relaxed notion of superpolynomial-time simulation security [Pass, EUROCRYPT 2003]. Prior to our work, no such maliciously secure protocols were known even in the two-party setting for functionalities where both parties receive outputs. Our protocol is based on the sub-exponential security of standard assumptions plus a special type of non-interactive non-malleable commitment.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::9390d54e9a169d364de0769a31b6564f https://doi.org/10.1007/978-3-030-90459-3_22 Zobrazit plný text záznamu