通信学报2024，Vol.45Issue(8)：238-248,11.DOI:10.11959/j.issn.1000-436x.2024146
基于加性秘密共享的洗牌协议的设计
Design of shuffling protocol based on additive secret sharing
摘要
Abstract
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 ex-posing the original data set.The shuffling task was decomposed into multiple sub-tasks by the Benes arrangement net-work,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 exist-ing literature,the proposed protocol can meet the current security standards in security,and has high efficiency in pro-cessing large-scale data sets.It improves the applicability of the protocol and further promotes its application in the cur-rent environment.关键词
加性秘密共享/洗牌协议/隐私保护/安全多方计算Key words
additive secret sharing/shuffling protocol/privacy protection/secure multiparty computing分类
信息技术与安全科学引用本文复制引用
张艳硕,满子琪,周幸妤,杨亚涛,胡荣磊..基于加性秘密共享的洗牌协议的设计[J].通信学报,2024,45(8):238-248,11.基金项目
中央高校基本科研业务费资金资助项目(No.3282024003) （No.3282024003）
"信息安全"国家级一流本科专业建设点基金资助项目(No.2017YFB0801803) （No.2017YFB0801803）
北京市自然科学基金资助项目(No.4232034) The Fundamental Research Funds for the Central Universities(No.3282024003),"Information Security"National First-Class Undergraduate Program Construction Point(No.2017YFB0801803),Beijing Natural Science Foundation(No.4232034) （No.4232034）
