<--- Back to Details
First PageDocument Content
Computational complexity theory / Interactive proof system / IP / Zero-knowledge proof / NP / Probabilistic Turing machine / Alice and Bob / Oblivious transfer / Non-interactive zero-knowledge proof / Theoretical computer science / Cryptography / Cryptographic protocols
Computational complexity theory
Interactive proof system
IP
Zero-knowledge proof
NP
Probabilistic Turing machine
Alice and Bob
Oblivious transfer
Non-interactive zero-knowledge proof
Theoretical computer science
Cryptography
Cryptographic protocols

Add to Reading List

Source URL: theory.lcs.mit.edu

Download Document from Source Website

Share Document on Facebook

Similar Documents

On the Feasibility of Extending Oblivious Transfer∗ Yehuda Lindell Hila Zarosim Dept. of Computer Science

DocID: 1v80m - View Document

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer∗ Yehuda Lindell Hila Zarosim

DocID: 1uUpb - View Document

INFOCOMMUNICATIONS JOURNAL Oblivious Transfer with Verification Oblivious Oblivious

DocID: 1uO7u - View Document

Chemical  OT:   On  the  (Im)possibility  of  Basing  Oblivious  Transfer  on  Chemical   Assump>ons   Bernardo  David  

DocID: 1tRD2 - View Document

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer∗ Yehuda Lindell† Benny Pinkas‡

DocID: 1tjPL - View Document