Best of Both Worlds in Secure Computation, with Low Communication Overhead

First Page		Document Content
Date: 2018-08-09 16:19:58 Cryptography Mathematics Theoretical computer science Computational complexity theory Secret sharing Quantum complexity theory Secure multi-party computation IP PP Polynomial Communication complexity Lagrange polynomial		Best of Both Worlds in Secure Computation, with Low Communication Overhead Add to Reading List Source URL: web.eecs.umich.edu Download Document from Source Website File Size: 1,86 MB Share Document on Facebook

	Session A1: Multi-Party Computation 1 CCS’17, October 30-November 3, 2017, Dallas, TX, USA Global-Scale Secure Multiparty Computation Xiao Wang DocID: 1xUHA - View Document
	Efficient Multi-Party Computation: from Passive to Active Security via Secure SIMD Circuits Daniel Genkin12 , Yuval Ishai1 , and Antigoni Polychroniadou3 1 DocID: 1xUE2 - View Document
	A New Approach to Interdomain Routing Based on Secure Multi-Party Computation Debayan Gupta∗, Aaron Segal∗, Aurojit Panda†, Gil Segev‡, Michael Schapira§, Joan Feigenbaum∗, Jennifer Rexford††, Scott Shenke DocID: 1xTeQ - View Document
	THE STRUCTURE OF SECURE MULTI-PARTY COMPUTATION BY MICHAEL J. ROSULEK B.S., Iowa State University, 2003 DocID: 1vp2V - View Document
	The Price of Low Communication in Secure Multi-Party Computation Juan Garay1 , Yuval Ishai2 , Rafail Ostrovsky3 , and Vassilis Zikas4 1 2 DocID: 1tYUs - View Document