基于秘密共享的可验证分层洗牌协议设计及其应用方案

张艳硕; 满子琪; 周幸妤; 杨亚涛; 谢绒娜

引用本文：

张艳硕,满子琪,周幸妤,杨亚涛,谢绒娜.基于秘密共享的可验证分层洗牌协议设计及其应用方案[J].信息安全学报,2026,11(2):178-190 [点击复制]
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,2026,11(2):178-190 [点击复制]

本文已被：浏览 11次下载 6次	码上扫一扫！
基于秘密共享的可验证分层洗牌协议设计及其应用方案
张艳硕¹, 满子琪¹, 周幸妤¹, 杨亚涛², 谢绒娜¹
0 字体:加大+\|默认\|缩小-
(1.北京电子科技学院密码科学与技术系北京中国 100070;2.北京电子科技学院电子与通信工程系北京中国 100070)

摘要:

现有的基于秘密共享的洗牌协议存在着一些问题,例如:多集中于理论框架的设计,缺少每一流程实现的具体算法;多采用公钥的解决方案,在处理大规模数据集时效率不是很高;缺乏一定的适用性,在一些应用领域不是很实用。鉴于这些局限,本文设计了一种基于秘密共享的可验证分层洗牌协议。与此同时,为了结合具体应用场景,本文还设计了一种基于洗牌协议的隐私保护方案。本协议通过不经意传输协议构建改进的份额转换算法,在不暴露原数据集的前提下完成了洗牌;利用Benes排列网络实现洗牌分层,将复杂的洗牌任务分为多个简易的子任务,提高了大规模数据下的效率;引入可验证的思想,从而使协议的安全性得到了有效保证。本文对所提出协议的正确性进行了严格分析;运用理想-现实模拟范式对安全性进行了评估;并与相应的协议在时间开销、安全性、算法时间复杂度等方面进行了对比分析。结果表明,本文提出的基于秘密共享的可验证分层洗牌协议能够满足恶意模型下的安全性标准;在处理大规模数据集时有一定的效率优势;提升了协议的适用性,进一步推广了在当下环境中的应用。

关键词: 秘密共享洗牌安全多方计算隐私保护

DOI：10.19363/J.cnki.cn10-1380/tn.2026.03.11

投稿时间：2024-07-29修订日期：2025-01-02

基金项目:本课题得到中央高校基本科研业务费(No.3282024003)、国家自然科学基金项目(No.62002003)资助。

Design of Verifiable Layered Shuffling Protocol based on Secret Sharing and Its Application Scheme

ZHANG Yanshuo¹, MAN Ziqi¹, ZHOU Xingyu¹, YANG Yatao², XIE Rongna¹

(1.Department of Cryptology Science and Technology, Beijing Electronic Science & Technology Institute, Beijing 100070, China;2.Department of Electronic and Communication Engineering, Beijing Electronic Science & Technology Institute, Beijing 100070, China)

Abstract:

The existing shuffling protocols based on secret sharing have some problems, for instance: the existing shuffling protocols mainly focus on the design of theoretical framework, and lack the specific algorithm for each step of the process; Most of the solutions of the existing shuffling protocols using public key are not efficient when dealing with large data sets. The existing shuffling protocol lacks some applicability and is not very practical in some application fields. In view of these limitations, this paper designs a verifiable layered shuffling protocol based on secret sharing. At the same time, in order to combine the specific application scenario, this paper also designed a privacy protection scheme based on the shuffling protocol. In this protocol, an improved share conversion algorithm is constructed on the basis of inadvertent transfer protocol, and the original data set is shuffled without exposing the original data set. The Benes arrangement network is used to realize the shuffling layer, and then the complex shuffling task is divided into multiple sub-tasks that are easy to implement, which improves the processing efficiency of large-scale data. Furthermore, the idea of verifiability is introduced, which ensures the security of the shuffling protocol by allowing participants to confirm that the shuffling process was correctly performed. The correctness of the proposed protocol is analyzed strictly in this paper. The ideal-reality simulation paradigm was used to evaluate the security of the shuffling protocol. The time cost, security and time complexity of algorithm of the shuffling protocol are compared with other protocols. The results of the protocol show that the verifiable layered shuffling protocol based on secret sharing can meet the security standard under the malicious model. It has certain advantages in efficiency 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