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

作　　者：Ding Haiyang Li Zichen Bi Wei 

机构地区：[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

出　　处：《The Journal of China Universities of Posts and Telecommunications》2018年第2期60-76,共17页中国邮电高校学报（英文版）

基　　金：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)

摘　　要：（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.（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.

关 键 词：Shamir＇ s secret sharing （k n） VC self-hiding self-deerypt Lagrange interpolation 

分 类 号：TN918.1[电子电信—通信与信息系统]