Asymptotically ideal Disjunctive Hierarchical Secret Sharing Scheme with an Explicit Construction

TL;DR

This paper introduces an explicit construction of an asymptotically ideal Disjunctive Hierarchical Secret Sharing scheme that balances small share sizes with computational security using advanced mathematical tools.

Contribution

It presents the first explicit scheme achieving asymptotic ideality with small shares and computational security, overcoming previous limitations.

Findings

Scheme has small share sizes comparable to non-ideal schemes

Provides computational security with explicit construction

Dealer operates in polynomial time

Abstract

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.