Secure computation with low communication from cross-checking

S. Dov Gordon*, Samuel Ranellucci, Xiao Wang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
EditorsThomas Peyrin, Steven Galbraith
PublisherSpringer Verlag
Pages59-85
Number of pages27
ISBN (Print)9783030033316
DOIs
StatePublished - Jan 1 2018
Event24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018 - Brisbane, Australia
Duration: Dec 2 2018Dec 6 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11274 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018
CountryAustralia
CityBrisbane
Period12/2/1812/6/18

Fingerprint

Secure Computation
Communication
Boolean Circuits
Ring
Leakage
Networks (circuits)
Binary

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Dov Gordon, S., Ranellucci, S., & Wang, X. (2018). Secure computation with low communication from cross-checking. In T. Peyrin, & S. Galbraith (Eds.), Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 59-85). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11274 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-03332-3_3
Dov Gordon, S. ; Ranellucci, Samuel ; Wang, Xiao. / Secure computation with low communication from cross-checking. Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. editor / Thomas Peyrin ; Steven Galbraith. Springer Verlag, 2018. pp. 59-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{112e8060d7144b9bb33a9b25c1b12cfb,
title = "Secure computation with low communication from cross-checking",
abstract = "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.",
author = "{Dov Gordon}, S. and Samuel Ranellucci and Xiao Wang",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-030-03332-3_3",
language = "English (US)",
isbn = "9783030033316",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "59--85",
editor = "Thomas Peyrin and Steven Galbraith",
booktitle = "Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings",

}

Dov Gordon, S, Ranellucci, S & Wang, X 2018, Secure computation with low communication from cross-checking. in T Peyrin & S Galbraith (eds), Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11274 LNCS, Springer Verlag, pp. 59-85, 24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018, Brisbane, Australia, 12/2/18. https://doi.org/10.1007/978-3-030-03332-3_3

Secure computation with low communication from cross-checking. / Dov Gordon, S.; Ranellucci, Samuel; Wang, Xiao.

Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. ed. / Thomas Peyrin; Steven Galbraith. Springer Verlag, 2018. p. 59-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11274 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Secure computation with low communication from cross-checking

AU - Dov Gordon, S.

AU - Ranellucci, Samuel

AU - Wang, Xiao

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85057590608&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85057590608&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-03332-3_3

DO - 10.1007/978-3-030-03332-3_3

M3 - Conference contribution

AN - SCOPUS:85057590608

SN - 9783030033316

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 59

EP - 85

BT - Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings

A2 - Peyrin, Thomas

A2 - Galbraith, Steven

PB - Springer Verlag

ER -

Dov Gordon S, Ranellucci S, Wang X. Secure computation with low communication from cross-checking. In Peyrin T, Galbraith S, editors, Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Springer Verlag. 2018. p. 59-85. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-03332-3_3