一种抗剪切信息隐藏算法  

An Information Hiding Algorithm Against the Cropping Attack

作　　者：雷芸[1,2] 孙泽锐 王晓云[4] 俞春强[3,2] 张显全[3,2] 

机构地区：[1]广西民族大学预科教育学院,广西南宁530006 [2]桂林电子科技大学广西信息科学实验中心,广西桂林541004 [3]广西师范大学计算机科学系,广西桂林541004 [4]长江师范学院数学与计算机学院,重庆涪陵408100

出　　处：《微电子学与计算机》2014年第2期132-136,共5页Microelectronics & Computer

基　　金：国家自然基金(61363034,61300109);广西自然科学基金(2011GXNSFD018026,2012GXNSFBA053166,0832104);广西科学研究与技术开发计划项目(10123005-8);重庆市教委科技项目(KJ121310);涪陵区科技计划项目(FLKJ,2012ABA1056);广西信息科学实验中心项目(20130204)

摘　　要：提出了一种基于拉丁方阵的抗剪切信息隐藏算法,通过载体图像隐藏容量和秘密信息的大小确定隐藏秘密信息的备份数,根据备份数确定隐藏信息的拉丁方阵模板,对秘密信息进行分组和编号,通过拉丁方阵模板按对应的编号,将秘密信息嵌入到载体图像中,实现信息隐藏.实验结果表明该算法能够实现大容量隐藏并且能够抵抗大面积的剪切攻击,具有较好的应用价值.This paper proposes an anti--cropping steganography scheme based on Latin square. At first, the amount of secret copies is obtained by the cover image＇s hiding capacity and the length of the secret message. According to the amount of copies, a Latin square is confirmed as the template for hiding secret message. The secret message is divided into groups and each group is numbered. Then the secret groups are embedded into the cover image with the corresponding element in the Latin square. Experimental results indicate that the proposed scheme can achieve high capacity, and can be against the cropping attack. It has significant practical value for information security.

关 键 词：信息隐藏 拉丁方阵 抗剪切 最低有效位 

分 类 号：TN402[电子电信—微电子学与固体电子学]