CryptoDB

Paper: Secure Computation with Low Communication from Cross-Checking

Authors: S. Dov Gordon Samuel Ranellucci Xiao Wang DOI: 10.1007/978-3-030-03332-3_3 Search ePrint Search Google Slides ASIACRYPT 2018 We construct new four-party protocols for secure computation that are secure against a single malicious corruption. Our protocols can perform computations over a binary ring, and require sending just 1.5 ring elements per party, per gate. In the special case of Boolean circuits, this amounts to sending 1.5 bits per party, per gate. One of our protocols is robust, yet requires almost no additional communication. Our key technique can be viewed as a variant of the “dual execution” approach, but, because we rely on four parties instead of two, we can avoid any leakage, achieving the standard notion of security.
BibTeX
@inproceedings{asiacrypt-2018-29184,
title={Secure Computation with Low Communication from Cross-Checking},
booktitle={Advances in Cryptology – ASIACRYPT 2018},
series={Lecture Notes in Computer Science},
publisher={Springer},
volume={11274},
pages={59-85},
doi={10.1007/978-3-030-03332-3_3},
author={S. Dov Gordon and Samuel Ranellucci and Xiao Wang},
year=2018
}