Name
Abstract | ||
|---|---|---|
Suppose your netmail is being erratically censored by Captain Yossarian. Whenever you send a message, he censors each bit of the message with probability 1/2, replacing each censored bit by some reserved character. Well versed in such concepts as redundancy, this is no real problem to you. The question is, can it actually be turned around and used to your advantage? We answer this question strongly in the affirmative. We show that this protocol, more commonly known as oblivious transfer, can be used to simulate a more sophisticated protocol, known as oblivious circuit evaluation([Y]). We also show that with such a communication channel, one can have completely noninteractive zero-knowledge proofs of statements in NP. These results do not use any complexity-theoretic assumptions. We can show that they have applications to a variety of models in which oblivious transfer can be done. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1145/62212.62215 | STOC |
Keywords | Field | DocType |
oblivious transfer,reserved character,complexity-theoretic assumption,captain yossarian,noninteractive zero-knowledge proof,sophisticated protocol,real problem,communication channel,oblivious circuit evaluation,zero knowledge proof,communication channels | Divide and choose,Computer science,Communication channel,Theoretical computer science,Redundancy (engineering),Mathematical proof,Secure two-party computation,Oblivious transfer | Conference |
ISBN | Citations | PageRank |
0-89791-264-0 | 480 | 33.02 |
References | Authors | |
7 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joe Kilian | 1 | 707 | 88.92 |