Paper 2015/674

Preprocessing-Based Verification of Multiparty Protocols with Honest Majority

Roman Jagomägis, Peeter Laud, and Alisa Pankova


This paper presents a generic “GMW-style” method for turning passively secure protocols into protocols secure against covert attacks, adding relatively cheap offline preprocessing and post-execution verification phases. In the preprocessing phase, each party generates and shares a sufficient amount of verified multiplication triples that will be later used to assist that party’s proof. The execution phase, after which the computed result is already available to the parties, has only negligible overhead that comes from signatures on sent messages. In the postprocessing phase, the verifiers repeat the computation of the prover in secret-shared manner, checking that they obtain the same messages that the prover sent out during execution. The verification preserves the privacy guarantees of the original protocol. It is applicable to protocols doing computations over finite rings, even if the same protocol performs its computation over several distinct rings. We apply our verification method to the Sharemind platform for secure multiparty computations (SMC), evaluate its performance and compare it to other existing SMC platforms offering security against stronger than passive attackers.

Available format(s)
Cryptographic protocols
Publication info
Preprint. MINOR revision.
secure multiparty computationverification
Contact author(s)
peeter @ cyber ee
2016-11-25: last of 2 revisions
2015-07-05: received
See all versions
Short URL
Creative Commons Attribution


      author = {Roman Jagomägis and Peeter Laud and Alisa Pankova},
      title = {Preprocessing-Based Verification of Multiparty Protocols with Honest Majority},
      howpublished = {Cryptology ePrint Archive, Paper 2015/674},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.