Asymptotically ideal Disjunctive Hierarchical Secret Sharing Scheme with an Explicit Construction
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_ | 1866917351232897024 |
|---|---|
| author | Ding, Jian Wang, Cheng Yu, Haifeng Li, Hongju Shu, Cheng |
| author_facet | Ding, Jian Wang, Cheng Yu, Haifeng Li, Hongju Shu, Cheng |
| contents | Disjunctive Hierarchical Secret Sharing (DHSS) scheme is a secret sharing scheme in which the set of all participants is partitioned into disjoint subsets. Each disjoint subset is said to be a level, and different levels have different degrees of trust and different thresholds. If the number of cooperating participants from a given level falls to meet its threshold, the shortfall can be compensated by participants from higher levels. Many ideal DHSS schemes have been proposed, but they often suffer from big share sizes. Conversely, existing non-ideal DHSS schemes achieve small share sizes, yet they fail to be both secure and asymptotically ideal simultaneously. In this work, we present an explicit construct of an asymptotically ideal DHSS scheme by using a polynomial, multiple linear homogeneous recurrence relations and one-way functions. Although our scheme has computational security and many public values, it has a small share size and the dealer is required polynomial time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_17257 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Asymptotically ideal Disjunctive Hierarchical Secret Sharing Scheme with an Explicit Construction Ding, Jian Wang, Cheng Yu, Haifeng Li, Hongju Shu, Cheng Information Theory Disjunctive Hierarchical Secret Sharing (DHSS) scheme is a secret sharing scheme in which the set of all participants is partitioned into disjoint subsets. Each disjoint subset is said to be a level, and different levels have different degrees of trust and different thresholds. If the number of cooperating participants from a given level falls to meet its threshold, the shortfall can be compensated by participants from higher levels. Many ideal DHSS schemes have been proposed, but they often suffer from big share sizes. Conversely, existing non-ideal DHSS schemes achieve small share sizes, yet they fail to be both secure and asymptotically ideal simultaneously. In this work, we present an explicit construct of an asymptotically ideal DHSS scheme by using a polynomial, multiple linear homogeneous recurrence relations and one-way functions. Although our scheme has computational security and many public values, it has a small share size and the dealer is required polynomial time. |
| title | Asymptotically ideal Disjunctive Hierarchical Secret Sharing Scheme with an Explicit Construction |
| topic | Information Theory |
| url | https://arxiv.org/abs/2603.17257 |