Secret Image Sharing Scheme with Threshold Changeable Capability
نویسندگان
چکیده
منابع مشابه
Threshold changeable secret sharing schemes revisited
This paper studies the methods for changing thresholds in the absence of secure channels after the setup of threshold secret sharing schemes. First, we construct a perfect (t, n) threshold scheme that is threshold changeable to t ′ > t , which is optimal with respect to the share size. This improves the scheme of Wang and Wong by relaxing the requirement from q ≥ n + v to q > n with the secret-...
متن کاملSecret image sharing scheme with hierarchical threshold access structure
A hierarchical threshold secret image sharing (HTSIS) scheme is a method to share a secret image among a set of participants with different levels of authority. Recently, Guo et al. (2012) [22] proposed a HTSIS scheme based on steganography and Birkhoff interpolation. However, their scheme does not provide the required secrecy needed for HTSIS schemes so that some non-authorized subsets of part...
متن کاملThreshold Secret Image Sharing
A (k, n) threshold secret image sharing scheme, abbreviated as (k, n)-TSISS, splits a secret image into n shadow images in such a way that any k shadow images can be used to reconstruct the secret image exactly. In 2002, for (k, n)-TSISS, Thien and Lin reduced the size of each shadow image to 1 k of the original secret image. Their main technique is by adopting all coefficients of a (k − 1)-deg...
متن کاملNovel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation
After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed ...
متن کاملAnalysis and Design of Multiple Threshold Changeable Secret Sharing Schemes
In a (r, n)-threshold secret sharing scheme, no group of (r − 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time. In order to deal with this issue, one may also require to have the ability to increase the threshold value from r to r′(> r), such an increment is likely to happen several times. In this paper, we study the problem o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2016
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2016/9576074