Design of shuffling protocol based on additive secret sharing
Aiming at the problems such as lack of specific algorithms for process implementation, using public keys in most of the solutions, low efficiency in dealing with large-scale data sets, and lack of applicability, a unilateral shuffling protocol was proposed, and on this basis, a shuffling protocol ba...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2024-08-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024146/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539229634527232 |
|---|---|
| author | ZHANG Yanshuo MAN Ziqi ZHOU Xingyu YANG Yatao HU Ronglei |
| author_facet | ZHANG Yanshuo MAN Ziqi ZHOU Xingyu YANG Yatao HU Ronglei |
| author_sort | ZHANG Yanshuo |
| collection | DOAJ |
| description | Aiming at the problems such as lack of specific algorithms for process implementation, using public keys in most of the solutions, low efficiency in dealing with large-scale data sets, and lack of applicability, a unilateral shuffling protocol was proposed, and on this basis, a shuffling protocol based on additive secret sharing was designed. The share conversion algorithm was constructed through the casual transfer protocol, and the shuffling was completed without exposing the original data set. The shuffling task was decomposed into multiple sub-tasks by the Benes arrangement network, which improved the efficiency of large-scale data sets. Finally, through the additive secret sharing, the shuffling shares were safely distributed to the participants. The correctness of the proposed shuffling protocol was analyzed strictly, and its security property was evaluated by using an ideal-reality simulation paradigm. Compared with the existing literature, the proposed protocol can meet the current security standards in security, and has high efficiency in processing large-scale data sets. It improves the applicability of the protocol and further promotes its application in the current environment. |
| format | Article |
| id | doaj-art-c220b0fc690745af8a23bb8d09a9d865 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2024-08-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-c220b0fc690745af8a23bb8d09a9d8652025-01-14T07:24:55ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2024-08-014523824869426278Design of shuffling protocol based on additive secret sharingZHANG YanshuoMAN ZiqiZHOU XingyuYANG YataoHU RongleiAiming at the problems such as lack of specific algorithms for process implementation, using public keys in most of the solutions, low efficiency in dealing with large-scale data sets, and lack of applicability, a unilateral shuffling protocol was proposed, and on this basis, a shuffling protocol based on additive secret sharing was designed. The share conversion algorithm was constructed through the casual transfer protocol, and the shuffling was completed without exposing the original data set. The shuffling task was decomposed into multiple sub-tasks by the Benes arrangement network, which improved the efficiency of large-scale data sets. Finally, through the additive secret sharing, the shuffling shares were safely distributed to the participants. The correctness of the proposed shuffling protocol was analyzed strictly, and its security property was evaluated by using an ideal-reality simulation paradigm. Compared with the existing literature, the proposed protocol can meet the current security standards in security, and has high efficiency in processing large-scale data sets. It improves the applicability of the protocol and further promotes its application in the current environment.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024146/additive secret sharingshuffling protocolprivacy protectionsecure multiparty computing |
| spellingShingle | ZHANG Yanshuo MAN Ziqi ZHOU Xingyu YANG Yatao HU Ronglei Design of shuffling protocol based on additive secret sharing Tongxin xuebao additive secret sharing shuffling protocol privacy protection secure multiparty computing |
| title | Design of shuffling protocol based on additive secret sharing |
| title_full | Design of shuffling protocol based on additive secret sharing |
| title_fullStr | Design of shuffling protocol based on additive secret sharing |
| title_full_unstemmed | Design of shuffling protocol based on additive secret sharing |
| title_short | Design of shuffling protocol based on additive secret sharing |
| title_sort | design of shuffling protocol based on additive secret sharing |
| topic | additive secret sharing shuffling protocol privacy protection secure multiparty computing |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024146/ |
| work_keys_str_mv | AT zhangyanshuo designofshufflingprotocolbasedonadditivesecretsharing AT manziqi designofshufflingprotocolbasedonadditivesecretsharing AT zhouxingyu designofshufflingprotocolbasedonadditivesecretsharing AT yangyatao designofshufflingprotocolbasedonadditivesecretsharing AT huronglei designofshufflingprotocolbasedonadditivesecretsharing |