Christian Cachin. On the foundations of oblivious transfer. In Advances in Cryptology| EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science. Springer, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....1 protocols can be based on the existence of trapdoor permutations, factoring, Die Hellman and so on. See [1] for ElGamal based OT 1 protocol, for example. 21] proved its security formally in the random oracle model. OT , OT 1 and OT 1 are all equivalent in the information theoretic sense [5, 12, 7]. On the other hand, an adaptive OT k protocol consists of a commit phase and a transfer phase. In the commit phase, a sender S commits n secret strings M 1 ; M n . In each transfer subphase j (1 j k) a chooser C chooses an index i j adaptively and obtains M i j . i j may depend on ....

C. Cachin, \On the foundations of oblivious transfer," Proc. of Eurocrypt '98, LNCS Vol. 1403, pp. 361-374 (1998).

....the security conditions. Both theorems comprise a constructive result and an impossibility result. The constructive result of Theorem 1 generalizes a theorem of [9] which solves the special cases where either p or q is 0 (or negligible in the security parameter) Brassard Cr epeau [2] and Cachin [4] consider a more general model of WOT, where the extra information that an adversary learns is only speci ed by a general information measure, but here again the weakness is one sided: only the receiver learns extra information. Prior to this work, few nontrivial impossibility results of this ....

C. Cachin. \On the Foundations of Oblivious Transfer", Proceedings of EuroCrypt '98, Springer-Verlag LNCS series, vol. 1403, pp. 361-374.

....OT 1 n from OT 1 2 is not trivial. OT 1 n is also known as all or nothing disclosure of secrets (ANDOS) in which R is not allowed to gain combined information of the secrets, such as, their exclusive or. Essentially, all these flavors are equivalent in the information theoretic sense [9, 12, 15]. Oblivious transfer is a fundamental primitive for cryptography and secure distributed computation [23, 24] and has many applications, such as, private information retrieval (PIR) fair electronic contract signing, oblivious secure computation, etc [5, 14, 21] A general approach for constructing ....

C. Cachin, "On the foundations of oblivious transfer," In Proceedings of Advances in Cryptology - Eurocrypt 98, Lecture Notes in Computer Science 1403, pp.361-374, Springer-Verlag, 1998.

....the messages are k bit strings instead of single bits. One reason for the importance of OT is that it allows for carrying out any secret two party computation. Many results, lower as well as upper bounds, have been proven on information theoretic reductions of such OT primitives to others [5] [4], 6] 7] It is a particularly interesting problem to realize OT (e.g. chosen string OT) from primitives that are as weak as possible [6] It is the purpose of this paper to perform another step into this direction. 2 Bit , String , and Generalized OT: De nitions and Previous Results Many ....

C. Cachin, On the foundations of oblivious transfer, Advances in Cryptography  EUROCRYPT' 98, LNCS, Vol. 1403, pp. 361374, Springer-Verlag, 1998.

....A variant of the problem, called Gamma 2 1 Delta OT, has Alice transmitting two bits (b 0 ; b 1 ) to Bob, Bob choosing which bit b e to receive, Alice not learning e, and Bob not learning b 1 Gammae . OT, Gamma 2 1 Delta OT, and other variants have been studied extensively (e.g. [1, 2, 3, 5, 10, 9, 11, 22, 48, 19, 25, 30, 39, 37]) and have been used in many cryptographic protocols (e.g. 38, 43, 8] Beaver [2] was the first to formally define security for OT in a stand alone setting (hereafter referred to as stand alone OT) He defined it in relation to an ideal system for OT in which Alice and Bob communicate through ....

C. Cachin. On the foundations of oblivious transfer. In Advances in Cryptology---EUROCRYPT 98, volume 1403 of Lecture Notes in Computer Science, pages 361--374. Springer-Verlag, 1998.

No context found.

Christian Cachin. On the foundations of oblivious transfer. In Advances in Cryptology| EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science. Springer, 1998.

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