Design of a Secret Sharing Scheme with Mandatory Subgroup Participation
This paper proposes an approach based on a secret sharing scheme with the mandatory participation of predefined subgroups. The proposed scheme allows secret reconstruction only when representatives from each designated group of participants (e.g., cloud providers, legally independent parties, etc.) are present. This mechanism enhances resistance to internal collusion, strengthens access control, and enables distributed management. The structure and mathematical foundations of the proposed scheme are presented, along with an analysis of its properties. A cryptanalysis is conducted, evaluating the scheme’s resilience to various types of attacks, and the results are discussed. The computational complexity of the algorithm is also analyzed, and its resource efficiency is confirmed.
Authors
- Кунболат Алгазы (ORCID: https://orcid.org/0000-0003-3670-2170)
- Dilmukhanbet Dyusenbayev (ORCID: https://orcid.org/0000-0002-4835-1075)
- Нурсулу Капалова (ORCID: https://orcid.org/0000-0001-9743-9981)
- Ардабек Хомпыш (ORCID: https://orcid.org/0000-0002-0702-9346)
Institutions
- Institute of Information and Computational Technologies (KZ)
- Kazakh German University (KZ)
Publication Details
- Journal
- Applied Sciences
- Published
- 2025-08-30
- DOI
- https://doi.org/10.3390/app15179550
- Primary Topic
- Cryptography and Data Security
- Type
- article
- Field-Weighted Citation Impact
- 0.00