Next Article in Journal
A Cluster-Based Boosting Algorithm for Bankruptcy Prediction in a Highly Imbalanced Dataset
Next Article in Special Issue
A Modified Dolph-Chebyshev Type II Function Matched Filter for Retinal Vessels Segmentation
Previous Article in Journal
From Theory to Practice: A Data Quality Framework for Classification Tasks
Previous Article in Special Issue
Weak Fault Detection for Gearboxes Using Majorization–Minimization and Asymmetric Convex Penalty Regularization
Article Menu

Export Article

Open AccessArticle
Symmetry 2018, 10(7), 249; https://doi.org/10.3390/sym10070249

Lossless and Efficient Polynomial-Based Secret Image Sharing with Reduced Shadow Size

National University of Defense Technology, Hefei 230037, China
*
Author to whom correspondence should be addressed.
Received: 10 May 2018 / Revised: 6 June 2018 / Accepted: 19 June 2018 / Published: 1 July 2018
(This article belongs to the Special Issue Symmetry in Computing Theory and Application)
View Full-Text   |   Download PDF [1790 KB, uploaded 1 July 2018]   |  

Abstract

Thien-and-Lin’s polynomial-based secret image sharing (PSIS) is utilized as the basic method to achieve PSISs with better performances, such as meaningful shares, two-in-one property and shares with different priorities. However, this (k,n) threshold PSIS cannot achieve lossless recovery for pixel values more than 250. Furthermore, current solutions to lossless recovery for PSIS have several natural drawbacks, such as large computational costs and random pixel expansion. In this paper, a lossless and efficient (k,n) threshold PSIS scheme with reduced shadow size is presented. For lossless recovery and efficiency, two adjacent pixels are specified as a secret value, the prime in the sharing polynomial is replaced with 65,537, and then the additional screening operation can ensure each shared value in the range [0,65,535]. To reduce shadows size and improve security, only the first k1 coefficients are embedded with secret values and the last coefficient is assigned randomly. To prevent the leakage of secrets, generalized Arnold permutation with special key generating strategy is performed on the secret image prior to sharing process without key distribution. Both theoretical analyses and experiments are conducted to demonstrate the effectiveness of the proposed scheme. View Full-Text
Keywords: secret sharing; polynomial-based secret image sharing; lossless recovery; reduced shadow size secret sharing; polynomial-based secret image sharing; lossless recovery; reduced shadow size
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

Zhou, X.; Lu, Y.; Yan, X.; Wang, Y.; Liu, L. Lossless and Efficient Polynomial-Based Secret Image Sharing with Reduced Shadow Size. Symmetry 2018, 10, 249.

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