Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

EUROCRYPT
2010
Springer

favoriteEmaildiscussreport

134views Cryptology» more EUROCRYPT 2010»

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography

13 years 9 months ago

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography

Download crypto.rd.francetelecom.com

Ivan Damgård, Yuval Ishai, Mikkel Krø

Real-time Traffic

Cryptology | EUROCRYPT 2010 |

claim paper

Related Content

» On the Necessity of Rewinding in Secure Multiparty Computation

» Asynchronous Multiparty Computation Theory and Implementation

» Secure multiparty quantum computation

» A Full Proof of the BGW Protocol for PerfectlySecure Multiparty Computation

» Scalarproduct based Secure Twoparty Computation

» Player Simulation and General Adversary Structures in Perfect Multiparty Computation

» Secure Computation of the k thRanked Element

» On the Hardness of InformationTheoretic Multiparty Computation

» Secure Multiparty Computation Goes Live

Post Info
More Details (n/a)

Added	19 Jul 2010
Updated	19 Jul 2010
Type	Conference
Year	2010
Where	EUROCRYPT
Authors	Ivan Damgård, Yuval Ishai, Mikkel Krøigaard

Comments (0)