A New t-out-n Oblivious Transfer with Low Bandwidth

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/6466

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6466

题名:	A New t-out-n Oblivious Transfer with Low Bandwidth
作者:	Huang, H. F.;Chang, C. C.
关键词:	Two-lock cryptosystem;private information retrieval;elliptic curve
日期:	2007-03
上传时间:	2009-12-17 06:58:07 (UTC+0)
出版者:	Asia University
摘要:	The most efficient previously proposed oblivious transfer schemes require t calls of 1-out-n oblivious transfer (OT) to construct the t-out-n OT. Its computational requirements and bandwidth consumption are quite demanding. Therefore, to guarantee the quality of growing popular communication service, an efficient t-out-n OT scheme with low bandwidth is urgently desired. Based on elliptic curve cryptosystems, we propose a new t-out-n OT scheme in this paper. Compared with existing OT schemes based on modular exponentiations, our scheme can reduce many computation and communication loads for both the sender and the receiver. Owing to its smaller bandwidth and faster computation speed, our scheme is very suitable for mobile clients and smart-card users. Moreover, our scheme provides a simple algorithm and fewer parameter requirements.
關聯:	Applied Mathematics Sciences 1(7): 311-320
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
		0Kb	Unknown	474	检视/开启
310904400-6466.doc		74Kb	Microsoft Word	251	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.