scispace - formally typeset
Search or ask a question
Author

Madiop Diouf

Bio: Madiop Diouf is an academic researcher from Cheikh Anta Diop University. The author has contributed to research in topics: Steganography & Decoding methods. The author has an hindex of 3, co-authored 9 publications receiving 29 citations.

Papers
More filters
Proceedings ArticleDOI
27 Mar 2014
TL;DR: This paper proposes a steganography scheme based on LDPC codes inspired by the adaptive approach to the calculation of the map detectability and evaluated the performance of the method by applying an algorithm for steganalysis.
Abstract: Steganography is the art of secret communication. Since the advent of modern steganography, in the 2000s, many approaches based on the error correcting codes (Hamming, BCH, RS, STC ...) have been proposed to reduce the number of changes of the cover medium while inserting the maximum bits. The works of LDiop and al [1], inspired by those of T. Filler [2] have shown that the LDPC codes are good candidates in minimizing the impact of insertion. This work is a continuation of the use of LDPC codes in steganography. We propose in this paper a steganography scheme based on these codes inspired by the adaptive approach to the calculation of the map detectability. We evaluated the performance of our method by applying an algorithm for steganalysis.

22 citations

Proceedings ArticleDOI
01 Sep 2016
TL;DR: A small length polar, encoded for a MIMO (Multiple-Input Multiple-Output) systems with soft output MMSE-SIC (Minimum Mean Square Error-Successive Cancellation) detection, is applied to improve the coded performance while reducing the complexity.
Abstract: Polar codes are proven capacity-achieving and are shown to have equivalent or even better finite length performance than turbo/LDPC codes under some improved decoding algorithm over the Additive White Gaussian Noise (AWGN) channels. Polar coding is based on the so-called channel polarization phenomenon induced by a transform over the underlying binary-input channel. The channel polarization is found to be universal in many signal processing problems and is applied to the coded modulation schemes. In this paper, a small length polar, encoded for a MIMO (Multiple-Input Multiple-Output) systems with soft output MMSE-SIC (Minimum Mean Square Error-Successive Cancellation) detection, is applied to improve the coded performance while reducing the complexity. In order to prove this theory, we compare the proposed MMSE-SIC BER to Zero Forcing (ZF) and Maximum Likelihood (ML) by using 2*2 MIMO systems into Rayleigh channel with BPSK (Binary Phase-Shift Keying) modulation. Simulation results show that MMSE-SIC complexity is lower than the two others detections. We show that the performance of the proposed approach using polar code (128, 64) at 10−2 BER (Bit Error Rate) is around 3dB i.e. 0,66% compared to the optimal ML, while ZF performance is the worst.

5 citations

Book ChapterDOI
11 Apr 2017
TL;DR: In this paper, the authors proposed a practical adaptive embedding methodology based on Successive Cancellation (SC) polar coding, which defines message bits as frozen bits of the SC decoder and computes path metrics according to embedding costs of pixels of the cover image.
Abstract: In this paper, we propose a practical adaptive embedding methodology based on Successive Cancellation (SC) polar coding. The new proposed SC-based Polar Coding Steganography (SC-PCS) defines message bits as frozen bits of the SC decoder and computes path metrics according to embedding costs of pixels of the cover image. Simulation results demonstrate that SC-PCS minimizes an arbitrary embedding distortion while embedding covert message.

5 citations

Proceedings ArticleDOI
13 Jul 2016
TL;DR: This paper critically analyzed various MIMO channel polarization using polar codes extended to the multiple antenna transmission, and also has covered free polar set and frozen polar set for respectively mapping transmitted information and transmit antenna index.
Abstract: Polar codes are known as the first provable code construction to achieve Shannon capacity for arbitrary symmetric binary input channels. Several schemes to provides both detection/decoding of the transmitted and the transmit antenna index in Multiple-Input Multiple-Output (MIMO) antenna systems were proposed in the literature for polar codes. In this paper we have critically analyzed various MIMO channel polarization using polar codes extended to the multiple antenna transmission, and also have covered free polar set and frozen polar set for respectively mapping transmitted information and transmit antenna index.

3 citations

01 Jan 2017
TL;DR: Simulation results demonstrate that SC-PCS minimizes an arbitrary embedding distortion while embedding covert message.
Abstract: In this paper, we propose a practical adaptive embedding methodology based on Successive Cancellation (SC) polar coding. The new proposed SC-based Polar Coding Steganography (SC-PCS) defines message bits as frozen bits of the SC decoder and computes path metrics according to embedding costs of pixels of the cover image. Simulation results demonstrate that SC-PCS minimizes an arbitrary embedding distortion while embedding covert message.

2 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: The performance assessment for video Steganography and the future popular video steganography including H.265 video stegansography, robust video steGANography and reversible video steaganography are introduced.

81 citations

Proceedings ArticleDOI
15 Apr 2015
TL;DR: A high embedding payload of video steganography algorithm has been proposed based on the BCH coding to improve the security of the algorithm and is compared to both the Least Significant Bit (LSB) and [1] algorithms.
Abstract: Video steganography has become a popular topic due to the significant growth of video data over the Internet. The performance of any steganography algorithm depends on two factors: embedding efficiency and embedding payload. In this paper, a high embedding payload of video steganography algorithm has been proposed based on the BCH coding. To improve the security of the algorithm, a secret message is first encoded by BCH(n, k, t) coding. Then, it is embedded into the discrete wavelet transform (DWT) coefficients of video frames. As the DWT middle and high frequency regions are considered to be less sensitive data, the secret message is embedded only into the middle and high frequency DWT coefficients. The proposed algorithm is tested under two types of videos that contain slow and fast motion objects. The results of the proposed algorithm are compared to both the Least Significant Bit (LSB) and [1] algorithms. The results demonstrate better performance for the proposed algorithm than for the others. The hiding ratio of the proposed algorithm is approximately 28%, which is evaluated as a high embedding payload with a minimal tradeoff of visual quality. The robustness of the proposed algorithm was tested under various attacks. The results were consistent.

56 citations

Journal ArticleDOI
TL;DR: This paper presents a comprehensive study and analysis of numerous cutting edge video steganography methods and their performance evaluations from literature, and suggests current research directions and recommendations to improve on existing video Steganography techniques.
Abstract: In the last two decades, the science of covertly concealing and communicating data has acquired tremendous significance due to the technological advancement in communication and digital content. Steganography is the art of concealing secret data in a particular interactive media transporter, e.g., text, audio, image, and video data in order to build a covert communication between authorized parties. Nowadays, video steganography techniques have become important in many video-sharing and social networking applications such as Livestreaming, YouTube, Twitter, and Facebook because of the noteworthy development of advanced video over the Internet. The performance of any steganographic method ultimately relies on the imperceptibility, hiding capacity, and robustness. In the past decade, many video steganography methods have been proposed; however, the literature lacks of sufficient survey articles that discuss all techniques. This paper presents a comprehensive study and analysis of numerous cutting edge video steganography methods and their performance evaluations from literature. Both compressed and raw video steganography methods are surveyed. In the compressed domain, video steganography techniques are categorized according to the video compression stages as venues for data hiding such as intra frame prediction, inter frame prediction, motion vectors, transformed and quantized coefficients, and entropy coding. On the other hand, raw video steganography methods are classified into spatial and transform domains. This survey suggests current research directions and recommendations to improve on existing video steganography techniques.

51 citations

Proceedings ArticleDOI
29 Apr 2016
TL;DR: To improve the security of the proposed algorithm, a secret message is first encrypted and encoded by using BCH codes, then, it is embedded into the discrete cosine transform (DCT) coefficients of video frames.
Abstract: Due to the significant growth of video data over the Internet, it has become a popular choice for data hiding field. The performance of any steganographic algorithm relies on the embedding efficiency, embedding payload, and robustness against attackers. Low hidden ratio, less security, and low quality of stego videos are the major issues of many existing steganographic methods. In this paper, we propose a DCT-based robust video steganographic method using BCH codes. To improve the security of the proposed algorithm, a secret message is first encrypted and encoded by using BCH codes. Then, it is embedded into the discrete cosine transform (DCT) coefficients of video frames. The hidden message is embedded into DCT coefficients of each Y, U, and V planes excluding DC coefficients. The proposed algorithm is tested under two types of videos that contain slow and fast moving objects. The results of the proposed algorithm are compared with three existing methods. The results demonstrate better performance for the proposed algorithm than for the others. The hidden ratio of the proposed algorithm is approximately 27.53%, which is evaluated as a high hiding capacity with a minimal tradeoff of the visual quality. The robustness of the proposed algorithm was tested under different attacks.

36 citations

Journal ArticleDOI
TL;DR: This work verifies the availability of polar codes for the practical construction of steganography codes and provides a methodology for designing better steganographic codes based on any advance of polar coding/decoding.
Abstract: Steganography is an information hiding technique for covert communication. So far Syndrome-Trellis Codes (STC), a convolutional codes-based method, is the only near-optimal coding method, i.e., it can approach the rate-distortion bound of content-adaptive steganography in practice. However, as a secure communication application, steganography needs the diversity of coding methods. This paper proposes another and a better near-optimal steganographic coding method based on polar codes, using Successive Cancellation List (SCL) decoding algorithm to minimize additive distortion in steganography. Considering a steganographic channel as a binary symmetric channel, the proposed Steganographic Polar Codes (SPC) chooses parity-check matrix by setting embedding payload as the initial value of Arikan’s heuristic and computes decoding channel metric from the optimal modification probability of minimal distortion model. To overcome the inherent defect of polar codes only suiting for code length of a power of 2, we introduce three strategies to generalize SPC for arbitrary length. Experimental results validate the versatility of SPC to minimize arbitrary distortion. When compared with STC, the overall coding performance of SPC is more superior with low embedding complexity. This work verifies the availability of polar codes for the practical construction of steganographic codes and provides a methodology for designing better steganographic codes based on any advance of polar coding/decoding.

34 citations