Novel CRT-based Asymptotically Ideal Disjunctive Hierarchical Secret Sharing Scheme
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917349855068160 |
|---|---|
| author | Li, Hongju Ding, Jian Miao, Fuyou Wang, Cheng Shu, Cheng |
| author_facet | Li, Hongju Ding, Jian Miao, Fuyou Wang, Cheng Shu, Cheng |
| contents | Disjunctive Hierarchical Secret Sharing (DHSS)} scheme is a type of secret sharing scheme in which the set of all participants is partitioned into disjoint subsets, and each subset is said to be a level with different degrees of trust and different thresholds. In this work, we focus on the Chinese Remainder Theorem (CRT)-based DHSS schemes due to their ability to accommodate flexible share sizes. We point out that the ideal DHSS scheme of Yang et al. (ISIT, 2024) and the asymptotically ideal DHSS scheme of Tiplea et al. (IET Information Security, 2021) are insecure. Consequently, existing CRT-based DHSS schemes either exhibit security flaws or have an information rate less than $\frac{1}{2}$. To address these limitations, we propose a CRT-based asymptotically perfect DHSS scheme that supports flexible share sizes. Notably, our scheme is asymptotically ideal when all shares are equal in size. Its information rate achieves one and it has computational security. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_16267 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Novel CRT-based Asymptotically Ideal Disjunctive Hierarchical Secret Sharing Scheme Li, Hongju Ding, Jian Miao, Fuyou Wang, Cheng Shu, Cheng Cryptography and Security Information Theory Disjunctive Hierarchical Secret Sharing (DHSS)} scheme is a type of secret sharing scheme in which the set of all participants is partitioned into disjoint subsets, and each subset is said to be a level with different degrees of trust and different thresholds. In this work, we focus on the Chinese Remainder Theorem (CRT)-based DHSS schemes due to their ability to accommodate flexible share sizes. We point out that the ideal DHSS scheme of Yang et al. (ISIT, 2024) and the asymptotically ideal DHSS scheme of Tiplea et al. (IET Information Security, 2021) are insecure. Consequently, existing CRT-based DHSS schemes either exhibit security flaws or have an information rate less than $\frac{1}{2}$. To address these limitations, we propose a CRT-based asymptotically perfect DHSS scheme that supports flexible share sizes. Notably, our scheme is asymptotically ideal when all shares are equal in size. Its information rate achieves one and it has computational security. |
| title | Novel CRT-based Asymptotically Ideal Disjunctive Hierarchical Secret Sharing Scheme |
| topic | Cryptography and Security Information Theory |
| url | https://arxiv.org/abs/2603.16267 |