With the rapid development of the Internet, steganography on Voice over IP (VoIP) has been attracted a lot of research efforts. To date, existing VoIP steganography research commonly focus on information hiding in the LSB bits of Network Audio Streams, yet, we found this approach may raise serious security threat, where the hidden information may be easily removed, detected and attacked. Towards this issue, in this paper, we propose AVIS, a novel Adaptive VoIP steganography approach to hide information within Network Audio Streams. AVIS consists of two parts, named VAMI and VADDI. VAMI works by dynamically select multiple bits based on the VoIP vector value, while VADDI dynamically changes embedding intervals to avoid detection and attacking. We also implemented AVIS and conducted extensive experiments in real systems. Experimental results demonstrate the effectiveness of our proposed AVIS scheme.

Adaptive VoIP Steganography for Information Hiding within Network Audio Streams

Nowadays, enterprises and individuals are increasing tending to store their data in the cloud storage systems, yet, these sensitive data will face serious security threats Currently, cloud storage service providers mainly adopt encryption and authentication to protect sensitive data, and a lot of approaches have been proposed to ensure data security in cloud storage systems Recently, audio steganography has been regarded as serious attacking measures to threaten cloud storage systems Nevertheless, little research has been focused on thwarting the Audio steganography Attacks in Cloud Storage Systems In this paper, we analyze the Audiosteganography Attacks in Cloud Storage Systems, and then, we propose and develop StegAD, a novel scheme for defending Audiosteganography Attacks StegAD includes two algorithms, ie, the enhanced-RS algorithm and the SADI algorithm The enhanced-RS algorithm is adopted to detect the audio steganographied files, and after that, SADI is applied to infer and compensate the possible hiding positions To evaluate the performance of StegAD, we perform extensive evaluations on a real platform in terms of detecting, audio quality and interfering intensity Experimental results show that, our proposed StegAD scheme is very efficient in thwarting the Audio steganography Attacks in Cloud Storage Systems

Thwarting audio steganography attacks in cloud storage systems

The improved bit-plane complexity segmentation (BPCS) steganography carries on different processings to different bit-planes, with setting high threshold value at the high bit-plane and low threshold value at the low. Not only provides good visual imperceptibility and data embedding capacity, this scheme also is capable of resisting the analysis of the whole complexity histogram. However, it still exists safe loophole. Experimental results show that, the partial statistical analysis the paper mentioned can analysis the existence of secret information; furthermore, it can estimate the embedding threshold value accurately.

Statistical analysis against improved BPCS steganography

In the open distributed environment, the knowledge of belief is absent for the entity with which we will contact, so the recommendation trust is very important for the distributed system. In this paper a recommendation trust model is proposed based on encouragement and punishment. In the model, the trust value of any entity consists of trading reputation value and recommendation reputation value, the recommendation factor is affected by multi parameters and can adjust dynamically with the recommend result. When the recommender supports the real information then the value of the recommendation trust will increase otherwise decrease the value.

Study on the Recommendation Trust Model Based on Encouragement and Punishment

Combining the identification characteristics of zero-knowledge proof and blind watermark, an identity verification protocol is proposed. In this protocol, the public key encryption is used to encrypt the watermark and the watermarked data of the watermark embedding locations, and the verification of user's identity watermarking is achieved through estimating the relativity of them. Furthermore, a way which restricts the prover and verifier’s communication to a closed situation is put forward, and this way can resist such as brute force cheat-attack.

A Zero-Knowledge Identity Verification Protocol Using Blind Watermark

This paper proposes RSA-based zero-knowledge proof watermark verification protocolsIt can tackle the problem of disclosing sensitive informationIn the protocols,the public key encryption are used to encrypt the watermark and the watermarked data of the watermark embedding locations,the open verification of copyright watermarking is achieved through estimating the relativity of themFurthermore,the authors research how to resist cheat-attack,and propose the way that prover and verifier can only communicate with each other to resist this attack

Zero-knowledge proof watermark verification protocols based on RSA

Most tools are based on Least Significant Bit(LSB),which makes the steganography on LSB a wide significance.Based on steganography ideas of bit planes and neighbor pixels correlation in image,with some inherent features of 16 bit coded wav audio and statistical changes by audio LSB,a conclusion of the statistical result in algorithm increasing is made by the neighbor vectors value and odd-even discussion.Theory and experimental results with a setting threshold value prove it is feasibility.

Statistics Detection Algorithm Based on Audio LSB Steganography

This paper discussed the definition and basic properties of trust,researched on the propagation and combination of recommendation trust,and also described the formation process of the recommendation trust net based on the algorithm in detail.Furthermore,provided a recommendation trust model,which was an important meaning for preventing malicious recommendation and building trust mechanism in distributed system.

Study on recommendation trust in open network environment

Statistical analysis based on complexity histogram discontinuities measure is a powerful steganalytic technique for detecting the presence of secret message embedded in the digital images using Bit-Plane Complexity Segmentation(BPCS). Therefore, to improve steganographic security, this paper proposes an improved BPCS algorithm that can effectively resist statistical analysis. Part of blocks are used that can embed hiding information as complexity adjustable blocks to remove two clearly discontinuities which are caused by customary BPCS algorithm, and make sure the discontinuities measure disappear obviously peak value. Experimental results show that the improved algorithm can effectively resist statistical analysis based on the complexity histogram, and can maintain the big capacity characteristic of the originally algorithm.

Tang Guang-ming

Papers

Zero-knowledge proof watermark verification protocols based on RSA

Statistics Detection Algorithm Based on Audio LSB Steganography

Study on recommendation trust in open network environment

Improved Bit-Plane Complexity Segmentation Algorithm