A Speech Content Authentication Algorithm Based on Pseudo-Zernike Moments in DCT Domain

A Speech Content Authentication Algorithm Based on Pseudo-Zernike Moments in DCT Domain

Zhenghui Liu (School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China) and Hongxia Wang (School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China)
Copyright: © 2013 |Pages: 20
DOI: 10.4018/jdcf.2013070102
OnDemand PDF Download:
No Current Special Offers


A speech content authentication algorithm based on pseudo-Zernike moments in DCT domain is proposed in this paper, which is aimed at some shortcomings in some existing digital watermark schemes. The definition of coefficients self-correlation degree is given. Then the frequency domain watermark embedding method based on pseudo-Zernike moments in DCT domain is proposed. Watermark bits are generated by coefficients self-correlation degree and embedded by quantizing the pseudo-Zernike moments of DCT domain low-frequency coefficients. Comparing with the existing audio watermark algorithms based on pseudo-Zernike moments, the algorithm increases the watermarking embedding capacity and improves the efficiency greatly. Theoretical analysis and experimental evaluation results show that the proposed speech content authentication algorithm is effective.
Article Preview


Digital audio watermarking technique, which is a technical method to protect the digital audio signals, has been paid more attention and achieved an outstanding progress in recent years. Digital audio watermarking schemes can be divided into two types according to the purpose of application. The first kind is robustness audio watermark scheme used for protecting audio copyright (Xiang, et al., 2006; Yamamoto & Iwakini, 2009; Salma, et al., 2010; Vivekananda, et al., 2011; Wang, Healy, et al., 2011; & Wang, Ma, et al., 2011). The second kind is used for authenticating the veracity and integrity of audio content (Wang & Fan, 2010; Chen & Zhu, 2008; Jiang, 2010).

Currently, for robustness audio watermark schemes and audio content authentication schemes, there are a lot of research results. For speech signals, there are a lot of research results in the speaker recognition and identification (Khan, et al., 2010; Herbig, et al., 2012; Sahidullah & Saha, 2012; Navarathna, et al., 2013). However, the speech content authentication schemes are rarely (Park et al., 2007). It’s known that speech signals are different to audio signals in some ways (such as sampling rate). Generally, some audio content authentication schemes cann’t be used for speech content authentication directly. Comparing with audio signals, speech signals are more likely to cause attacker’s interest and be attacked. If the attacked signals are not detected, the authentication client will consider the attacked signals are veracity, which will cause serious consequences. So, the research of speech content authentication is more realistic meaning and practical value.

Considering the security requirements of watermark system and the purpose of practical application of speech (audio) content authentication, there are some shortcomings for some existing watermark schemes:

1. For some watermark algorithms, watermark bits are embedded in public and fixed frequency points, which bring that attackers can tamper watermark in frequency domain easily. For example, the watermark embedded based on discrete Fourier transform, for the frequency points of discrete Fourier transform are public and fixed, it is vulnerable to malicious attacks and insecure in the practical application process. The detailed discussion of this is described in (Xie et al., 2006).

2. For the scheme proposed in Chen et al., (2007), the features used to generate watermark bits are extracted during compression. For speech signals uncompressed or compressed based on other speech codecs (not based on codebook-excite linear prediction), the scheme is powerless. And watermark bits are embedded in the least significant bits (LSBs), which is very fragile to common signal processing operations. So, for the common signal processing operation, the scheme will regard it as hostile attack. In practical application, for the convenience of storage, the format of special requirements and many other reasons, speech signal will inevitably be subjected to a certain degree of common signal processing operations. In this situation, the schemes (Chen et al., 2007; Chen et al., 2010) are unsuitable.

3. For the content-based audio content authentication algorithm (Wang & Fan, 2010), on the one hand, the features used to generate watermark are public, and attackers can get the features easily. On the other hand, the watermark embedding and extraction methods are known to attackers. It is possible for attackers to extract the watermark embedded. Then, for one watermarked audio frame, attackers search to find another audio content having the same features and watermark extracted and to substitute the frame, which will not be detected at the certified authority. We call this attack as feature-analysed substitution attack.

Complete Article List

Search this Journal:
Volume 14: 1 Issue (2022): Forthcoming, Available for Pre-Order
Volume 13: 6 Issues (2021): 3 Released, 3 Forthcoming
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing