A New Metric and Its Scheme Construction for Evolving $2$-Threshold Secret Sharing Schemes

TL;DR

This paper introduces a new metric for evolving 2-threshold secret sharing schemes, constructs a novel prefix code to optimize this metric, and establishes bounds on share size sums.

Contribution

It proposes a new metric $K_{\Sigma}$, designs a new prefix coding called $\lambda$ code, and determines bounds for optimal evolving 2-threshold secret sharing schemes.

Findings

The metric $K_{\Sigma}$ is bounded between 1.5 and 1.59375.

The $\lambda$ code achieves a $K_{\Lambda}$ of 1.59375.

The lower bound for the sum of share sizes in $(2,n)$-threshold schemes is established.

Abstract

Evolving secret sharing schemes do not require prior knowledge of the number of parties $n$ and $n$ may be infinitely countable. It is known that the evolving $2$-threshold secret sharing scheme and prefix coding of integers have a one-to-one correspondence. However, it is not known what prefix coding of integers to use to construct the scheme better. In this paper, we propose a new metric $K_{\Sigma}$ for evolving $2$-threshold secret sharing schemes $\Sigma$. We prove that the metric $K_{\Sigma}\geq 1.5$ and construct a new prefix coding of integers, termed $\lambda$ code, to achieve the metric $K_{\Lambda}=1.59375$. Thus, it is proved that the range of the metric $K_{\Sigma}$ for the optimal $(2,\infty)$-threshold secret sharing scheme is $1.5\leq K_{\Sigma}\leq1.59375$. In addition, the reachable lower bound of the sum of share sizes for $(2,n)$-threshold secret sharing schemes is proved.