Access Restriction

Author Wang, Xiaojing ♦ Yuan, Qizhao ♦ Cai, Hongliang ♦ Fang, Jiajia
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2014
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword (t, n) threshold ♦ Data protection ♦ Algebraic-geometry coding ♦ Image sharing ♦ Information hiding ♦ Pixel value field $GF(2^{m})$ ♦ Twice vision sharing procedure
Abstract Image sharing is an attractive research subject in computer image techniques and in the information security field. This article presents a novel scheme of image sharing with a $(\textit{t},$ $\textit{n})$ high-security threshold structure. The scheme can encode secret images into $\textit{n}$ shadow images in such a way that all the shadow images are in a $\textit{perfect}$ and $\textit{ideal}$ $(\textit{t},$ $\textit{n})$ threshold structure, while each shadow image has its own visual content assigned at random. The most common method to implement image sharing is based on interpolation polynomial over the field $F_{p}={0,$ 1, 2,…, $\textit{p}-1}$ [Shamir 1979]. In this article, the authors present a new approach to image sharing and its computation based on algebraic-geometry code over the pixel value field $GF(2^{m}).$
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2014-12-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 61
Issue Number 6
Page Count 19
Starting Page 1
Ending Page 19

Open content in new tab

   Open content in new tab
Source: ACM Digital Library