Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk

First Page		Document Content
Date: 2006-09-25 10:55:42 Cryptography Mathematical analysis Quantum complexity theory Computational complexity theory Functions and mappings Secure multi-party computation Communication complexity Secure two-party computation Limit of a function Cryptographic protocol Pi PP		Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk Add to Reading List Source URL: cs-www.cs.yale.edu Download Document from Source Website File Size: 411,92 KB Share Document on Facebook

	Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation DocID: 1xUAz - View Document
	Round-Optimal Secure Two-Party Computation from Trapdoor Permutations Michele Ciampi DIEM Università di Salerno ITALY DocID: 1vhtk - View Document
	LEGO for Two Party Secure Computation Jesper Buus Nielsen and Claudio Orlandi BRICS, Department of Computer Science, Aarhus Universitet, ˚ Abogade 34, 8200 ˚ Arhus, Denmark DocID: 1tquI - View Document
	An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries∗ Yehuda Lindell† Benny Pinkas‡ DocID: 1tjRM - View Document
	Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer∗ Yehuda Lindell† Benny Pinkas‡ DocID: 1tjPL - View Document