Paper 2019/1098

Full-Threshold Actively-Secure Multiparty Arithmetic Circuit Garbling

Eleftheria Makri and Tim Wood


In this work, we show how to garble arithmetic circuits with full active security in the general multiparty setting, secure in the full-threshold setting (that is, when only one party is assumed honest). Our solution allows interfacing Boolean garbled circuits with arithmetic garbled circuits. Previous works in the arithmetic circuit domain focused on the 2-party setting, or on semi-honest security and assuming an honest majority -- notably, the work of Ben-Efraim (Asiacrypt 2018) in the semi-honest, honest majority security model, which we adapt and extend. As an additional contribution, we improve on Ben-Efraim's selector gate. A selector gate is a gate that given two arithmetic inputs and one binary input, outputs one of the arithmetic inputs, based on the value of the selection bit input. Our new construction for the selector gate reduces the communication cost to almost half of that of Ben-Efraim's gate. This result applies both to the semi-honest and to the active security model.

Available format(s)
Cryptographic protocols
Publication info
Preprint. MINOR revision.
multiparty computationarithmetic garblingfull-threshold active security
Contact author(s)
emakri @ esat kuleuven be
2021-07-14: last of 7 revisions
2019-09-29: received
See all versions
Short URL
Creative Commons Attribution


      author = {Eleftheria Makri and Tim Wood},
      title = {Full-Threshold Actively-Secure Multiparty Arithmetic Circuit Garbling},
      howpublished = {Cryptology ePrint Archive, Paper 2019/1098},
      year = {2019},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.