Mechanism and Implementation of Watermarked Sample Scanning Method for Speech Data Tampering Detection

Mechanism and Implementation of Watermarked Sample Scanning Method for Speech Data Tampering Detection
复制标题

DOI:
10.1145/3267357.3267371
复制
发表时间:
2018-01
期刊:
Proceedings of the 2nd International Workshop on Multimedia Privacy and Security
影响因子:
--
通讯作者:
Xuping Huang
Xuping Huang
中科院分区:
其他
文献类型:
--
作者:
Xuping Huang

文献摘要

被引文献

相似文献

语音数据的完整性和可靠性一直是证据使用的重要问题。除了数字签名之外,数字水印技术为保证多个数据的真实性提供了另一种解决方案。本文提出了一种新的基于可逆压缩算法的数字水印算法,该算法利用样本扫描在时间域检测篡改。为了准确检测篡改,将数字语音数据分成固定长度的帧,计算每一帧的基于内容的哈希信息并嵌入到语音数据中进行验证。采用霍夫曼压缩算法对经过脉冲编码调制处理后的每个样本中从最低有效位开始的每四个采样位进行压缩,以实现低失真和高容量的有效载荷隐藏。对音频质量、检测精度和对攻击的鲁棒性进行了实验,结果表明,对于10个S的语音片段,篡改检测的精度约为0.032 S。在信噪比方面,基于霍夫曼的方法和基于INT离散余弦变换的方法的平均失真分别为22.068和24.139分贝,而基于霍夫曼和INT的方法的平均MOS分别为3.478和4.378。隐写数据和被攻击的隐写数据在时间域和频域的误码率(BER)平均约为28.6%,表明了该隐藏方法的鲁棒性。
The integrity and reliability of speech data have been important issues to probative use. Watermarking technologies supplies an alternative solution to guarantee the the authenticity of multiple data besides digital signature. This work proposes a novel digital watermarking based on a reversible compression algorithm with sample scanning to detect tampering in time domain. In order to detect tampering precisely, the digital speech data is divided into length-fixed frames and the content-based hash information of each frame is calculated and embedded into the speech data for verification. Huffman compression algorithm is applied to each four sampling bits from least significant bit in each sample after pulse-code modulation processing to achieve low distortion and high capacity for hiding payload. Experimental experiments on audio quality, detection precision and robustness towards attacks are taken, and the results show the effectiveness of tampering detection with a precision with an error around 0.032 s for a 10 s speech clip. Distortion is imperceptible with an average 22.068 dB for Huffman-based and 24.139 dB for intDCT-based method in terms of signal-to-noise, and with an average MOS 3.478 for Huffman-based and 4.378 for intDCT-based method. The bit error rate (BER) between stego data and attacked stego data in both of time-domain and frequency domain is approximate 28.6% in average, which indicates the robustness of the proposed hiding method.