Cryptology ePrint Archive: Report 2017/912

On Two Round Rerunnable MPC Protocols

Paul Laird

Abstract: Two-rounds are minimal for all MPC protocols in the absence of a trusted PKI, however certain protocols allow the reuse of inputs for different functions, or the re-evaluation of the same function on different inputs without the re-distribution of public key information. These can achieve an amortised round complexity of below two rounds per computation. Function rerunnable MPC has been achieved using FHE, while additive homomorphic properties of DH-based cryptosystems have been used to allow input rerunnable protocols. These differ in properties such as computational cost per execution, collusion tolerance and number of rounds supported. We discuss the characteristics of some rerunnable protocols, and present a proof of the rerunnable aggregation protocol of Kursawe, Danezis and Katz from the Decisional Bilinear Diffie Hellman Assumption.

Category / Keywords: cryptographic protocols / Rerunnable Multiparty Protocols

Date: received 19 Sep 2017

Contact author: paul laird at dit ie

Available format(s): PDF | BibTeX Citation

Note: Preliminary version including proof of Bilinear pairing based rerunnable aggregation protocol of Kursawe, Danezis and Katz.

Version: 20170924:215314 (All versions of this report)

Short URL: ia.cr/2017/912

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]