Efficient 1-Out-2 Oblivious Transfer Schemes Based on EDDH Assumption

Huawei Huang, Chunhua Li
{"title":"Efficient 1-Out-2 Oblivious Transfer Schemes Based on EDDH Assumption","authors":"Huawei Huang, Chunhua Li","doi":"10.1109/NCIS.2011.188","DOIUrl":null,"url":null,"abstract":"This paper proposes an efficient 1-out-2 oblivious transfer scheme from fundamental cryptographic techniques directly. It achieves optimal efficiency in terms of the number of rounds and the total number of exchanged messages for the case that the receiver's choice is unconditionally secure. The computation time of the 1-out-2 oblivious transfer scheme is very efficient, too. The receiver need compute 4 modular exponentiations only, and the sender need compute 8 modular exponentiations. The new construction is secure if the EDDH assumption holds. Since EDDH assumption is weaker than DDH assumption for generic bilinear groups, the new scheme is a good replacement for Wen-Guey Tzeng's oblivious transfer schemes when bilinear group is adopted as construction platform.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Network Computing and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCIS.2011.188","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes an efficient 1-out-2 oblivious transfer scheme from fundamental cryptographic techniques directly. It achieves optimal efficiency in terms of the number of rounds and the total number of exchanged messages for the case that the receiver's choice is unconditionally secure. The computation time of the 1-out-2 oblivious transfer scheme is very efficient, too. The receiver need compute 4 modular exponentiations only, and the sender need compute 8 modular exponentiations. The new construction is secure if the EDDH assumption holds. Since EDDH assumption is weaker than DDH assumption for generic bilinear groups, the new scheme is a good replacement for Wen-Guey Tzeng's oblivious transfer schemes when bilinear group is adopted as construction platform.
基于EDDH假设的高效1-Out-2无关传输方案
本文直接从基础密码学技术出发,提出了一种高效的1出2无关传输方案。在接收方选择无条件安全的情况下,该算法在轮数和交换消息总数方面达到最优效率。1出2无关传输方案的计算时间也非常高效。接收方只需要计算4次模幂,发送方需要计算8次模幂。如果EDDH假设成立,新结构是安全的。由于一般双线性群的EDDH假设弱于DDH假设,因此当双线性群作为构建平台时,新方案可以很好地替代Wen-Guey Tzeng的遗忘转移方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信