Back to Search Start Over

An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial

Authors :
Zhen Wu
Yi-Ning Liu
Dong Wang
Ching-Nung Yang
Source :
Symmetry, Vol 11, Iss 1, p 69 (2019)
Publication Year :
2019
Publisher :
MDPI AG, 2019.

Abstract

As a popular technology in information security, secret image sharing is a method to guarantee the secret image’s security. Usually, the dealer would decompose the secret image into a series of shadows and then assign them to a number of participants, and only a quorum of participants could recover the secret image. Generally, it is assumed that every participant is equal. Actually, due to their position in many practical applications, some participants are given special privileges. Therefore, it is desirable to give an approach to generate shadows with different priorities shadows. In this paper, an efficient essential secret image sharing scheme using a derivative polynomial is proposed. Compared with existing related works, our proposed scheme can not only create the same-sized shadows with smaller size but also removes the concatenation operation in the sharing phase. Theoretical analysis and simulations confirm the security and effectiveness of the proposed scheme.

Details

Language :
English
ISSN :
20738994
Volume :
11
Issue :
1
Database :
Directory of Open Access Journals
Journal :
Symmetry
Publication Type :
Academic Journal
Accession number :
edsdoj.5c4293a1264d4e07a108a7530c1642d1
Document Type :
article
Full Text :
https://doi.org/10.3390/sym11010069