arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.01144cs.ITcs.CRmath.IT
收藏

多项式环上演化型k-阈值秘密共享方案的构造

A Construction of Evolving $k$-threshold Secret Sharing Scheme over A Polynomial Ring

Qi Cheng, Hongru Cao, Sian-Jheng Lin, Nenghai Yu

AI总结:

本文针对演化型秘密共享场景,结合前缀码与多项式环性质构造了具备正确性和完美安全性的演化型k-阈值秘密共享方案,优化了份额大小,为2-阈值方案提供统一解密方式。

摘要:

阈值秘密共享方案允许分发者将份额分发给每位参与者,使得秘密能从一定数量的份额中被正确恢复。传统的(k,n)-阈值秘密共享方案要求参与者数量n是预先已知的。与之相对,演化型秘密共享方案允许n是不确定的,甚至可以持续增长。本文研究演化型秘密共享场景。利用前缀码和多项式环的性质,我们提出了一种全新的、在多项式环上构造的针对ℓ比特秘密的演化型k-阈值秘密共享方案,该方案具备正确性和完美安全性。所提出的方案建立了前缀码与k≥2的演化型方案之间的联系,同时也是首个通过将Shamir方案推广到多项式环上实现的演化型k-阈值秘密共享方案。具体而言,该方案还为已有的演化型2-阈值秘密共享方案提供了统一的数学解密方式。此外,对所提方案的分析表明,第t个份额的大小为(k-1)(ℓ_t-1)+ℓ比特,其中ℓ_t表示对整数t进行编码的二进制前缀码的长度。特别地,当选择δ码作为前缀码时,份额大小达到(k-1)⌊lg t⌋+2(k-1)⌊lg(⌊lg t⌋+1)⌋+ℓ,这一结果优于此前的最优结果(k-1)lg t+6k⁴ℓ lg lg t·lg lg lg t+7k⁴ℓ lg k,其中lg表示二进制对数。当k=2时,所提方案还实现了单比特秘密的最小份额大小,与已知的最优方案一致。

英文摘要:

The threshold secret sharing scheme allows the dealer to distribute the share to every participant such that the secret is correctly recovered from a certain amount of shares. The traditional $(k, n)$-threshold secret sharing scheme requests that the number of participants $n$ is known in advance. In contrast, the evolving secret sharing scheme allows that $n$ can be uncertain and even ever-growing. In this paper, we consider the evolving secret sharing scenario. Using the prefix codes and the properties of the polynomial ring, we propose a brand-new construction of evolving $k$-threshold secret sharing scheme for an $\ell$-bit secret over a polynomial ring, with correctness and perfect security. The proposed schemes establish the connection between prefix codes and the evolving schemes for $k\geq2$, and are also first evolving $k$-threshold secret sharing schemes by generalizing Shamir's scheme onto a polynomial ring. Specifically, the proposal also provides an unified mathematical decryption for prior evolving $2$-threshold secret sharing schemes. Besides, the analysis of the proposed schemes show that the size of the $t$-th share is $(k-1)(\ell_t-1)+\ell$ bits, where $\ell_t$ denotes the length of a binary prefix code of encoding integer $t$. In particular, when $δ$ code is chosen as the prefix code, the share size achieves $(k-1)\lfloor\lg t\rfloor+2(k-1)\lfloor\lg ({\lfloor\lg t\rfloor+1}) \rfloor+\ell$, which improves the prior best result $(k-1)\lg t+6k^4\ell\lg{\lg t}\cdot\lg{\lg {\lg t}}+ 7k^4\ell\lg k$, where $\lg$ denotes the binary logarithm. When $k=2$, the proposed scheme also achieves the minimal share size for single-bit secret, which is the same as the best known scheme.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑