Open AccessHigh capacity reversible data hiding in MP3 based on Huffman table transformation
Author(s) -
Ding Wei Tan,
Li Yu,
Xue Hu Yan,
Lin Tao Liu,
Long Long Li
Publication year - 2019
Publication title -
mathematical biosciences and engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.451
H-Index - 45
eISSN - 1551-0018
pISSN - 1547-1063
DOI - 10.3934/mbe.2019158
Subject(s) - huffman coding , computer science , steganography , table (database) , transformation (genetics) , canonical huffman code , information hiding , steganography tools , encoding (memory) , decoding methods , theoretical computer science , cover (algebra) , distortion (music) , speech recognition , encryption , data mining , algorithm , embedding , data compression , artificial intelligence , computer security , telecommunications , code rate , engineering , amplifier , chemistry , bandwidth (computing) , biochemistry , mechanical engineering , systematic code , gene
In practice, most audio files such as MP3 and AAC are stored and transmitted in the form of compressed files, which can serve as the cover in audio steganography. Currently, the prevailing audio steganography methods are not ideal because of the drawbacks. Some are characterized by low capacity while others are irreversible. In this paper, we propose a method to embed secret messages in MP3 encoding. Our strategy is to hide the information by Huffman table transformation. We extract secret information by analyzing side information. Experimental results show that our method can greatly improve the steganographic capacity with low distortion and high security. Meanwhile, it featured with higher decoding rate and reversible over some state-of-the-art methods.