A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations
From MaRDI portal
Publication:6199502
DOI10.1016/j.ins.2022.01.053OpenAlexW4225966072MaRDI QIDQ6199502
Xingxing Jia, Jing Yang, Jiang-Tao Yuan, Fang-Wei Fu, Guo-Ai Xu, Chen-Yu Wang
Publication date: 28 February 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2022.01.053
secret sharingmulti-secret sharinghierarchical access structurelinear homogeneous recurrence relation
Related Items (1)
Cites Work
- Unnamed Item
- New results and applications for multi-secret sharing schemes
- Ideal multipartite secret sharing schemes
- Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
- Hierarchical threshold secret sharing
- Multipartite secret sharing by bivariate interpolation
- Theory of codes with maximum rank distance
- Graph decompositions and secret sharing schemes
- Fair hierarchical secret sharing scheme based on smart contract
- Three \((t, n )\)-secret image sharing schemes based on homogeneous linear recursion
- Efficient explicit constructions of multipartite secret sharing schemes
- A fully dynamic secret sharing scheme
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
- Efficient explicit constructions of compartmented secret sharing schemes
- New efficient and practical verifiable multi-secret sharing schemes
- Secret sharing schemes with bipartite access structure
- How to share a secret
- Ideal Hierarchical Secret Sharing Schemes
- Ideal Multipartite Secret Sharing Schemes
- Natural Generalizations of Threshold Secret Sharing
This page was built for publication: A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations
