Selective scalable secret image sharing with adaptive pixel-embedding technique Source：Multimedia Tools and Applications, Vol. 77, No. 20, pp. 27107-27121, Oct. 2018. Authors： Ying-Chin Chen, Jung-San Lee, Hong-Chi Su Speaker：Yun-Hao Hsieh Date：2018/9/13

Outline Introduction Preliminaries Proposed mechanism Experimental results and analysis Conclusions

Introduction(1/2) – Secret image sharing Cover image Result of shadows 3 keys (t, n) (3, 5) 4 keys 5 keys

Introduction(2/2) – Scalable secret image sharing Cover image Result of shadows (3, 5) 3 keys 4 keys (3, 5) (4, 5) (5, 5) 5 keys [15] Yang CN, Chu YY (2011) A general (k, n) scalable secret image sharing scheme with the smooth scalability. J Systems and Software 84(10):1726–1733

Preliminaries(1/2) – Selective scalable secret image sharing Cover image Result of shadows (3, 5) Salient object detection 3 keys 4 keys (3, 5) (4, 5) (5, 5) 5 keys [7] Lee JS, Chen YR (2017) Selective scalable secret image sharing with verification. Multimedia Tools Application 76(1):1–11

Preliminaries(2/2) – Verification Shadows Result of shadows LSB tampered 3 keys 4 keys 5 keys

Proposed mechanism(1/5) - Sharing Share Image (3, 5) Salient object detection 1000 Pixel 600 Pixel 200 Pixel SI = Share Image I = Image [14] Wang J, Jiang H, Yuan Z, Cheng MM, Hu X, Zheng N (2017) Salient object detection: a discriminative regional feature integration approach. International Journal of Computer Vision 123(2):251–268

Proposed mechanism(2/5) - Sharing (3, 5) (4, 5) (5, 5) 290 Pixel 600 Pixel 200 Pixel 200 Pixel (10,15,20) SI = Share Image SS = Sub Shadow SP = Share Pixel K = Key (1, 45) (2, 120) (3, 235) (5, 83) (4, 139)

Proposed mechanism(3/5) - Embedding Cover Image Block 150 1 0 0 1 0 1 1 0 145 1 0 0 1 0 0 0 1 160 1 0 1 0 0 0 0 0 175 1 0 1 0 1 1 1 1 180 1 0 1 1 0 1 0 0 165 1 0 1 0 0 1 0 1 67 1 0 0 0 0 1 1 103 0 1 1 0 0 1 1 1 151 144 101 1 0 0 0 1 1 1 290 Pixel 2500 Pixel 145(10010001) + (1101) = 100100011101 K = Key CI = Cover Image BS = Block Size D = Digit SP = Share Pixel A = Authentication Nb = Number of LSB bits Ub = Used bits in a pixel

Proposed mechanism(4/5) – Decrypting and verification (3, 5) Shadow Block 151 1 0 0 1 0 1 1 1 144 1 0 0 1 0 0 0 0 160 1 0 1 0 0 0 0 0 175 1 0 1 0 1 1 1 1 180 1 0 1 1 0 1 0 0 165 1 0 1 0 0 1 0 1 67 1 0 0 0 0 1 1 101 0 1 1 0 0 1 0 1 1 0 0 0 1 1 1 290 Pixel 2500 Pixel 100100011101 = 145(10010001) + (1101) K = Key BS = Block Size D = Digit A = Authentication Nb = Number of LSB bits Ub = Used bits in a pixel 1101 = 1101

Proposed mechanism(5/5) – Decrypting and verification (3, 5) 3 keys 4 keys (1, 45) (2, 120) (3, 235) 5 keys L(x) = Lagrange polynomial

Experimental results and analysis(1/3) (3, 5) [7] Lee JS, Chen YR (2017) Selective scalable secret image sharing with verification. Multimedia Tools Application 76(1):1–11 [15] Yang CN, Chu YY (2011) A general (k, n) scalable secret image sharing scheme with the smooth scalability. J Systems and Software 84(10):1726–1733 [16] Yang CN, Huang SM (2010) Constructions and properties of k out of n scalable secret image sharing. Optics Communications 283(9):1750–1762

Experimental results and analysis(2/3) PSNR SSIM [7] Lee JS, Chen YR (2017) Selective scalable secret image sharing with verification. Multimedia Tools Application 76(1):1–11 [9] Lin CC, Tsai WH (2004) Secret image sharing with steganography and authentication. J Systems and Software 73(3): 405–414 [17] Yang CN, Chen TS, Yu KH, Wang CC (2007) Improvements of image sharing with steganography and authentication. J Systems and Software 80(7):1070–1076

Experimental results and analysis(3/3)

Conclusions Smooth scalability Selectivity Higher PSNR and SSIM

Thanks For listing

Verifying ratio of Shadow