A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations
A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations
复制标题
一种基于线性齐次递推关系的高效分层多重秘密共享方案
DOI：
10.1016/j.ins.2022.01.053
复制
发表时间：
2022-01
影响因子：
8.1
通讯作者：
Guoai Xu
中科院分区：
文献类型：
--
作者：
Jiangtao Yuan;Jing Yang;Chenyu Wang;Xingxing Jia;Fang-Wei Fu;Guoai Xu
分级秘密共享是一种重要的密钥管理技术，因为它是专门为分级组织定制的，不同的部门分配了不同的权限，如政府机构或公司。分级访问结构被广泛地应用于秘密共享方案中，其中效率是各种应用的首要考虑因素。如何设计一个高效的分级秘密共享方案是一个重要的问题。基于Birkhoff插值，Tassa提出了一种著名的分级秘密共享方案。后来，基于同样的方法，又提出了许多其他的HSS方案。然而，这些方案都依赖于Polya条件，而Polya条件是一个必要条件，而不是一个充分条件。它不能保证塔萨的HSS计划一直存在。此外，该条件还需要检验多个矩阵的非奇性。提出了一种基于线性齐次递推关系和单向函数的分级多秘密共享方案。在我们的方案中，我们选择m个线性无关的齐次递推关系。排序较高的子集γ1、γ2、⋯，γj-1中的参与者加入第j个子集以构建第j个LHR关系。此外，所提出的分级多秘密共享方案只要求每个参与者共享一份秘密。此外，我们的方案既完美又理想。此外，在所提出的分级秘密共享方案中，我们的方案避免了对多个矩阵的非奇异性的多次检查。虽然我们需要公布更多的公开值，但我们的方案将分级秘密共享方案的计算复杂度从指数时间降低到多项式时间，即O(n，k，m-1logn)，这比文献中的方案相对更有效。
Hierarchical secret sharing is an important key management technique since it is specially customized for hierarchical organizations with different departments allocated with different privileges, such as the government agencies or companies. Hierarchical access structures have been widely adopted in secret sharing schemes, where efficiency is the primary consideration for various applications. How to design an efficient hierarchical secret sharing scheme is an important issue. A famous hierarchical secret sharing (HSS) scheme was proposed by Tassa based on Birkhoff interpolation. Later, based on the same method, many other HSS schemes were proposed. However, these schemes all depend on Polya’s condition, which is a necessary condition, not a sufficient condition. It cannot guarantee that Tassa’s HSS scheme always exists. Furthermore, this condition needs to check the non-singularity of many matrices. We propose a hierarchical multi-secret sharing scheme based on the linear homogeneous recurrence (LHR) relations and the one-way function. In our scheme, we select m linearly independent homogeneous recurrence relations. The participants in the highly-ranked subsets γ 1, γ 2,⋯, γ j-1 join in the jth subset to construct the j th LHR relation. In addition, the proposed hierarchical multi-secret sharing scheme just requires one share for each participant. Besides, our scheme is both perfect and ideal. Furthermore, our scheme avoids many checks of the non-singularity of many matrices in the presented hierarchical secret sharing schemes. Although we need to publish more public values, our scheme reduces the computational complexity of the hierarchical secret sharing schemes from exponential time to polynomial time, ie, O (n k m-1 log n), which is relatively more efficient than schemes in the literature.
登录
查看更多内容
DOI：
10.1016/j.image.2017.10.012
发表时间：
2018-02
期刊：
Signal Process. Image Commun.
影响因子：
--
作者：
T. Bhattacharjee;S. Maity;Sheikh Rafiul Islam
通讯作者：
T. Bhattacharjee;S. Maity;Sheikh Rafiul Islam
DOI：
10.1007/s10623-013-9831-6
发表时间：
2013-05
期刊：
Designs, Codes and Cryptography
影响因子：
--
作者：
Javier Herranz;Alexandre Ruiz;Germán Sáez
通讯作者：
Javier Herranz;Alexandre Ruiz;Germán Sáez
影响因子：
2.5
作者：
Qi Chen;Chunming Tang;Zhiqiang Lin
通讯作者：
Qi Chen;Chunming Tang;Zhiqiang Lin
分层和共享访问控制
DOI：
10.1109/tifs.2015.2512533
发表时间：
2016-04
影响因子：
6.8
作者：
Arcangelo Castiglione;Alfredo De Santis;Barbara Masucci;Francesco Palmieri;Aniello Castiglione;Jin Li;Xinyi Huang
通讯作者：
Xinyi Huang
DOI：
10.1049/iet-ifs.2013.0046
发表时间：
2014-06
期刊：
IET Inf. Secur.
影响因子：
--
作者：
Mitra Fatemi;Reza Ghasemi;T. Eghlidos;M. Aref
通讯作者：
Mitra Fatemi;Reza Ghasemi;T. Eghlidos;M. Aref