The objective of steganography is to hide message securely in cover objects for secret communication.How to design a secure steganographic algorithm is still major challenge in this re-search field.In this letter,deve...The objective of steganography is to hide message securely in cover objects for secret communication.How to design a secure steganographic algorithm is still major challenge in this re-search field.In this letter,developing secure steganography is formulated as solving a constrained IP(Integer Programming) problem,which takes the relative entropy of cover and stego distributions as the objective function.Furthermore,a novel method is introduced based on BPSO(Binary Particle Swarm Optimization) for achieving the optimal solution of this programming problem.Experimental results show that the proposed method can achieve excellent performance on preserving neighboring co-occurrence features for JPEG steganography.展开更多
The security of steganographic system is significant in this research field. The security defined by relative entropy D (P C || PS )is widely cited to measure the security of different steg-anographic systems. However...The security of steganographic system is significant in this research field. The security defined by relative entropy D (P C || PS )is widely cited to measure the security of different steg-anographic systems. However,two examples are presented to show that some limitations exist in Cachin’s definition. Based on the analysis of a basal hypothesis testing problem,a very useful con-clusion can be drawn to define the security of steganographic system. According to the above illation,an amendatory definition is presented based on the probability of the empirical probability distribution. With the help of new definition,the relationship between security and capacity can be interpreted clearly,and truly secure steganographic method could be designed.展开更多
基金Supported by the National Natural Science Foundation of China (No.60572111)
文摘The objective of steganography is to hide message securely in cover objects for secret communication.How to design a secure steganographic algorithm is still major challenge in this re-search field.In this letter,developing secure steganography is formulated as solving a constrained IP(Integer Programming) problem,which takes the relative entropy of cover and stego distributions as the objective function.Furthermore,a novel method is introduced based on BPSO(Binary Particle Swarm Optimization) for achieving the optimal solution of this programming problem.Experimental results show that the proposed method can achieve excellent performance on preserving neighboring co-occurrence features for JPEG steganography.
基金Supported by the National Natural Science Foundation of China (No.60572111)
文摘The security of steganographic system is significant in this research field. The security defined by relative entropy D (P C || PS )is widely cited to measure the security of different steg-anographic systems. However,two examples are presented to show that some limitations exist in Cachin’s definition. Based on the analysis of a basal hypothesis testing problem,a very useful con-clusion can be drawn to define the security of steganographic system. According to the above illation,an amendatory definition is presented based on the probability of the empirical probability distribution. With the help of new definition,the relationship between security and capacity can be interpreted clearly,and truly secure steganographic method could be designed.
