Paper 2019/974

Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE

Abdelrahaman Aly, Emmanuela Orsini, Dragos Rotaru, Nigel P. Smart, and Tim Wood

Abstract

We present modifications to the MPC system SCALE-MAMBA to enable the evaluation of garbled circuit (GC) based MPC functionalities and Linear Secret Sharing (LSSS) based MPC functionalities along side each other. This allows the user to switch between different MPC paradigms to achieve the best performance. To do this we present modifications to the GC-based MPC protocol of Hazay et al. (Asiacrypt 2017) (to enable it to support reactive computation), and combine different aspects of their pre-processing phase with those of Wang et al. (CCS 2017), in order to optimize our pre-processing protocols. We also give a more efficient method for producing daBits (double authenticated Bits) than that presented in the work of Rotaru and Wood (ePrint 2019). Finally, we examine how the functionality can be integrated within the existing MPC framework SCALE-MAMBA

Note: fixed typo

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Major revision. WAHC 2019
Contact author(s)
abdelrahaman aly @ esat kuleuven be
emmanuela orsini @ kuleuven be
dragos rotaru @ esat kuleuven be
nigel smart @ kuleuven be
t wood @ kuleuven be
History
2019-09-14: last of 2 revisions
2019-08-29: received
See all versions
Short URL
https://ia.cr/2019/974
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/974,
      author = {Abdelrahaman Aly and Emmanuela Orsini and Dragos Rotaru and Nigel P.  Smart and Tim Wood},
      title = {Zaphod: Efficiently Combining {LSSS} and Garbled Circuits in {SCALE}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/974},
      year = {2019},
      url = {https://eprint.iacr.org/2019/974}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.