An Efficient VoIP Steganography Based on Random Binary Matrix

Abstract

To reduce the distortion while maintaining relatively large embedding capacity, a steganographic scheme based on random binary matrix is presented in this paper. We first design a 3×4 covering code, which can hide 3 bits of secret messages into 4 bits of cover messages with not more than 2-bit changed. Further, we construct a random binary matrix with cover bits at diagonal lines for steganography, and conceal secret messages into each four cover bits encrypted with the other binary bits of their rows or columns using the above 3×4 covering code. The proposed scheme is evaluated with a large number of G.711 encode speech samples. The experimental results show that our scheme can provide good performance on both steganographic transparency and embedding capacity.