Back to Results
First PageMeta Content
Oblivious transfer / Decisional Diffie–Hellman assumption / Commitment scheme / Secure multi-party computation / Communications protocol / Zero-knowledge proof / Proof of knowledge / Cryptography / Cryptographic protocols / Universal composability


Efficient Fully-Simulatable Oblivious Transfer∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel.
Add to Reading List

Document Date: 2008-12-21 16:22:00


Open Document

File Size: 237,53 KB

Share Result on Facebook

Company

Aladdin Knowledge Systems / /

Country

Israel / /

Currency

pence / /

/

Event

Product Recall / FDA Phase / Bankruptcy / Product Issues / /

Facility

Computer Science Bar-Ilan University / /

IndustryTerm

secure oblivious transfer protocol / oblivious transfer protocols / secure protocols / secure real-model protocol / cryptographic protocols / oblivious transfer protocol / highlyefficient oblivious transfer protocols / coin-tossing protocol / non-uniform polynomial-time algorithm / constant-round protocols / inefficient protocol / /

Organization

Bar-Ilan University / Trusted party / P2 / Efficient Fully-Simulatable Oblivious Transfer∗ Yehuda Lindell† Department / P1 / /

Person

Rabin / /

Product

S1 / A1 / P1 / M2 / /

Technology

encryption / oblivious transfer protocol / highlyefficient oblivious transfer protocols / cryptography / two-party protocol / secure two-party protocol / secure oblivious transfer protocol / real protocol / secure real-model protocol / achieving constant-round protocols / The protocol / data mining / secret key / simulation / specified protocol / underlying protocol / two-round protocol / real two-party protocol / non-uniform polynomial-time algorithm / coin-tossing protocol / oblivious transfer protocols / El Gamal encryption / /

SocialTag