Paper 2010/027 Original: eprint.iacr.org/2010/027 ↗
A novel k-out-of-n Oblivious Transfer Protocols Based on Bilinear Pairings
Abstract
Low bandwidth consumption is an important issue in a busy commercial network whereas time may not be so crucial, for example, the end-of-day financial settlement for commercial transactions in a day. In this paper, we construct a secure and low bandwidth-consumption k-out-of-n oblivious transfer scheme based on bilinear pairings. We analyze the security and efficiency of our scheme and conclude that our scheme is more secure and efficient in communication bandwidth consumption than most of the other existing oblivious transfer schemes that we know.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2010-01-22: last updated
- 2010-01-22: published
- Short URL
- https://ia.cr/2010/027
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/027,
author = {Yalin Chen and Jue-Sam Chou and Xian-Wu Hou},
title = {A novel k-out-of-n Oblivious Transfer Protocols Based on Bilinear Pairings},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/027},
year = {2010},
url = {https://eprint.iacr.org/2010/027}
}