A High-capacity Information Hiding Scheme Based on Blakley Secret Sharing
A high-capacity reversible information hiding scheme based on Blakley secret sharing is proposed to address the issues of low embedding rate and weak disaster recovery performance of images when using reversible information hiding to protect data in scenarios with large data transmission. The scheme employs Euclidean division and a two-dimensional modulus function to establish a robust mapping relationship between the secret information and the pixels of the cover image. Subsequently, the values derived from the preprocessing of the secret information are incorporated into the secret sharing method proposed by Blakley as the elements of the secret vector. The proposed scheme exploits the disaster-tolerance property of the secret sharing method and enhances the redundancy of the secret-carrying encrypted image, thereby improving the embedding rate and security of the algorithm while maintaining the security of the secret sharing.
Authors
- Hongliang Cai (ORCID: https://orcid.org/0000-0003-2219-2480)
- Jincheng Zhou (ORCID: https://orcid.org/0000-0002-1995-4002)
- Yujie Shen
- Nan Bai (ORCID: https://orcid.org/0000-0001-7637-3629)
- Yue Li (ORCID: https://orcid.org/0000-0002-3964-5645)
- Dan Tang (ORCID: https://orcid.org/0000-0002-3080-462X)
- Jing Gong (ORCID: https://orcid.org/0000-0002-0040-5839)
Institutions
- Chengdu University of Information Technology (CN)
- Sichuan University of Science and Engineering (CN)
Publication Details
- Published
- 2024-12-20
- DOI
- https://doi.org/10.1109/aiim64537.2024.10934256
- Primary Topic
- Advanced Steganography and Watermarking Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00