10-04-2017, 09:06 PM
An Image Secret Sharing Method
[attachment=56]
Abstract
This paper presents an image secret
sharing method which essentially incorporates two
k-out-of-n secret sharing schemes: i) Shamir's se-
cret sharing scheme and ii) matrix projection secret
sharing scheme.
Introduction
The e ective and secure protections of sensitive infor-
mation [18] are primary concerns in commercial, med-
ical and military systems (e.g. communication systems
or network storage systems). Needless to say, it is also
important for an information fusion process to ensure
data is not being tampered. Encryption methods are
one of the popular approaches to ensure the integrity
and secrecy of the protected information. However,
one of the critical vulnerabilities of encryption tech-
niques is single-point-failure. For example, the secret
information cannot be recovered if the decryption key
is lost or the encrypted content is corrupted during the
transmission. To address these reliability problems, in
particular for large information content items such as
secret images (say satellite photos or medical images),
an image secret sharing scheme (SS) is a good alter-
native to remedy such vulnerabilities.
Review of Secret Sharing
Schemes
We describe several (k, n) threshold-based SSs and
describe how a secret and an image is shared among
n participants. These schemes are brie y described in
this section with their interesting features.
Matrix Projection Secret Sharing
Scheme
Bai [2] developed a SS using matrix projection. The
idea is based upon the invariance property of matrix
projection. This scheme can be used to share multiple
secrets, and detail of the scheme can be found in [2].
Here, we brie y describe the procedure in two phases:
Proposed Method
Among several interesting properties of matrix projec-
tion SS, an image application can be easily extended
from this scheme's ability to share multiple secrets.
The pixels in an image can be regarded as matrix el-
ements. Although the technique is not a PSS scheme,
it has strong protection of the secret [2] even if the re-
minder matrix R is made public. However, matrix R
can become single-point-failure if it is corrupted or lost.
To overcome this problem, we propose to use Thien and
Lin's method (which is essentially a Shamir's SS) to
share the remainder matrix R without any permuta-
tion. As we discussed in section 2, Thien and Lin's
method cannot protect matrix R securely, but it does
not a ect the protection capability on the projection
matrix.