%0 Journal Article
%T k out of n Oblivious Transfer Protocols from Bilinear Pairings
%A Jing Qin
%A Hua-wei Zhao
%J Journal of Software
%D 2010
%I Academy Publisher
%R 10.4304/jsw.5.1.65-72
%X Two non-interactive three parties k out of n oblivious transfer protocols from bilinear pairings are proposed in this paper. In these protocols, a sender can obliviously transfer n messages to a receiver without communication with him/her. The public keys that a sender used to encrypt his/her messages are made by a third party. The receiver can extract k out of n messages at his/her choices by using the corresponding secret keys. The choices of the receiver are unconditionally secure. The sender's secrecy is guaranteed if the receiver is semi-honest in the
%K oblivious transfer
%K malicious oblivious transfer
%K bilinear pairing
%K bilinear Diffie-Hellman problems
%U http://ojs.academypublisher.com/index.php/jsw/article/view/610