Sciweavers

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

5

STOC
2004
ACM

favoriteEmaildiscussreport

94views Algorithms» more STOC 2004»

Completeness in two-party secure computation: a computational view

14 years 4 months ago

Completeness in two-party secure computation: a computational view

Download www.wisdom.weizmann.ac.il

Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen

Real-time Traffic

Algorithms | STOC 2004 | Two-party Secure Computation |

claim paper

Related Content

» Partial Fairness in Secure TwoParty Computation

» TwoParty Computing with Encrypted Data

» Implementing TwoParty Computation Efficiently with Security Against Malicious Adversaries

» A TwoParty Protocol with Trusted Initializer for Computing the Inner Product

» LegallyEnforceable Fairness in Secure TwoParty Computation

» An Efficient Protocol for Secure TwoParty Computation in the Presence of Malicious Adversa...

» Parallel CoinTossing and ConstantRound Secure TwoParty Computation

» Adaptively Secure TwoParty Computation with Erasures

» RoundOptimal Secure TwoParty Computation

» LEGO for TwoParty Secure Computation

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2004
Where	STOC
Authors	Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen

Comments (0)