doi: 10.4304/jsw.5.1.65-72
k out of n Oblivious Transfer Protocols from Bilinear Pairings
- 1 School of Mathematics, Shandong University, Jinan, P.R.China
- 2 School of Computer and Information Engineering, Shandong University of Finance, Jinan,P.R.China
Abstract
Two non-interactive three parties k out of noblivious transfer protocols kn OT (where 0<k<n) frombilinear pairings are proposed in this paper. In theseprotocols, a sender can obliviously transfer n messages to areceiver without communication with him/her. The publickeys that a sender used to encrypt his/her messages aremade by a third party. The receiver can extract k out of nmessages at his/her choices by using the correspondingsecret keys. The choices of the receiver are unconditionallysecure. The sender's secrecy is guaranteed if the receiver issemi-honest in the standard model since the decisionbilinear Diffie-Hellman problem (DBDH) is hard and thesender's secrecy is achieved when the receiver is a maliciousparty in the random oracle model since the bilinear Diffie-Hellman problem assumption (BDHA) holds. When asender is a cheating party, the receiver will detect him/herand halt the protocol. A precise proof of the security of theprotocols is presented.
Keywords
- oblivious transfer
- malicious oblivioust
How to Cite
Qin Jing and Zhao Hua-wei, "k out of n Oblivious Transfer Protocols from Bilinear Pairings," Journal of Software, vol. 5, no. 1, pp. 65-72, 2010. https://doi.org/ 10.4304/jsw.5.1.65-72
Copyright & License
Copyright © 2010 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
