G. Brassard, C. Crepeau, and J. M. Robert, Information theoretical reductions among disclosure problems, in: Proc. 27th Ann. IEEE Symp. Foundations of Computer Science, 1986, pp. 168-173. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Oblivious Polynomial Evaluation and Oblivious Neural Learning - Chang, Lu (2001) (4 citations) (Correct)
....1 c. Similarly one can de ne OT 1 for any k 3, with Sender having k elements and Chooser wanting to learn one. We will use OT 1 , for k 2, to denote an assumed correct and secure OT 1 protocol. It is known that the existence of OT 1 implies the existence of OT 1 for any k 3 [5, 15]. De nition 4. A protocol for oblivious polynomial evaluation has two parties, Alice who has a polynomial P over some nite eld F and Bob who has an input x 2 F. An OPE protocol is correct if Bob learns P (x ) for any x and P . It is secure if both conditions below are satis ed for any x ....
G. Brassard, C. Crepeau, and J. M. Robert, Information theoretical reductions among disclosure problems, in: Proc. 27th Ann. IEEE Symp. Foundations of Computer Science, 1986, pp. 168-173.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC