A perfect secret sharing scheme for general access structures
From MaRDI portal
Publication:6118655
DOI10.1016/j.ins.2022.02.016OpenAlexW4212797854MaRDI QIDQ6118655
XiangYang Luo, Yusheng Guo, Xingxing Jia, Dao-Shun Wang, Chaoyang Zhang
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.02.016
polynomial ringsecret sharingChinese remainder theoremgeneral access structureintegral linear programming
Linear programming (90C05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Hierarchical threshold secret sharing
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- A collaborative secret sharing scheme based on the Chinese remainder theorem
- Efficient explicit constructions of multipartite secret sharing schemes
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
- Optimal assignment schemes for general access structures based on linear programming
- Realizing secret sharing with general access structure
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- How to share a secret
- New Results on Visual Cryptography
- How to Share a Secret
- A modular approach to key safeguarding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A perfect secret sharing scheme for general access structures
