Steganography is an ancient art that encompasses various techniques of information hiding, the aim of which is to secret information into a carrier message. Steganographic methods are usually aimed at hiding the very existence of the communication. Due to the rise in popularity of IP telephony, together with the large volume of data and variety of protocols involved, it is currently attracting the attention of the research community as a perfect carrier for steganographic purposes. This paper is a survey of the existing VoIP steganography (steganophony) methods and their countermeasures.

VoIP Steganography and Its Detection - A Survey

This paper proposes an improved semi-fragile speech watermarking scheme by quantization of linear prediction (LP) parameters, ie, the inverse sine (IS) parameters The spectral distortion due to watermark embedding is controlled to meet the `transparency' criterion in speech coding A modified bit allocation algorithm combined with watermarking is developed to determine the quantization step so that the `transparency' requirement is satisfied Due to the statistical nature, the LP coefficients estimated from the watermarked speech signal are different from the watermarked LP coefficients even in the absence of attacks This effect is the cause of increase in decoding error and minimum authentication length To tackle this problem, an Analysis by Synthesis (AbS) scheme is developed to reduce the difference between the estimated LP coefficients and the watermarked ones The watermark detection threshold and minimum authentication length are then derived according to the probability of error and the signal to noise ratio (SNR) requirements Experimental results show that the proposed AbS based method can effectively reduce the difference between the watermarked IS parameter and the extracted IS parameter when there is no attacks In addition, the modified bit allocation algorithm can automatically find the appropriate quantization step used in the odd-even modulation so that the transparency requirement is satisfied

Speech authentication by semi-fragile speech watermarking utilizing analysis by synthesis and spectral distortion optimization

In this study, the authors present a new steganographic technique called random least significant bits of pitch and Fourier magnitude steganography (RLPFS). It is based on hiding a secret speech coded by mixed excitation linear prediction (MELP) speech coder in speech bitstream (cover signal), which is also encoded by MELP coder. First, the RLPFS leaks the hidden speech in the following modes: pitch-based steganography, Fourier magnitude-based steganography or both. These modes are selected randomly. Second, during transmission, the stego speech, the mode number, and the number of embedded bits would be transmitted either through a covert channel created in the transmission protocol or through the cover speech. In this work, the authors have dealt with the challenge of embedding a secret speech into a cover speech coded by a very low bit rate speech coder while maintaining a reasonable level of speech quality. They have shown that RLPFS was able to create hidden channels with maximum steganographic bandwidths up to 266.64 bit/s at the cost of a steganographic noise between 0.031 and 0.62 mean opinion score. Also, this study takes into account the security of the parameters, the synchronisation of the receiver to deal with a packet loss during transmission and the resistance of the proposed method against steganalysis.

https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/iet-spr.2018.5339

Pitch and Fourier magnitude based steganography for hiding 2.4 kbps MELP bitstream

In order to protect the data security and privacy of Voice over Internet Protocol (VoIP), a new algorithm for speech information hiding is proposed based on complete binary tree dynamic codebook grouping (CBTDCG). The algorithm uses the quantization index modulation (QIM) method to divide the dynamic codebook into two parts (corresponding to the embedded secret information bits `0' and `1' respectively), and adopts the complete binary tree to achieve the optimal grouping. The utility of complete binary tree makes the algorithm have the characteristics of fast search and high accuracy. The sender selects the corresponding code word according to the secret information bits for embedding the secret information into carrier speech. At the receiving end, the secret information bits are extracted according to the features of the code word vectors by the receiver. The experimental results show that the hidden capacity of the algorithm is larger than 450bps and the loss of the PESQ is less than 4%. Verification shows that the algorithm possesses a good robustness with a low bit error rate after being interfered by noise and the speech stream carrying secret information has better imperceptibility.

/pdf/speech-information-hiding-algorithm-based-on-complete-binary-4nju2kgpvz.pdf

Speech Information Hiding Algorithm Based on Complete Binary Tree Dynamic Codebook Grouping

Streaming technologies such as VoIP are widely embedded into commercial and industrial applications, so it is imperative to address data security issues before the problems get really serious. This thesis describes a theoretical and experimental investigation of secure covert communications over streaming media using dynamic steganography. A covert VoIP communications system was developed in C++ to enable the implementation of the work being carried out.
A new information theoretical model of secure covert communications over streaming media was constructed to depict the security scenarios in streaming media-based steganographic systems with passive attacks. The model involves a stochastic process that models an information source for covert VoIP communications and the theory of hypothesis testing that analyses the adversary‘s detection performance.
The potential of hardware-based true random key generation and chaotic interval selection for innovative applications in covert VoIP communications was explored. Using the read time stamp counter of CPU as an entropy source was designed to generate true random numbers as secret keys for streaming media steganography. A novel interval selection algorithm was devised to choose randomly data embedding locations in VoIP streams using random sequences generated from achaotic process.
A dynamic key updating and transmission based steganographic algorithm that includes a one-way cryptographical accumulator integrated into dynamic key exchange for covert VoIP communications, was devised to provide secure key exchange for covert communications over streaming media. The discrete logarithm problem in mathematics and steganalysis using t-test revealed the algorithm has the advantage of being the most solid method of key distribution over a public channel.
The effectiveness of the new steganographic algorithm for covert communications over streaming media was examined by means of security analysis, steganalysis using non parameter Mann-Whitney-Wilcoxon statistical testing, and performance and robustness measurements. The algorithm achieved the average data embedding rate of 800 bps, comparable to other related algorithms. The results indicated that the algorithm has no or little impact on real-time VoIP communications in terms of speech quality (< 5% change in PESQ with hidden data), signal distortion (6% change in SNR after steganography) and imperceptibility, and it is more secure and effective in addressing the security problems than other related algorithms.

Secure covert communications over streaming media using dynamic steganography

This paper presents an approach for speech information hiding based on G.721 scheme. This approach proposes an Analysis-By-Synthesis (ABS)- based speech information hiding and extracting algorithm, is called ABS algorithm, which form the theoretical basis for designing a secure speech communication system. The ABS algorithm adopts a speech synthesizer in a speech coder. Speech embedding and coding are synchronous, i.e. fusing of secret speech information data into speech coding. Dynamic secret speech information data bits can be embedded into original carrier speech data, with high efficiency in steganography and good quality in output speech. This method is superior to available classical algorithms on hiding capacity and robustness. This paper implements the proposed approach based on speech coding scheme G.721 and the experiments show that this approach meets the requirements of information hiding, satisfies the constraints of speech quality for secure communication, and achieves high hiding capacity of 1.6Kbps with an excellent speech quality and complicating speakers' recognition.

Approach to hide secret speech information in G.721 scheme

This paper presents an speech information hiding model for transmitting secret speech through subliminal channel covertly for secure communication over PSTN (Public Switched Telephone Network) or VoIP (Voice over Internet Protocol). This model's main statement is that the embedding operation of a secure communication system should work indeterminate from the attacker's point of view. This model for secure communication based on the technique of information hiding has more severe requirements on the performances of data embedding than watermarking and fingerprinting in the aspects of real time, hiding capacity, and speech quality. Experiments show that this model meets the requirement of secure communication and suits for practical application of covert communication. The security analysis of this model by means of information theory and actual test proved that it is theoretically and practically secure. This information theory based model can be commonly used to help design a system of speech secure communication with different coding schemes.

An information-hiding model for secure communication

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Lan Ma

Author Tools

Chat about Author

Papers

Approach to hide secret speech information in G.721 scheme

An information-hiding model for secure communication