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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A High-capacity Information Hiding Scheme Based on Blakley Secret Sharing

Hongliang Cai, Jincheng Zhou, Yujie Shen, Nan Bai et al.
Advanced Steganography and Watermarking Techniques
article

A High-capacity Information Hiding Scheme Based on Blakley Secret Sharing

Hongliang Cai, Jincheng Zhou, Yujie Shen, Nan Bai, Yue Li, Dan Tang, Jing Gong
article en

Abstract

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.

Chengdu University of Information Technology (CN), Sichuan University of Science and Engineering (CN)
Openalex Percentile: Top 71%
Advanced Steganography and Watermarking Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A High-capacity Information Hiding Scheme Based on Blakley Secret Sharing — Hongliang Cai, Jincheng Zhou, et al. · (2024) | TGRS Research Map | TGRS