Invertible secret image sharing for gray level and dithered cover images

Ulutaş, Mustafa; Ulutaş, Güzin; Nabiyev, Vasif V.

doi:10.1016/j.jss.2012.09.027

Cited by 35 publications

(31 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To demonstrate the comparison of the sharable secret capacity between the related secret-sharing schemes [Lin and Tsai 2004;Yang et al 2007;Chang et al 2008;Ulutas et al 2011;Eslami and Ahmadabadi 2011;Chen 2013;Ulutas et al 2013] with the proposed DVSS, Figure 7 shows the maximum sharable secret payload under a different setting of t. The secret payload of other schemes [Lin and Tsai 2004;Yang et al 2007] is fixed to H × W/4 pixels. The secret payload is H × W/4 × t digits with 251-ary notational system for the schemes of Chang et al [2008] and Ulutas et al [2011].…”

Section: Simulation Results and Analysismentioning

confidence: 99%

“…The secret capacity of Chen's scheme [Chen 2013] is fixed to 2 × H × W pixels and can achieve better payload than that achieved in related works. By increasing the setting value of t, we can observe that DVSS can share significantly more secret capacity than the related schemes [Lin and Tsai 2004;Yang et al 2007;Chang et al 2008;Ulutas et al 2011;Eslami and Ahmadabadi 2011;Chen 2013;Ulutas et al 2013]. In addition, the sharing scheme [Chen 2013] is incapable of satisfying the steganography purpose for the secret shadows and these schemes [Chen 2013;Ulutas et al 2013] are incapable of achieving cheater detection.…”

Section: Simulation Results and Analysismentioning

confidence: 99%

See 1 more Smart Citation

Double Verification Secret Sharing Mechanism Based on Adaptive Pixel Pair Matching

Lin

2015

ACM Trans. Multimedia Comput. Commun. Appl.

View full text Add to dashboard Cite

Verifiability is essential for the secret sharing approach, which allows the involved participants to detect cheaters during the secret retrieval process. In this article, we propose a double verification secret sharing (DVSS) mechanism that can not only prevent fraudulent participants but also satisfy the requirements of secret payload, camouflage, image fidelity and lossless revealed secret. DVSS offers double verification process to enhance the cheater detectability; experimental results reveal that the designed scheme can share larger secret capacity and retain superior image quality than the related secret sharing methods. ACM Reference Format:Pei-Yu Lin. 2015. Double verification secret sharing mechanism based on adaptive pixel pair matching. ACM Trans. Multimedia Comput.

show abstract

Section: Simulation Results and Analysismentioning

confidence: 99%

Section: Simulation Results and Analysismentioning

confidence: 99%

Double Verification Secret Sharing Mechanism Based on Adaptive Pixel Pair Matching

Lin

2015

ACM Trans. Multimedia Comput. Commun. Appl.

View full text Add to dashboard Cite

show abstract

“…Compared with (Yang et al [19]; Lin et al, [9]; Ulutas et al [16]), which can only share one secret image during one share process, the new scheme provides a method to distribute multiple secret images with good performance. In the new scheme, m secret images can be shared in the way that one participant holds just one shadow image, while m×n shadow images are needed for a non-multisecret image sharing scheme.…”

Section: Discussionmentioning

confidence: 99%

“…In 2009, the modulus operator was employed by Lin et al [9] such that the shadow images are meaningful with satisfactory quality and both the retrieved secret image and the reconstructed cover image are lossless. In 2013, Ulutas et al [16] utilized Exploiting Modification Direction (EMD) and modulus operator to design an invertible secret image sharing scheme, where the quality of the shadow images is highly improved for both gray level and binary cover images. In 2014, a novel hierarchical threshold secret image sharing scheme was proposed by Pakniat et al [12].…”

mentioning

confidence: 99%

A multi-threshold secret image sharing scheme based on the generalized Chinese reminder theorem

Guo

Zhang

Song

et al. 2015

Multimed Tools Appl

View full text Add to dashboard Cite

In a multi-secret image sharing scheme, participants are able to share multiple secret images such the way that each secret image can be reconstructed according to the corresponding access structure. In this paper, employing Chan and Chang's multi-secret sharing, we propose a new multi-threshold secret image sharing scheme. In the secret image sharing process, based on the generalized CRT, secret values are produced according to the associated access structures. The shadow images can be generated by embedding the secret values into a cover image using the quantization operation. The new scheme allows a qualified subset of participants to retrieve the related secret image. Moreover, any monotone access structure can be realized with a deletion procedure. The experiments demonstrate that secret images can be recovered without distortion. Besides, the quality of the shadow images is satisfactory and the capacity of embedded secret values is acceptable especially under binary images.

show abstract

“…These schemes include sharing a secret image among host images [8,14,20], sharing with authentication [25], 2 Literature review Section 2.1 provides a review of the work of Chen and Wu [5], who used Boolean operations to share n-1 secret images among n shared images. Chen and Wu increased the sharing capacity and shared image security [6], as described in Section 2.2.…”

Section: Introductionmentioning

confidence: 99%

Highly efficient and secure multi-secret image sharing scheme

Chen

2015

Multimed Tools Appl

View full text Add to dashboard Cite

This paper presents a novel highly efficient secret image sharing scheme that is symmetric, Boolean-based, secure, and enables multi-secret image sharing. The proposed (n, n) scheme involves sharing n secret images among n shared images and recovers all n secret images from n shared images, and losing any shared image prevents recovering any secret image. We propose a novel symmetric sharing-recovery function (SSRF) for performing sharing and recovery. The scheme is based on Boolean operations to attain low computational complexity and is more secure than previous Boolean-based schemes; it exhibits more randomness in each shared image, more randomness between two or more shared images, and higher shared image sensitivity. The experimental results showed that a similar CPU computation time is required for both generating shared images from secret images, and recovering secret images from shared images. Furthermore, the computation time of the SSRF is proportional to the number of secret images.

show abstract

Invertible secret image sharing for gray level and dithered cover images

Cited by 35 publications

References 15 publications

Double Verification Secret Sharing Mechanism Based on Adaptive Pixel Pair Matching

Double Verification Secret Sharing Mechanism Based on Adaptive Pixel Pair Matching

A multi-threshold secret image sharing scheme based on the generalized Chinese reminder theorem

Highly efficient and secure multi-secret image sharing scheme

Contact Info

Product

Resources

About