Paper Info
Title
Non-Interactive Multiparty Computation Without Correlated Randomness.
Abstract
We study the problem of non-interactive multiparty computation (NI-MPC) where a group of completely asynchronous parties can evaluate a function over their joint inputs by sending a single message to an evaluator who computes the output. Previously, the only general solutions to this problem that resisted collusions between the evaluator and a set of parties were based on multi-input functional encryption and required the use of complex correlated randomness setup. In this work, we present a new solution for NI-MPC against arbitrary collusions using a public-key infrastructure (PKI) setup supplemented with a common random string. A PKI is, in fact, the minimal setup that one can hope for in this model in order to achieve a meaningful "best possible" notion of security, namely, that an adversary that corrupts the evaluator and an arbitrary set of parties only learns the residual function obtained by restricting the function to the inputs of the uncorrupted parties. Our solution is based on indistinguishability obfuscation and DDH both with sub-exponential security. We extend this main result to the case of general interaction patterns, providing the above best possible security that is achievable for the given interaction. Our main result gives rise to a novel notion of (public-key) multiparty obfuscation, where n parties can independently obfuscate program modules M-i such that the obfuscated modules, when put together, exhibit the functionality of the program obtained by "combining" the underlying modules M-i. This notion may be of independent interest.
Year
DOI
Venue
2017
10.1007/978-3-319-70700-6_7
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2017, PT III
DocType
Volume
ISSN
Journal
10626
0302-9743
Citations 
PageRank 
References 
2
0.37
20
Authors
6
Name
Order
Citations
PageRank
Shai Halevi17203442.70
Yuval Ishai24364246.22
Abhishek Jain342.41
Ilan Komargodski411317.69
Amit Sahai513566545.52
Eylon Yogev65411.30