JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOM ›› 2018, Vol. 25 ›› Issue (2): 60-76.doi: 10. 19682/ j. cnki. 1005-8885. 2018. 1007

• Security • Previous Articles     Next Articles

(k, n) halftone visual cryptography based on Shamir‘s secret sharing

Ding Haiyang, Li Zichen, Bi Wei   

  1. 1. College of Information Engineering, Beijing Institute of Graphic Communication, Beijing 102600, China;
    2. Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, China
    3. Seele Tech Corporation, San Francisco 94107, USA; 4. Zsbatech Corporation, Beijing 100088, China
  • Received:2017-12-07 Revised:2018-05-18 Online:2018-04-30 Published:2018-07-02
  • Contact: Ding Haiyang, E-mail: 13810284215@163. com
  • About author:Ding Haiyang, E-mail: 13810284215@163. com
  • Supported by:
    This work was supported by the National Natural Science Foundation of China ( 61370188 ), the Scientific Research Common Program of Beijing Municipal Commission of Education ( KM201610015002, KM201510015009 ), the Beijing City Board of Education Science and Technology Key Project ( KZ201510015015, KZ201710015010 ), Project of Beijing Municipal College Improvement Plan ( PXM2017 _ 014223 _ 000063), BIGC Project (Ec201802, Ed201803, Ea201806).

Abstract: (k, n) halftone visual cryptography (HVC) is proposed based on Shamir‘s secret sharing (HVCSSS), and through this method a binary secret image can be hided into n halftone images, and the secret image can be revealed from any k halftone images. Firstly, using Shamir‘s secret sharing, a binary secret image can be shared into n meaningless shares; secondly, hiding n shares into n halftone images through self-hiding method; and then n extracted shares can be obtained from n halftone images through self-decrypt method; finally, picking any k shares from n extracted shares, the secret image can be revealed by using Lagrange interpolation. The main contribution is that applying Shamir‘s secret sharing to realize a (k, n) HVC, and this method neither requires code book nor suffers from pixel expansion. Experimental results show HVCSSS can realize a (k, n) HVC in gray-scale and color halftone images, and correct decoding rate (CDR) of revealed secret image can be guaranteed.

Key words: Shamir‘s secret sharing, (k, n) VC, self-hiding, self-decrypt, Lagrange interpolation

CLC Number: