# proving the security of 1 out of 2 oblivious transfer using AND function

Hello ladies & gentlemen, I need to improve the security of 1-out of 2 oblivious transfer using AND function method with a given info.

use one-out-of-two oblivious transfer as building block, to construct a protocol so that two players, Alice and Bob, can jointly and securely compute AND function fAND(x, y) = x ∧ y where x ∈ {0, 1} and y ∈ {0, 1}.

I'm built up my given info(1-out-2) by using XOR function so that both of them can compute f(A,B). However, I'm still discuss with my friend the above question which is proving the security of 1-out-2 using AND function. Please, if you have any kind of hints, so I can start over searching in the right path, and not going far from the topic. Kind Regards.

-
Is the question on how to do OT using an AND function, or is it how to construct an AND function using OT? Your second paragraph says the latter; your first paragraph (and the title) says the former (and, BTW: both are possible; constructing AND out of OT is a lot more straight-forward). –  poncho Nov 18 '14 at 16:02