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

	Large Bell violations from communication complexity lower bounds Gabriel Senno Joint work with with S. Laplante, M. Laurière, A. Nolin (IRIF), J. Roland (ULB) DocID: 1vn3Y - View Document
	The communication complexity of addition Emanuele Viola∗ December 12, 2013 Abstract Suppose each of k ≤ no(1) DocID: 1uYzp - View Document
	Communication Complexity for Distributed Graphs Qin Zhang Indiana University Bloomington DocID: 1uTYi - View Document
	The multiparty communication complexity of interleaved group products W. T. Gowers∗ Emanuele Viola† DocID: 1uPys - View Document
	1 Fundamental limits on complexity and power consumption in coded communication Pulkit Grover† , Andrea Goldsmith† , Anant Sahai‡ † Stanford University ‡ University of California, Berkeley DocID: 1uKNv - View Document