This is a preprint, a preliminary version of a manuscript that has not completed peer review at a journal. Research Square does not conduct peer review prior to posting preprints. The posting of a preprint on this server should not be interpreted as an endorsement of its validity or suitability for dissemination as established information or for guiding clinical practice.
Research
Threshold changeable secret image sharing using bivariate polynomial
YANXIAO LIU
XI'AN University of Technology
Corresponding Author
ORCiD: https://orcid.org/0000-0002-2507-5143
License:
This work is licensed under a CC BY 4.0 License. Read Full License
In secret image sharing (SIS) scheme, a confidential image is encrypted into multiple shadows, any group of shadows that reaches the threshold, otherwise nothing can be reconstructed at all. Most existing SIS schemes have a fixed threshold, however in this work, we consider more complicated cases that the threshold may be adjusted due to the changeable security environment. In this paper, we construct a $(k\leftrightarrow h,n)$ threshold changeable SIS (TCSIS) scheme using bivariate polynomial, which has $h-k+1$ possible thresholds $k,k+1,...,h$. During image reconstruction, each participant can update the his shadow according to the current threshold $T$ only based on his initial shadow. Comparing with previous TCSIS schemes, the proposed scheme achieves unconditional security, and can overcome the information disclosure problem caused by homomorphism.
Keywords
secret image sharing, threshold changeable, bivariate polynomial
Figure 1
Figure 2
Figure 3
Due to technical limitations, full-text HTML conversion of this manuscript could not be completed. However, the manuscript can be downloaded and accessed as a PDF.
This is a list of supplementary files associated with this preprint. Click to download.
Badges
Prescreen
This manuscript passed our Prescreen assessment
Complete author information
Appropriate declaration statements
Potential risks to human health
Prescreen
History
CURRENT STATUS: Posted
Version 2
Posted 18 May, 2020
No community comments so far
No comments provided
Metrics
Comments: 0
PDF Downloads: ...
HTML Views: ...
Subject Areas
Information Retrieval and Management
Learn more about our company.
This is a preprint. It has not completed peer review.
Research
Threshold changeable secret image sharing using bivariate polynomial
YANXIAO LIU
XI'AN University of Technology
Corresponding Author
ORCiD: https://orcid.org/0000-0002-2507-5143
Badges
Prescreen
This manuscript passed our Prescreen assessment
Complete author information
Appropriate declaration statements
Potential risks to human health
Prescreen
History
CURRENT STATUS: Posted
Version 2
Posted 18 May, 2020
No community comments so far
No comments provided
Metrics
Comments: 0
PDF Downloads: ...
HTML Views: ...
Subject Areas
Information Retrieval and Management
License:
This work is licensed under a CC BY 4.0 License. Read Full License
In secret image sharing (SIS) scheme, a confidential image is encrypted into multiple shadows, any group of shadows that reaches the threshold, otherwise nothing can be reconstructed at all. Most existing SIS schemes have a fixed threshold, however in this work, we consider more complicated cases that the threshold may be adjusted due to the changeable security environment. In this paper, we construct a $(k\leftrightarrow h,n)$ threshold changeable SIS (TCSIS) scheme using bivariate polynomial, which has $h-k+1$ possible thresholds $k,k+1,...,h$. During image reconstruction, each participant can update the his shadow according to the current threshold $T$ only based on his initial shadow. Comparing with previous TCSIS schemes, the proposed scheme achieves unconditional security, and can overcome the information disclosure problem caused by homomorphism.
Figure 1
Figure 2
Figure 3
Due to technical limitations, full-text HTML conversion of this manuscript could not be completed. However, the manuscript can be downloaded and accessed as a PDF.