| 引用本文： |
-
张艳硕,满子琪,周幸妤,杨亚涛,谢绒娜.基于秘密共享的可验证分层洗牌协议设计及其应用方案[J].信息安全学报,已采用 [点击复制]
- Zhang Yanshuo,Man Ziqi,Zhou Xingyu,Yang Yatao,Xie Rongna.Design of Verifiable Layered Shuffling Protocol based on Secret Sharing and Its Application Scheme[J].Journal of Cyber Security,Accept [点击复制]
|
|
| 摘要: |
| 隐私交集协议可求出参与方集合之间的交集，进而用作后续的函数计算；然而在一些场景下，参与方不愿交集信息在他们之间呈露，因为这很可能会泄露一些隐私信息。作为安全多方计算的重要组成，基于秘密共享的洗牌协议可在参与方之间确保交集数据的隐私性来发挥其独特作用，能够有效解决上述存在的问题。然而，现有的基于秘密共享的洗牌协议也存在着一些问题，例如：多集中于理论框架的设计，缺少每一流程实现的具体算法；多采用公钥的解决方案，在处理大规模数据集时效率不是很高；缺乏一定的适用性，在一些领域不是很实用。鉴于这些局限，本文设计了一种基于秘密共享的可验证分层洗牌协议。本协议通过不经意传输协议构建份额转换算法，在不暴露原数据集的前提下完成了洗牌；利用Benes排列网络实现洗牌分层，将复杂的洗牌任务分为多个子任务，提高了大规模数据下的效率；引入可验证的思想，从而使协议的安全性得到了有效保证；结合协议构造了相应的隐私保护方案。本文对所提出协议及方案的正确性进行了严格分析；运用理想-现实模拟范式对安全性进行了评估；并与相应的协议在时间开销、安全性、算法时间复杂度等方面进行了对比分析。结果表明，本文提出的协议能够满足恶意模型下的安全性标准；在处理大规模数据集时有一定的效率优势；提升了协议的适用性，进一步推广了在当下环境中的应用。 |
| 关键词: 秘密共享 洗牌 安全多方计算 隐私保护 |
| DOI： |
| 投稿时间：2024-07-29修订日期：2025-01-02 |
| 基金项目:国家自然科学基金项目（面上项目，重点项目，重大项目） |
|
| Design of Verifiable Layered Shuffling Protocol based on Secret Sharing and Its Application Scheme |
|
Zhang Yanshuo1, Man Ziqi2, Zhou Xingyu3, Yang Yatao4, Xie Rongna5
|
| (1.ZHANG Yanshuo;2.MAN Ziqi;3.ZHOU Xingyu;4.YANG Yatao;5.XIE Rongna) |
| Abstract: |
| The privacy intersection protocol can calculate the intersection between the set of participants, and then use it for the subsequent function calculation. However, in some scenarios, the participants do not want to disclose the intersecting information between them, because it is likely to reveal some private information. As an important component of secure multi-party computing, the shuffling protocol based on secret sharing can play a unique role in ensuring the privacy of intersection data between participants, and can effectively solve the above problems. However, the existing shuffling protocols based on secret sharing also have some problems, such as: focusing on the design of theoretical framework, lacking the specific algorithm for each process; The solution using public key is not very efficient when dealing with large data sets. Lack of certain applicability, in some areas is not very practical. In view of these limitations, this paper designs a verifiable layered shuffling protocol based on secret sharing. This protocol constructs the share conversion algorithm through the casual transfer protocol, and completes the shuffle without exposing the original data set. The Benes arrangement network is used to implement the shuffling layer, and the complex shuffling task is divided into multiple sub-tasks, which improves the efficiency of large-scale data. The idea of verifiability is introduced so that the security of the protocol is effectively guaranteed. Combined with the protocol, the corresponding privacy protection scheme is constructed. The correctness of the proposed protocol and scheme is analyzed strictly in this paper. The ideal-reality simulation paradigm was used to evaluate the safety. And compared with the corresponding protocols in terms of time cost, security, algorithm time complexity and so on. The results show that the proposed protocol can meet the security standard under the malicious model. It has certain efficiency advantages when dealing with large-scale data sets. It improves the applicability of the protocol and further promotes its application in the current environment. |
| Key words: secret sharing shuffling protocol privacy protection secure multiparty computing |
