DocumentCode :
117855
Title :
Progressive audio scrambling via complete binary tree´s traversal and wavelet transform
Author :
Twe Ta Oo ; Onoye, Takao
Author_Institution :
Dept. of Inf. Syst. Eng., Osaka Univ., Suita, Japan
fYear :
2014
fDate :
9-12 Dec. 2014
Firstpage :
1
Lastpage :
7
Abstract :
In this paper, we firstly propose an effective audio scrambling method based on the pre-order traversal of a complete binary tree in time domain. The proposed method is fast, simple and has good scrambling effect. Then, with the aim of strengthening the anti-decryption capability, we present a wavelet-domain based scheme by considering not only the pre-order but also the in-/post-order based scrambling methods. First, an audio signal is wavelet-decomposed and retrieves the layers of wavelet coefficients. Then, the coefficients in each layer are scrambled by randomly chosen one out of the three methods. Anyone without knowledge of the correct wavelet decomposition parameters and the scrambling method used for each layer will never be able to descramble the signal successfully. Moreover, the new scheme also achieves progressive scrambling that enables to generate the audio outputs with different quality levels by controlling the scrambling degree as required.
Keywords :
audio signal processing; trees (mathematics); wavelet transforms; anti-decryption capability; complete binary tree traversal; correct wavelet decomposition parameters; progressive audio scrambling method; wavelet coefficients; wavelet transform; Abstracts; Binary trees; Decision support systems; Discrete wavelet transforms; Security; Time-domain analysis; Wavelet coefficients;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Asia-Pacific Signal and Information Processing Association, 2014 Annual Summit and Conference (APSIPA)
Conference_Location :
Siem Reap
Type :
conf
DOI :
10.1109/APSIPA.2014.7041525
Filename :
7041525
Link To Document :
بازگشت