Global-scale secure multiparty computation

Xiao Wang; Samuel Ranellucci; Jonathan Katz

doi:10.1145/3133956.3133979

Global-scale secure multiparty computation

Xiao Wang, Samuel Ranellucci, Jonathan Katz

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

51 Scopus citations

Abstract

We propose a new, constant-round protocol for multi-party computation of boolean circuits that is secure against an arbitrary number of malicious corruptions. At a high level, we extend and generalize recent work of Wang et al. in the two-party setting. Namely, we design an efficient preprocessing phase that allows the parties to generate authenticated information; we then show how to use this information to distributively construct a single "authenticated" garbled circuit that is evaluated by one party.

Original language	English (US)
Title of host publication	CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
Publisher	Association for Computing Machinery
Pages	39-56
Number of pages	18
ISBN (Electronic)	9781450349468
DOIs	https://doi.org/10.1145/3133956.3133979
State	Published - Oct 30 2017
Event	24th ACM SIGSAC Conference on Computer and Communications Security, CCS 2017 - Dallas, United States Duration: Oct 30 2017 → Nov 3 2017

Publication series

Name	Proceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)	1543-7221

Conference

Conference	24th ACM SIGSAC Conference on Computer and Communications Security, CCS 2017
Country	United States
City	Dallas
Period	10/30/17 → 11/3/17

ASJC Scopus subject areas

Software
Computer Networks and Communications

Access to Document

10.1145/3133956.3133979

Fingerprint Dive into the research topics of 'Global-scale secure multiparty computation'. Together they form a unique fingerprint.

Cite this

@inproceedings{f6d910c6e8a54848b9df7ee18ce31fb0,

title = "Global-scale secure multiparty computation",

abstract = "We propose a new, constant-round protocol for multi-party computation of boolean circuits that is secure against an arbitrary number of malicious corruptions. At a high level, we extend and generalize recent work of Wang et al. in the two-party setting. Namely, we design an efficient preprocessing phase that allows the parties to generate authenticated information; we then show how to use this information to distributively construct a single {"}authenticated{"} garbled circuit that is evaluated by one party.",

author = "Xiao Wang and Samuel Ranellucci and Jonathan Katz",

year = "2017",

month = oct,

day = "30",

doi = "10.1145/3133956.3133979",

language = "English (US)",

series = "Proceedings of the ACM Conference on Computer and Communications Security",

publisher = "Association for Computing Machinery",

pages = "39--56",

booktitle = "CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security",

note = "24th ACM SIGSAC Conference on Computer and Communications Security, CCS 2017 ; Conference date: 30-10-2017 Through 03-11-2017",

}

Wang, X, Ranellucci, S & Katz, J 2017, Global-scale secure multiparty computation. in CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. Proceedings of the ACM Conference on Computer and Communications Security, Association for Computing Machinery, pp. 39-56, 24th ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, United States, 10/30/17. https://doi.org/10.1145/3133956.3133979

Global-scale secure multiparty computation. / Wang, Xiao; Ranellucci, Samuel; Katz, Jonathan.

CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, 2017. p. 39-56 (Proceedings of the ACM Conference on Computer and Communications Security).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Global-scale secure multiparty computation

AU - Wang, Xiao

AU - Ranellucci, Samuel

AU - Katz, Jonathan

PY - 2017/10/30

Y1 - 2017/10/30

N2 - We propose a new, constant-round protocol for multi-party computation of boolean circuits that is secure against an arbitrary number of malicious corruptions. At a high level, we extend and generalize recent work of Wang et al. in the two-party setting. Namely, we design an efficient preprocessing phase that allows the parties to generate authenticated information; we then show how to use this information to distributively construct a single "authenticated" garbled circuit that is evaluated by one party.

AB - We propose a new, constant-round protocol for multi-party computation of boolean circuits that is secure against an arbitrary number of malicious corruptions. At a high level, we extend and generalize recent work of Wang et al. in the two-party setting. Namely, we design an efficient preprocessing phase that allows the parties to generate authenticated information; we then show how to use this information to distributively construct a single "authenticated" garbled circuit that is evaluated by one party.

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

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

U2 - 10.1145/3133956.3133979

DO - 10.1145/3133956.3133979

M3 - Conference contribution

AN - SCOPUS:85037843289

T3 - Proceedings of the ACM Conference on Computer and Communications Security

SP - 39

EP - 56

BT - CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security

PB - Association for Computing Machinery

T2 - 24th ACM SIGSAC Conference on Computer and Communications Security, CCS 2017

Y2 - 30 October 2017 through 3 November 2017

ER -