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 -