אנטיגוני פוליקרוניאד (אונ' ארהוס)
יום רביעי, 2.7.2014, 12:30
Secure multiparty computation is an extremely strong and important tool for making distributed computing more secure. General solutions to the problem allow us to carry out any desired computation among a set of players, while making sure that the result is correct and furthermore that this result is the only new information released. This should even hold if some of the players have been corrupted by an adversary. An important issue in this connection is how the adversary chooses which players to target. In the static model, the adversary must choose who to corrupt before the protocol starts. A more general and also more realistic model is the adaptive corruption where the adversary may corrupt new players during the protocol.
Of course efficiency of the protocol is also desired, and the measures in this respect are communication and round complexity.
Therefore, achieving constant round protocols with low communication complexity while still getting the best possible security is an interesting research goal.
During the talk I am going to present an adaptively secure universally composable multiparty computation protocol with dishonest majority and a constant number of rounds achieving low communication complexity. More specifically, the evaluation phase of our protocol is carried out locally by each party, therefore there is no interaction. We achieve the result by combining Fully Homomorphic Encryption with an adaptively secure but non-constant round protocol by Damgaard and Nielsen [DN03].
Joint work with Ivan Damgaard and Vanishree Rao.