| 椭圆曲线上高效可完全模拟的不经意传输协议 |
| |
| 引用本文： | 宋佳烁,李祯祯,丁海洋,李子臣. 椭圆曲线上高效可完全模拟的不经意传输协议[J]. 网络与信息安全学报, 2023, 9(1): 158-166. DOI: 10.11959/j.issn.2096-109x.2023012 |
| |
| 作者姓名： | 宋佳烁 李祯祯 丁海洋 李子臣 |
| |
| 作者单位： | 北京印刷学院数字版权保护技术研究中心，北京 102600 |
| |
| 基金项目： | 国家自然科学基金(61370188);北京市教委科研计划(KM202010015009);北京市教委科研计划(KM202110015004);北京印刷学院博士启动金项目(27170120003/020);北京印刷学院科研创新团队项目(Eb202101);北京印刷学院校内学科建设项目(21090121021);北京印刷学院重点教改项目(22150121033/009);北京印刷学院科研基础研究一般项目(Ec202201) |
| |
| 摘 要： | 不经意传输协议是安全多方计算的一个关键技术，是当前网络与信息安全研究的热点。基于双线性对及椭圆曲线上的困难问题，分别设计了半诚实模型下和标准恶意模型下的安全高效N选1不经意传输协议。，在半诚实模型下设计了一个椭圆曲线上的不经意传输协议，该协议只需2轮交互，接收方需要2次双线性对运算和1次椭圆曲线倍点运算，发送方需要n次椭圆曲线倍点运算和n次模幂运算，协议的安全可规约到椭圆曲线上的离散对数问题；构建了基于椭圆曲线上双线性对的零知识证明方案，并设计了一个恶意模型下的不经意传输协议，该协议只需3轮交互，接收者需要3次双线性对运算和3次椭圆曲线倍点运算，发送者需要n+1次椭圆曲线倍点运算和n+1次模幂运算，协议能在标准恶意模型下抵抗参与者的恶意攻击行为。实验结果得到在半诚实模型下协议平均运行时间需要0.787 9 s，在标准恶意模型下协议平均运行时间需要1.205 6 s，进一步论证协议的速度。
|
| 关 键 词： | 不经意传输 完全模拟 双线性对 零知识证明 安全多方计算 |
Efficient and fully simulated oblivious transfer protocol on elliptic curve |
| |
| Jiashuo SONG,Zhenzhen LI,Haiyang DING,Zichen LI. Efficient and fully simulated oblivious transfer protocol on elliptic curve[J]. Chinese Journal of Network and Information Security, 2023, 9(1): 158-166. DOI: 10.11959/j.issn.2096-109x.2023012 |
| |
| Authors: | Jiashuo SONG Zhenzhen LI Haiyang DING Zichen LI |
| |
| Affiliation: | Digital Rights Management Research Center, Beijing Institute of Graphic Communication , Beijing 102600, China |
| |
| Abstract: | Oblivious transfer protocol, an important technology in secure multi-party computation, is the research hotspot on network and information security.Based on the bilinear pairs and the difficult problems on elliptic curves, an efficient 1-out-of-N oblivious transfer protocol in the semi-honest model and in the standard malicious model were proposed respectively.The protocol in semi-honest model was designed.It only needed two rounds of interaction.The receiver needed two times of bilinear pair arithmetic and one time of multi point arithmetic, and the sender needed n times of multi point arithmetic and n times of modular exponentiation.The security of the protocol was based on the discrete logarithm problem on elliptic curves.A zero-knowledge proof protocol and the oblivious transfer protocol in the standard malicious model were proposed respectively.The oblivious transfer protocol only needed four rounds of interaction.The receiver needed three times of bilinear pair arithmetic and three times of multi point arithmetic, and the sender needed n+1 times of multi point arithmetic and n+1 times of modular exponentiation.Besides, it can resist malicious behaviors of the party.The results show that the average running time of the protocol in the semi-honest model and in the standard malicious model were 0.787 9 s and 1.205 6 s respectively, which can further demonstrate the efficiency of the protocol. |
| |
| Keywords: | oblivious transfer fully simulation bilinear pairing zero-knowledge proof secure multi-party computation |
|
| 点击此处可从《网络与信息安全学报》浏览原始摘要信息 |
|
点击此处可从《网络与信息安全学报》下载免费的PDF全文 |
