Back to Results
First PageMeta Content
Secure two-party computation / Security parameter / Valuation / Mathematics / Applied mathematics / Cryptographic protocols / Secure multi-party computation / Universal composability


Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness Juan A. Garay∗ Philip MacKenzie∗
Add to Reading List

Document Date: 2004-03-03 15:33:45


Open Document

File Size: 367,20 KB

Share Result on Facebook

Company

IDEALF S A / Lucent Technologies / /

Currency

pence / /

/

Event

Product Issues / FDA Phase / /

Facility

Carnegie Mellon University / /

IndustryTerm

secure and fair protocols / normal protocol / secure protocol / public key infrastructure / asynchronous network / reasonable protocols / exponentiation algorithms / Typical protocols / final protocol / fair protocols / reasonable timed protocols / /

Organization

Pi / Carnegie Mellon University / Computer Science Department / P1 / /

Person

Philip MacKenzie / Juan A. Garay∗ Philip / /

/

Position

judge / /

Product

UC / Complete Fairness Juan A. Garay∗ Philip MacKenzie∗ Ke Yang† Abstract We / Majority / /

Technology

fair MPC protocols / cryptography / public key infrastructure / universally-composable MPC protocol / BBS / reasonable timed protocols / secure and fair protocols / timed protocol / fair MPC protocol / MPC protocol / PKI / exponentiation algorithms / two protocols / simulation / fair protocol / same protocol / secure protocol / secure MPC protocols / 3.1 Timed protocols / normal protocol / existing secure MPC protocols / resulting protocol / /

SocialTag