MPC vs. SFE: Perfect Security in a Unified Corruption Model ? Zuzana Beerliov´a-Trub´ıniov´a, Matthias Fitzi, Martin Hirt, Ueli Maurer, and Vassilis Zikas Department of Computer Science, ETH Zurich {bzuzana,fitzi,hir

First Page		Document Content
Date: 2011-02-19 14:29:40 Cryptography Secure multi-party computation Secure two-party computation Ciphertext indistinguishability Consensus Secret sharing IP Control theory		MPC vs. SFE: Perfect Security in a Unified Corruption Model ? Zuzana Beerliov´a-Trub´ıniov´a, Matthias Fitzi, Martin Hirt, Ueli Maurer, and Vassilis Zikas Department of Computer Science, ETH Zurich {bzuzana,fitzi,hir Add to Reading List Source URL: www.cs.rpi.edu Download Document from Source Website File Size: 247,36 KB 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