基于双线性对的高效不经意传输协议

doi:10.3969/j.issn.1000-3428.2013.06.036

计算机工程 ›› 2013, Vol. 39 ›› Issue (6): 166-169,173.doi: 10.3969/j.issn.1000-3428.2013.06.036

基于双线性对的高效不经意传输协议

徐彦蛟，李顺东，陈振华

(陕西师范大学计算机科学学院，西安 710062)

收稿日期:2012-07-02 出版日期:2013-06-15 发布日期:2013-06-14
作者简介:徐彦蛟(1988－)，男，硕士研究生，主研方向：密码学，信息安全；李顺东，教授、博士、博士生导师；陈振华，副教授、博士研究生
基金项目:
国家自然科学基金资助项目(61070189/61170032)；陕西省科技攻关计划基金资助项目(2008K01-58)

Efficient Oblivious Transfer Protocol Based on Bilinear Pairing

XU Yan-jiao, LI Shun-dong, CHEN Zhen-hua

(School of Computer Science, Shaanxi Normal University, Xi’an 710062, China)

Received:2012-07-02 Online:2013-06-15 Published:2013-06-14

摘要/Abstract

摘要： 不经意传输协议是密码学的基础工具，利用双线对设计不经意传输协议不仅可以扩展双线性对的应用范围，而且可以增加不经意传输的设计方法。因此，采用双线性对设计k-out-of-n的不经意传输协议。该协议能够保护接收者和发送者的隐私，同时抵抗冒名攻击、重放攻击以及中间人攻击，可用于不安全信道，协议在完成一次信息传输中仅需要发送方和接收方参与，不受其他方的干预，执行效率较高。

关键词: 双线性对, 不经意传输, 隐私, 冒名攻击, 重放攻击

Abstract: Oblivious Transfer(OT) protocol is an important primitive for designing cryptographic protocols. Designing OT protocol from bilinear pairing not only extends the bilinear pairing application but also increases the design technique of OT, which has important practical significance. This paper utilizes bilinear pairing to design a k-out-of-n OT protocol. The new protocol can protect both receiver’s privacy and sender’s privacy. The new protocol also can resist impersonation attacks, replay attacks and man-in-the-middle attacks. It can be used in an insecure channel, and the protocol has high efficiency.

Key words: bilinear pairing, Oblivious Transfer(OT), privacy, impersonation attack, replay attack

中图分类号:

TP309

徐彦蛟, 李顺东, 陈振华. 基于双线性对的高效不经意传输协议[J]. 计算机工程, 2013, 39(6): 166-169,173.

XU Pan-Jiao, LI Shun-Dong, CHEN Zhen-Hua. Efficient Oblivious Transfer Protocol Based on Bilinear Pairing[J]. Computer Engineering, 2013, 39(6): 166-169,173.

参考文献

[1] Rabin M O. How to Exchange Secrets by Oblivious Transfer[R]. Technical Report: TR-81, Aiken Computation Laboratory, Harvard University, 1981.
[2] Camenisch J, Dubovitskaya M, Neven G. Oblivious Transfer with Hidden Access Control Policies[C]//Proc. of the 14th International Conference on Practice and Theory in Public Key Cryptography. Berlin, Germany: Springer-Verlag, 2011: 192-209.
[3] Choi Seung-Geol, Hwang Kyung-Wook, Katz J, et al. Secure Multi-party Computation of Boolean Circuits with Applications to Privacy in On-line Marketplaces[C]//Proc. of the 12th Conference on Topics in Cryptology. Berlin, Germany: Springer-Verlag, 2012: 416-432. (下转第173页)
(上接第169页)

[4] Even S, Goldreich O, Lempel A. A Randomized Protocol for Signing Contracts[J]. Communications of the ACM, 1985, 28(6): 637-647.
[5] Wolf S. Reducing String Oblivious Transfer to Universal Obli- vious Transfer[C]//Proc. of IEEE International Symposium on Information Theory. [S. l.]: IEEE Press, 2000.
[6] Tzeng Wen-Guey. Effcient 1-out-of-n Oblivious Transfer Schemes with Universally Usable Parameters[J]. IEEE Trans. on Computers, 2004, 53(2): 232-240.
[7] 王凤和, 胡予濮, 刘振华. 格基不经意传输协议[J]. 通信学报, 2011, 32(3): 125-130.
[8] Mu Yi, Zhang Junqi, Varadharajan V. m out of n Oblivious Transfer[C]//Proc. of the 7th Australian Conference on Information Security and Privacy. London, UK: Springer- Verlag, 2002: 395-405.
[9] Chu Cheng-Kang, Tzeng Wen-Guey. Efficient k-out-of-n Obli- vious Transfer Schemes with Adaptive and Non-adaptive Queries[C]//Proc. of the 8th International Conference on Theory and Practice in Public Key Cryptography. Berlin, Germany: Springer-Verlag, 2005: 172-183.
[10] Lindell Y, Zarosim H. Adaptive Zero-knowledge Proofs and Adaptively Secure Oblivious Transfer[C]//Proc. of the 6th Theory of Cryptography Conference. Berlin, Germany: Springer-Verlag, 2009: 183-201.
[11] Chang C C, Lee J S. Robust t-out-of-n Oblivious Transfer Mechanism Based on CRT[J]. Journal of Network and Computer Applications, 2009, 32(1): 226-235.
[12] 赵春明, 葛建华, 李新国. 隐藏认证的不经意传输[J]. 电子与信息学报, 2007, 29(8): 1984-1986.
[13] Boneh D, Franklin M. Identity-based Encryption from the Weil Pairing[C]//Proc. of the 21st Annual International Cryptology Conference. London, UK: Springer-Verlag, 2001: 213-229.
[14] Holt J E, Bradshaw R W, Seamons K E, et al. Hidden Cre- dentials[C]//Proc. of ACM Workshop on Privacy in Electronic Society. New York, USA: ACM Press, 2003: 1-8.
[15] Qin Jing, Zhao Huawei. k out of n Oblivious Transfer Proto- cols from Bilinear Pairings[J]. Journal of Software, 2010, 5(1): 65-72.
[16] Chou Jue-Sam, Wu Cheng-Lun, Chen Yalin. A Novel k-out-of- n Oblivious Transfer Protocol from Bilinear Pairing[EB/OL]. (2012-06-30). http://eprint.iacr.org/2011/ 150.pdf.
编辑顾逸斐

基于双线性对的高效不经意传输协议

Efficient Oblivious Transfer Protocol Based on Bilinear Pairing

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

Metrics

本文评价

推荐阅读 10

[1]	邓志辉, 王少辉, 王平. 基于合数阶双线性对的可搜索加密方案分析与改进[J]. 计算机工程, 2020, 46(9): 123-128,135.
[2]	赵梁, 李磊, 李向丽. 基于双序列函数的重放攻击防御方案[J]. 计算机工程, 2020, 46(9): 143-148.
[3]	俞庆英, 王燕飞, 叶梓彤, 张双桂, 陈传明. 基于优化局部抑制的轨迹数据发布隐私保护算法[J]. 计算机工程, 2020, 46(8): 112-118.
[4]	陈丽燕, 芮廷先, 吕光金. 基于区块链智能合约的个人征信隐私保护方案[J]. 计算机工程, 2020, 46(7): 30-35.
[5]	龙浩, 张书奎, 张力. 群智感知中基于维诺单元的隐私保护方法[J]. 计算机工程, 2020, 46(5): 181-186,192.
[6]	刘雪艳, 贺啸梅, 芦婷婷, 罗玉坤. 无证书的共享数据公开审计方案[J]. 计算机工程, 2020, 46(4): 143-150.
[7]	金叶, 丁晓波, 龚国强, 吕科. 基于节点分类的k度匿名隐私保护方法[J]. 计算机工程, 2020, 46(3): 138-143.
[8]	李杨, 陈子彬, 谢光强. 一种基于ExtraTrees的差分隐私保护算法[J]. 计算机工程, 2020, 46(2): 134-140.
[9]	李远航, 陈先来, 刘莉, 安莹, 李忠民. 面向差分隐私保护的随机森林算法[J]. 计算机工程, 2020, 46(1): 93-101.
[10]	史志才, 王益涵, 张晓梅, 陈计伟, 陈珊珊. 一种具有隐私保护与前向安全的RFID组证明协议[J]. 计算机工程, 2020, 46(1): 108-113.
[11]	赵楠, 章国安, 谷晓会. VANET中隐私保护的无证书聚合签名方案[J]. 计算机工程, 2020, 46(1): 114-120,128.
[12]	刘冰, 马壮, 陈宜栋, 李艳俊. 无线传感器网络中的分簇安全数据汇聚方案[J]. 计算机工程, 2019, 45(9): 136-142.
[13]	孙海燕, 李玲玲, 张玲, 张建伟, 黄万伟. 一种增强的移动互联网身份基认证密钥协商协议[J]. 计算机工程, 2019, 45(9): 153-160,182.
[14]	张琦, 李嘉伟, 林喜军, 曲海鹏. 支持灵活授权的基于身份的加密相等性测试方案[J]. 计算机工程, 2019, 45(7): 176-180.
[15]	甘植旺,廖方圆. 国密SM9中R-ate双线性对快速计算[J]. 计算机工程, 2019, 45(6): 171-174.