An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial
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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-01-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-8994/11/1/69 |
| _version_ | 1811185027874029568 |
|---|---|
| author | Zhen Wu Yi-Ning Liu Dong Wang Ching-Nung Yang |
| author_facet | Zhen Wu Yi-Ning Liu Dong Wang Ching-Nung Yang |
| author_sort | Zhen Wu |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-11T13:22:14Z |
| format | Article |
| id | doaj.art-5c4293a1264d4e07a108a7530c1642d1 |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-04-11T13:22:14Z |
| publishDate | 2019-01-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-5c4293a1264d4e07a108a7530c1642d12022-12-22T04:22:10ZengMDPI AGSymmetry2073-89942019-01-011116910.3390/sym11010069sym11010069An Efficient Essential Secret Image Sharing Scheme Using Derivative PolynomialZhen Wu0Yi-Ning Liu1Dong Wang2Ching-Nung Yang3School of Information and Communication, Guilin University of Electronic Technology, Guilin 451000, ChinaSchool of Information and Communication, Guilin University of Electronic Technology, Guilin 451000, ChinaSchool of Mathematics and Computational S cience, Guilin University of Electronic Technology, Guilin 451000, ChinaDepartment of CISE, National Dong Hwa University, Hualien City 97047, TaiwanAs 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.http://www.mdpi.com/2073-8994/11/1/69essential secret image sharingLagrange interpolationderivative polynomial |
| spellingShingle | Zhen Wu Yi-Ning Liu Dong Wang Ching-Nung Yang An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial Symmetry essential secret image sharing Lagrange interpolation derivative polynomial |
| title | An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial |
| title_full | An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial |
| title_fullStr | An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial |
| title_full_unstemmed | An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial |
| title_short | An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial |
| title_sort | efficient essential secret image sharing scheme using derivative polynomial |
| topic | essential secret image sharing Lagrange interpolation derivative polynomial |
| url | http://www.mdpi.com/2073-8994/11/1/69 |
| work_keys_str_mv | AT zhenwu anefficientessentialsecretimagesharingschemeusingderivativepolynomial AT yiningliu anefficientessentialsecretimagesharingschemeusingderivativepolynomial AT dongwang anefficientessentialsecretimagesharingschemeusingderivativepolynomial AT chingnungyang anefficientessentialsecretimagesharingschemeusingderivativepolynomial AT zhenwu efficientessentialsecretimagesharingschemeusingderivativepolynomial AT yiningliu efficientessentialsecretimagesharingschemeusingderivativepolynomial AT dongwang efficientessentialsecretimagesharingschemeusingderivativepolynomial AT chingnungyang efficientessentialsecretimagesharingschemeusingderivativepolynomial |