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

	S3ORAM: A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret Sharing DocID: 1xUA8 - View Document
	Cambridge University Press3 - Secure Multiparty Computation and Secret Sharing Ronald Cramer, Ivan Bjerre Damgård and Jesper Buus Nielsen Table of Contents More information DocID: 1xTf5 - View Document
	Homework 1 Cryptography CS 598 : Spring 2016 Released: Thu Jan 21 Due: Tue Feb 2 Exercise on Secret Sharing DocID: 1vnNK - View Document
	Shatter Secrets: Using Secret Sharing to Cross Borders with Encrypted Devices Erinn Atwater and Ian Goldberg University of Waterloo, Ontario, Canada {erinn.atwater,iang}@uwaterloo.ca DocID: 1uO4X - View Document
	1 Secret Sharing with Optimal Decoding and Repair Bandwidth Wentao Huang and Jehoshua Bruck DocID: 1uIPQ - View Document