Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)

3 years 4 months ago
Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
Adaptively secure Multi-Party Computation (MPC) is an essential and fundamental notion in cryptography. In this work, we construct Universally Composable (UC) MPC protocols that are adaptively secure against all-but-one corruptions based on LWE. Our protocols have a constant number of rounds and communication complexity dependant only on the length of the inputs and outputs (it is independent of the circuit size). Such protocols were only known assuming an honest majority. Protocols in the dishonest majority setting, such as the work of Ishai et al. (CRYPTO 2008), require communication complexity proportional to the circuit size. In addition, constant-round adaptively secure protocols assuming dishonest majority are known to be impossible in the stand-alone setting with black-box proofs of security in the plain model. Here, we solve the problem in the UC setting using a set-up assumption which was shown necessary in order to achieve dishonest majority. The problem of constructing adapt...
Ivan Damgård, Antigoni Polychroniadou, Vanis
Added 08 Apr 2016
Updated 08 Apr 2016
Type Journal
Year 2016
Where PKC
Authors Ivan Damgård, Antigoni Polychroniadou, Vanishree Rao
Comments (0)