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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Design of a Secret Sharing Scheme with Mandatory Subgroup Participation

Кунболат Алгазы, Dilmukhanbet Dyusenbayev, Нурсулу Капалова, Ардабек Хомпыш
Applied Sciences
Cryptography and Data Security
article

Design of a Secret Sharing Scheme with Mandatory Subgroup Participation

Кунболат Алгазы, Dilmukhanbet Dyusenbayev, Нурсулу Капалова, Ардабек Хомпыш
article en

Abstract

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.

Applied SciencesVol. 15(17)
Institute of Information and Computational Technologies (KZ), Kazakh German University (KZ)
Openalex Percentile: Top 88%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.