Cryptology ePrint Archive: Report 2015/674

Preprocessing-Based Verification of Multiparty Protocols with Honest Majority

Peeter Laud and Alisa Pankova

Abstract: This paper presents a generic method for turning passively secure protocols into protocols secure against covert attacks, adding an offline preprocessing and a cheap post-execution verification phase. The execution phase, after which the computed result is already available to the parties, has only negligible overhead.

Our method uses shared verification based on precomputed multiplication triples. Such triples are often used to make the protocol execution itself faster, but in this work we make use of these triples especially for verification. The verification preserves the privacy guarantees of the original protocol, and it can be straightforwardly applied to protocols over finite rings, even if the same protocol performs its computation over several distinct rings at once.

Category / Keywords: cryptographic protocols / secure multiparty computation, verification

Date: received 4 Jul 2015

Contact author: peeter at cyber ee

Available format(s): PDF | BibTeX Citation

Version: 20150705:180527 (All versions of this report)

Short URL: ia.cr/2015/674

Discussion forum: Show discussion | Start new discussion