Next Article in Journal
Application of Fixed Point Results on Rational F-Contraction Mappings to Solve Boundary Value Problems
Next Article in Special Issue
An Information Theoretically Secure E-Lottery Scheme Based on Symmetric Bivariate Polynomials
Previous Article in Journal
Harmonic Superspace Approach to the Effective Action in Six-Dimensional Supersymmetric Gauge Theories
Previous Article in Special Issue
Exploring Symmetry of Binary Classification Performance Metrics
Article Menu

Export Article

Open AccessArticle
Symmetry 2019, 11(1), 69; https://doi.org/10.3390/sym11010069

An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial

1
School of Information and Communication, Guilin University of Electronic Technology, Guilin 451000, China
2
Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin 451000, China
3
School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin 451000, China
4
Department of CISE, National Dong Hwa University, Hualien City 97047, Taiwan
*
Authors to whom correspondence should be addressed.
Received: 30 November 2018 / Revised: 21 December 2018 / Accepted: 30 December 2018 / Published: 8 January 2019
(This article belongs to the Special Issue Symmetry in Computing Theory and Application)
Full-Text   |   PDF [7478 KB, uploaded 11 January 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. View Full-Text
Keywords: essential secret image sharing; Lagrange interpolation; derivative polynomial essential secret image sharing; Lagrange interpolation; derivative polynomial
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Wu, Z.; Liu, Y.-N.; Wang, D.; Yang, C.-N. An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial. Symmetry 2019, 11, 69.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top