秘密共享中的双陪集结构

ASDS

Applied Statistics and Data Science

3066-84333066-8441

Art and Technology

10.61369/ASDS.2026030008

Article

秘密共享中的双陪集结构https://artdesignp.com/journal/ASDS/2/3/10.61369/ASDS.2026030008林群

2026

2026-03-20

线性秘密共享方案（LSSS）为现代密码协议提供了计算高效的基石，而代数结构的引入能极大地丰富其理论与应用内涵。本文旨在将群论中的双陪集结构系统性地嵌入秘密共享框架，构建一个兼具代数严谨性与密码学实用性的新模型。首先，形式化定义了基于双陪集的秘密共享方案，阐明其如何将秘密编码为群中的双陪集，并将份额生成与恢复过程转化为群元素运算。其次，深入探讨了该方案的核心代数基础，即群作用下的轨道空间与访问结构的群论表征。并通过基于矩阵群的具体实例，展示了该模型在实现多级秘密共享方面的独特优势。双陪集结构所提供的代数工具，不仅能够自然地支持多级秘密共享，其内在的对偶性也使得设计高效安全的协议成为可能。这一框架在安全多方计算、分布式存储以及量子密码学等多个前沿领域展现出重要的应用潜力。秘密共享,双陪集,对偶方案,访问结构

[1]Cramer R, Damgård I, Maurer U. General secure multi-party computation from any linear secret-sharing scheme[C]. In: EUROCRYPT 2000. LNCS, vol. 1807. Springer, 2000: 316-334.[2] Habeeb M, Kahrobaei D, Koupparis C, et al. Secret sharing using group theory[J]. International Journal of Foundations of Computer Science, 2013, 24(4): 523-536.[3] Kaboli R, Khazaei S, Parviz M. On ideal and weakly-ideal access structures[J]. Advances in Mathematics of Communications, 2021, 15(1): 17-36.[4] Xing C, Yuan C. Evolving secret sharing schemes based on polynomial evaluations and algebraic geometry codes[J]. IEEE Transactions on Information Theory, 2024, 70(5): 3718-3728.[5] Abram D, Roy L, Scholl P. Succinct homomorphic secret sharing[C]. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Cham: Springer Nature Switzerland, 2024: 301-330.[6] Jafari A, Khazaei S. On Abelian secret sharing: duality and separation[J]. Cryptology ePrint Archive, Report 2019/575, 2019.[7] Jafari A, Khazaei S. Partial secret sharing schemes[J]. IEEE Transactions on Information Theory, 2023, 69(8): 5364-5385.[8] Martí-Farré J, Padró C. On secret sharing schemes, matroids and polymatroids[J]. Journal of Mathematical Cryptology, 2010, 4(2): 95-120.[9] C. Blundo, A. De Santis, D.R. Stinson, U. Vaccaro. Graph decompositions and secret sharing schemes.[J].Cryptology 1995, 8(1): 39–64.[10] Alon B, Beimel A, Lasri O. Simplified PIR and CDS protocols and improved linear secret-sharing schemes[C]. In: TCC 2025, LNCS, vol. 16269. Springer, 2025: 365-398.[11] Beimel A, Othman H, Peter N. Quadratic secret sharing and conditional disclosure of secrets[J]. IEEE Transactions on Information Theory, 2023, 69(11): 7295-7316.[12] Paskin-Cherniavsky A, Radune A. On polynomial secret sharing schemes[C]. In: ITC 2020, LIPIcs, vol. 163. 2020: 12:1-12:21.[13] Matú&scaron; F. Algebraic matroids are almost entropic[J]. Proceedings of the American Mathematical Society, 2024, 152(1): 1-6.[14] Beimel A, Farràs O, Moya A. Polynomial secret sharing schemes and algebraic matroids[C]. In: TCC 2025, LNCS, vol. 16269. Springer, 2025: 428-461.[15] Csirmaz L. Secret sharing and duality[J]. Journal of Mathematical Cryptology, 2021, 15(1): 157-173.