- 期刊
Double Verifiable Lossless Secret Sharing Based on Hyper-chaos Generated Random Grid
摘要
A novel multi secret sharing scheme is proposed in this paper. In the scheme, n secret images are firstly encrypted by hyper-chaos whose initial values are hash of the image itself. Then the encrypted images are shuffled into n confused images; lastly, the confused images are used to generate n sharing images using the random grid method. The proposed scheme has the advantage such that it can lossless restore the original secret image, and have the double verification ability, that is to say, it can verify whether the anyone of the sharing is modified, and it can also verify the whether the anyone of the original secret image is completely reconstructed. The above ad- vantages make it especially suitable for secret sharing of important images such as medical and military images. Experimental results and some comparison analysis are given to testify the effectiveness of the proposed scheme.
被引用紀錄
延伸閱讀
- Huang, S. Y. (2022). A Study of (n, n) XOR-based Visual Multi-Secrets Sharing Scheme with Meaningful Shares [master's thesis, National Chi Nan University]. Airiti Library. https://doi.org/10.6837/ncnu202200036
- Chen, C. C., & Fu, W. Y. (2008). A Geometry-Based Secret Image Sharing Approach. Journal of Information Science and Engineering, 24(5), 1567-1577. https://doi.org/10.6688/JISE.2008.24.5.18
- 陳宗和、曾得宇、曹凱翔（2010）。Visual Multi-Secret Sharing by Circular Random Grids。資訊安全通訊，16(2)，37-49。https://doi.org/10.29614/DRMM.201004.0003
- Chen, Y. W. (2017). Secret image sharing with meaningful shares based on random grids [master's thesis, National Taichung University of Science and Technology]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0061-2908201719135700
- Chen, X., Liu, Y., Chang, C. C., & Guo, C. (2014). Generalized Secret Sharing with Linear Hierarchical Secrets. International Journal of Network Security, 16(6), 411-419. https://doi.org/10.6633/IJNS.201411.16(6).02