Efficient and fully simulated oblivious transfer protocol on elliptic curve

• Published in: 网络与信息安全学报 Vol. 9; no. 1; pp. 158 - 166
• Main Author: Jiashuo SONG, Zhenzhen LI, Haiyang DING, Zichen LI
• Format: Journal Article
• Language: Chinese; English
• Published: POSTS&TELECOM PRESS Co., LTD 25.02.2023
• Subjects: bilinear pairing; fully simulation; oblivious transfer; secure multi-party computation; zero-knowledge proof
• ISSN: 2096-109X
• DOI: 10.11959/j.issn.2096-109x.2023012

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.