Back to Results
First PageMeta Content
Secure two-party computation / Function / Inverse function / Universal composability / Cryptographic protocols / Mathematics / Secure multi-party computation


Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions Gilad Asharov∗ Amos Beimel†
Add to Reading List

Document Date: 2014-12-16 05:22:34


Open Document

File Size: 485,58 KB

Share Result on Facebook

Company

The simulator S A / /

Country

Israel / Spain / /

Currency

pence / /

Event

FDA Phase / /

Facility

Ariel University / Hebrew University of Jerusalem / Ben Gurion University / /

IndustryTerm

oblivious transfer protocol / secure coin-tossing protocol / polynomial-time protocol / secure protocol / non-uniform polynomial-time algorithm / m-party protocol / secure multiparty protocols / computing / /

Organization

Pi / Ariel University / Universitat Pompeu Fabra / Barcelona / As in OT / Department of Computer Science / Ben Gurion University / School of Computer Science and Engineering / Hebrew University of Jerusalem / Jerusalem / P2 / Frankel Center for Computer Science / P1 / /

Person

Rabin / Amos Beimel† Nikolaos Makriyannis / Ai / Eran Omri / /

Position

Prime Minister / dealer / /

Product

FairTwoParty0 / P1 / P2 / /

RadioStation

CORE / /

Technology

oblivious transfer protocol / 6 Protocol / three-party protocol / cryptography / two-party protocol / this specific protocol / av / polynomial-time protocol / secure coin-tossing protocol / modified protocol / m-party protocol / generalized protocol / 4 An m-party protocol / aforementioned protocol / simulation / fair protocol / GHKL protocol / non-uniform polynomial-time algorithm / secure protocol / secure multiparty protocols / resulting protocol / executing a two-party protocol / /

SocialTag