1 / 13

A novel authenticatable color visual secret sharing scheme using non-expanded meaningful shares

A novel authenticatable color visual secret sharing scheme using non-expanded meaningful shares. D-C Lou, H-H Chen, H-C Wu, C-S Tsai, Displays, 2011. Speaker: K. Chen 2011.4.21. IF=0.812. The proposed scheme simultaneously achieves the specialties of meaningful share images

xavier-dotson
Download Presentation

A novel authenticatable color visual secret sharing scheme using non-expanded meaningful shares

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A novel authenticatable color visual secret sharing scheme using non-expanded meaningful shares • D-C Lou, H-H Chen, H-C Wu, C-S Tsai, Displays, 2011 Speaker: K. Chen 2011.4.21 IF=0.812

  2. The proposed scheme simultaneously achieves the specialties of • meaningful share images • no pixel expansion • the more quantity of hiding extra confidential image • applying to share color secret image • providing authentication ability

  3. Related works P.S. = Pixel swapping, Prob. = Probabilistic method, R. G. = Random grids

  4. Related works • Visual cryptography with extra ability of hiding confidential data W. P. Fang, J. C. Lin, Journal of Electronic Imaging, 2006 • New data hiding scheme using pixel swapping for halftone images Y. F. Chang, J. B. Feng, C.S. Tsai, Y. P. Chu, H. C. Syu, The Imaging Science Journal, 2008

  5. Visual cryptography with extra ability of hiding confidential data

  6. If s = black then “complement” If s = white then “same” Share B Share A

  7. New data hiding scheme using pixel swapping for halftone images

  8. New data hiding scheme using pixel swapping for halftone images 疊合的點是白點 (若是黑點就沒必要調整) 要調整的點和機密不同 (若是相同就沒必要調整) 找一個和要調整不同的點 (找個能顯示機密的點) 該點不能太遠 防止邊緣洩密

  9. Hb S Ha B Ha + B

  10. The proposed scheme (1)

  11. divide the two cover images Ha, Hb and secret image S into several non-overlapping 22 blocks • calculate the number of black pixels in each 22 block of the cover images, then determine the block M and F by the following • if there exists a pixel Mmn, in the block satisfying the following Case1 or Case2, the swap pixel Mij and Mmn.

  12. Ha Hb S B A + B A

More Related