Please use this identifier to cite or link to this item:
|Title: ||Image Tamper Detection and Recovery Based on Dual Watermarks Sharing Strategy|
|Authors: ||陳宜惠;Chen, Yi-Hui;張真誠;Chang, Chin-Chen|
|Issue Date: ||2012-11-26 13:57:52 (UTC+8)|
|Abstract: ||Secret sharing, a so-called a (t, n)-threshold secret sharing scheme, is a technique which disperses secrets into n shares and then requires at least t shares to reconstruct the original secrets, where t < n. In other words, no information about it can be obtained as long as there are t-1 or fewer participants for joining in the reconstructing procedure. This concept was first proposed by Shamir in 1979 , who defined the idea of visual cryptography used for digital images . The scheme applies the Xeroxing technique to distribute the secret image into several transparencies and then to stack them so it can be retrieved with the human eyes without any computations. Following Shamir's method, several studies [1, 7, 9, 13, 14] used the concept to provide related visual cryptography techniques with better performances.
Unfortunately, the image retrieved in this process is different from the original one that it is unsuited for use in some sensitive applications, such as military and medical image processing, domains in which any distortion will result in intolerable errors in evaluation. Moreover, when the shares are transmitted over the Internet, they are meaningless, seen as noise-like images suspicious to censors.
Several ideas for hiding shares in meaningful content have been proposed with steganographic techniques, in which the secret image can be fully reconstructed as presented in schemes [2, 4, 6, 14, 15]. Steganography is the art of hiding data to convey secrets behind the cover image and avoid arousing suspicion. In certain applications, there is a risk that wrong secret is obtained because the shares might be lost incidentally or modified intentionally. Therefore, many related studies have proposed ways to import authentication mechanisms by using a fragile watermark to verify the fidelity of all shares before the secret is reconstructed. When all the shares successfully pass the verification, the secret image should be completely reconstructed; however, if any of the shared data is inauthentic, the secret image will never be obtained.
|Relation: ||Journal of Digital Information Management|
|Appears in Collections:||[資訊工程學系] 期刊論文|
Files in This Item:
All items in ASIAIR are protected by copyright, with all rights reserved.