ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지
DOI QR코드

DOI QR Code

Constructions and Properties of General (k, n) Block-Based Progressive Visual Cryptography

  • Yang, Ching-Nung (Department of Computer Science and Information Engineering, National Dong Hwa University) ;
  • Wu, Chih-Cheng (Department of Computer Science and Information Engineering, National Dong Hwa University) ;
  • Lin, Yi-Chin (Department of Computer Science and Information Engineering, National Dong Hwa University) ;
  • Kim, Cheonshik (Department of Digital Media Engineering, Anyang University)
  • Received : 2014.03.16
  • Accepted : 2015.07.14
  • Published : 2015.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

Recently, Hou and others introduced a (2, n) block-based progressive visual cryptographic scheme (BPVCS) in which image blocks can be gradually recovered step by step. In Hou and others' (2, n)-BPVCS, a secret image is subdivided into n non-overlapping image blocks. When t ($2{\leq}t{\leq} n$) participants stack their shadow images, all the image blocks associated with these t participants will be recovered. However, Hou and others' scheme is only a simple 2-out-of-n case. In this paper, we discuss a general (k, n)-BPVCS for any k and n. Our main contribution is to give two constructions (Construction 1 and Construction 2) of this general (k, n)-BPVCS. Also, we theoretically prove that both constructions satisfy a threshold property and progressive recovery of the proposed (k, n)-BPVCS. For k = 2, Construction 1 is reduced to Hou and others' (2, n)-BPVCS.

Keywords

Acknowledgement

Supported by : National Research Foundation of Korea (NRF)

References

  1. S. Cimato and C.-N. Yang, "Visual Cryptography and Secret Image Sharing," New York, USA: CRC Press, Aug. 2011, pp. 5-16.
  2. M. Naor and A. Shamir, "Visual Cryptography," Workshop Theory Appl. Cryptographic Techn., Perugia, Italy, May 9-12, 1994, pp. 1-12.
  3. R. Ito, H. Kuwakado, and H. Tanaka, "Image Size Invariant Visual Cryptography," IEICE Trans. Fundam. Electron., Commun. Comput. Sci., vol. E82-A, Oct. 1999, pp. 2172-2177.
  4. C.-N. Yang, "New Visual Secret Sharing Schemes Using Probabilistic Method," Pattern Recogn. Lett., vol. 25, no. 4, Mar. 2004, pp. 481-494. https://doi.org/10.1016/j.patrec.2003.12.011
  5. S. Cimato, R. de Prisco, and A. de Santis, "Probabilistic Visual Cryptography Schemes," Comput. J., vol. 49, no. 1, Jan. 2006, pp. 97-107. https://doi.org/10.1093/comjnl/bxh152
  6. D. Wang, F. Yi, and X. Li, "Probabilistic Visual Secret Sharing Schemes for Grey-Scale Images and Color Images," Inf. Sci., vol. 181, no. 11, June 2011, pp. 2189-2208. https://doi.org/10.1016/j.ins.2011.01.019
  7. Y.C. Hou et al., "Block-Based Progressive Visual Secret Sharing," Inf. Sci., vol. 233, June 2013, pp. 290-304. https://doi.org/10.1016/j.ins.2013.01.006
  8. E.R. Verheul and H.C.A. van Tilborg, "Constructions and Properties of k out of n Visual Secret Sharing Schemes," Des., Codes Cryptography, vol. 11, no. 2, May 1997, pp. 179-196. https://doi.org/10.1023/A:1008280705142
  9. M. Bose and R. Mukerjee, "Optimal (k, n) Visual Cryptographic Schemes for General k," Des., Codes, Cryptography, vol. 55, no. 1, Apr. 2010, pp. 19-35. https://doi.org/10.1007/s10623-009-9327-6
  10. S.J. Shyu and M.C. Chen, "Optimum Pixel Expansions for Threshold Visual Secret Sharing Schemes," IEEE Trans. Inf. Forensics Security, vol. 6, no. 3, May 2011, pp. 960-969. https://doi.org/10.1109/TIFS.2011.2158096
  11. G. Ateniese et al., "Extended Capabilities for Visual Cryptography," Theoretical Comput. Sci., vol. 250, no. 1-2, Jan. 2001, pp. 143-161. https://doi.org/10.1016/S0304-3975(99)00127-9
  12. F. Liu, C.K. Wu, and X.J. Lin, "Some Extensions on Threshold Visual Cryptography Schemes," Comput. J., vol. 53, no. 1, Jan. 2010, pp. 107-119. https://doi.org/10.1093/comjnl/bxn072

Cited by

  1. Towards cheat-preventing in block-based progressive visual cryptography for general access structures vol.583, pp.None, 2022, https://doi.org/10.1016/j.ins.2021.11.013