Back to Results
First PageMeta Content
Quantum complexity theory / Oblivious transfer / PP / Function / Verifiable computing / Cryptography / Theoretical computer science / Mathematics


A Proof of Security of Yao’s Protocol for Two-Party Computation Yehuda Lindell∗
Add to Reading List

Document Date: 2011-01-11 03:00:15


Open Document

File Size: 303,47 KB

Share Result on Facebook

City

New York / /

Company

IBM / HP Labs / /

Country

Israel / /

Currency

pence / /

/

Facility

Bar-Ilan University / Haifa University / /

IndustryTerm

secure protocols / oblivious transfer protocol / probabilistic polynomialtime algorithm / secure protocol / circuit computing / probabilistic polynomial-time algorithms / computing / constant-round protocol / /

Organization

Haifa University / Bar-Ilan University / Department of Computer Science / P2 / P1 / /

Person

Semi-Honest Adversaries / Benny Pinkas† June / /

Position

cpa / model / forward / /

ProvinceOrState

New Jersey / New York / /

Technology

encryption / cryptography / two-party protocol / chosen double-encryption / 1-out-of-2 oblivious transfer protocol / constant-round protocol / 2.1 Secure Two-Party Protocols / chosen double encryption / probabilistic polynomial-time algorithms / probabilistic polynomialtime algorithm / secret key / simulation / double encryption / secure protocol / resulting protocol / /

SocialTag