Efficient and fully simulated oblivious transfer protocol on elliptic curve
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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
POSTS&TELECOM PRESS Co., LTD
2023-02-01
|
| Series: | 网络与信息安全学报 |
| Subjects: | |
| Online Access: | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2023012 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841529584116301824 |
|---|---|
| author | Jiashuo SONG Zhenzhen LI Haiyang DING Zichen LI |
| author_facet | Jiashuo SONG Zhenzhen LI Haiyang DING Zichen LI |
| author_sort | Jiashuo SONG |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-0a3126e72af04cf7b1ab866cfc0c966d |
| institution | Kabale University |
| issn | 2096-109X |
| language | English |
| publishDate | 2023-02-01 |
| publisher | POSTS&TELECOM PRESS Co., LTD |
| record_format | Article |
| series | 网络与信息安全学报 |
| spelling | doaj-art-0a3126e72af04cf7b1ab866cfc0c966d2025-01-15T03:16:32ZengPOSTS&TELECOM PRESS Co., LTD网络与信息安全学报2096-109X2023-02-01915816659577541Efficient and fully simulated oblivious transfer protocol on elliptic curveJiashuo SONGZhenzhen LIHaiyang DINGZichen LIOblivious 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.http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2023012oblivious transferfully simulationbilinear pairingzero-knowledge proofsecure multi-party computation |
| spellingShingle | Jiashuo SONG Zhenzhen LI Haiyang DING Zichen LI Efficient and fully simulated oblivious transfer protocol on elliptic curve 网络与信息安全学报 oblivious transfer fully simulation bilinear pairing zero-knowledge proof secure multi-party computation |
| title | Efficient and fully simulated oblivious transfer protocol on elliptic curve |
| title_full | Efficient and fully simulated oblivious transfer protocol on elliptic curve |
| title_fullStr | Efficient and fully simulated oblivious transfer protocol on elliptic curve |
| title_full_unstemmed | Efficient and fully simulated oblivious transfer protocol on elliptic curve |
| title_short | Efficient and fully simulated oblivious transfer protocol on elliptic curve |
| title_sort | efficient and fully simulated oblivious transfer protocol on elliptic curve |
| topic | oblivious transfer fully simulation bilinear pairing zero-knowledge proof secure multi-party computation |
| url | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2023012 |
| work_keys_str_mv | AT jiashuosong efficientandfullysimulatedoblivioustransferprotocolonellipticcurve AT zhenzhenli efficientandfullysimulatedoblivioustransferprotocolonellipticcurve AT haiyangding efficientandfullysimulatedoblivioustransferprotocolonellipticcurve AT zichenli efficientandfullysimulatedoblivioustransferprotocolonellipticcurve |