Stéphane Gaël Raymond Ekodeck

Stéphane Gaël Raymond Ekodeck

Auto-generated profile, based on publicly available information

Stéphane Gaël Raymond Ekodeck

University of Yaoundé I

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 May 2023 in Iran Journal of Computer Science
Verified
Journal Article
Closed access
PDF file
JSJuvet Karnel Sadié
Juvet Karnel Sadié
SEStéphane Gael R. Ekodeck
Stéphane Gael R. Ekodeck
RNRené Ndoundam
René Ndoundam

5 July 2023 in Research Square
Verified
Preprint
Open access
PDF file
DFDamaris B. M. Fotso
Damaris B. M. Fotso
SESerge A. Ebele
Serge A. Ebele
SEStéphane G. R. Ekodeck
Stéphane G. R. Ekodeck
RNRené Ndoundam
René Ndoundam
Rather than directly embed the secret message in pixels of an image, the new concept of coverless image steganography hides a message in a cover image without modifying it, which significantly increases the resilience to image steganalysis tools. Existing high capacity coverless image steganography methods do not provide an efficient algorithm for rapidly generating the large number of possible hash sequences. Moreover, the sending of additional information generated during the hiding process and essential for extraction is not explicitly defined. In this paper, we propose WYSAWIS, a high capacity coverless image steganography approach. Given an image initially subdivided into blocks of size 4*4, we generate from each block an initial 15-bit hash sequence, then a set of all the combinations of this sequence. The latter constitutes the set of hash sequences of that block.To send a secret message, it is first subdivided into 15-bit segments,and each segment is mapped to a hash sequence of a block, whose position in the block determines the position of the message segment. All these positions called location information are sent using a distributed data hiding technique in a single cloud. Compared to what has been done in the literature before, our hashing algorithm makes it possible to use a single cover image to send a secret message of any size. This definitely overcomes the limits of building a large image data set and sending in order a large number of stego images. Moreover, the popularization of cloud services makes the transfer of location information innocuous and practical

17 September 2025 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
DFDamaris Fotso
Damaris Fotso
SESerge Alain Ebele
Serge Alain Ebele
SEStéphane Gael R. Ekodeck
Stéphane Gael R. Ekodeck
RNRené Ndoundam
René Ndoundam

10 February 2026 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
STStéphane Willy Mossebo Tcheunteu
Stéphane Willy Mossebo Tcheunteu
LMLeonel Moyou Metcheka
Leonel Moyou Metcheka
HKHervé Talé Kalachi
Hervé Talé Kalachi
SEStéphane Gaël Raymond Ekodeck
Stéphane Gaël Raymond Ekodeck
RNRené Ndoundam
René Ndoundam
ATAlain Tchana
Alain Tchana
The exponential growth of cloud storage adoption has introduced new attack surfaces and privacy concerns, necessitating advanced methods for secure and covert communication. Traditional steganographic techniques, particularly in distributed settings, often struggle with balancing undetectability, embedding capacity, and security. Recent indirect methods that avoid file modification have improved undetectability but remain constrained by low capacity and reliance on cryptographic secrecy alone. This paper introduces Contextual Cloud Steganography (CCS), a novel framework that replaces traditional base-based encoding with contextual protocols based on deterministic file ordering within cloud directories. CCS leverages pre-established sorting criteria (e.g., cryptographic hashes, creation dates) to embed secret data by selecting files from sorted lists, achieving a multiplicative increase in capacity of 3.2× to 4.3× over state-of-the-art base-B methods. The framework simultaneously enhances security through protocol-dependent protection, making message extraction computationally infeasible without the precise contextual protocol, even if the stego-folder is discovered. We provide formal security proofs under established steganographic models, detailed algorithms with cryptographic enhancements, and extensive experimental evaluation across major cloud platforms (Google Drive, Dropbox, OneDrive) over a 30-day period. Results demonstrate CCS's practical efficiency and robustness in dynamic environments, establishing it as a significant advancement in cloud-based covert communication that breaks the traditional capacity-security trade-off.

12 January 2026 in Journal of Computer Security
Verified
Journal Article
Closed access
STStéphane Willy Mossebo Tcheunteu
Stéphane Willy Mossebo Tcheunteu
HKHervé Talé Kalachi
Hervé Talé Kalachi
SEStéphane Gael Raymond Ekodeck
Stéphane Gael Raymond Ekodeck
LMLeonel Moyou Metcheka
Leonel Moyou Metcheka
JMJean Marsien Ayemidie Moto
Jean Marsien Ayemidie Moto
RNRené Ndoundam
René Ndoundam
The texts "only boats catch connotes ..." and "in the research area of text steganography ...." were not coloured in section 6 (Experimental Evaluation) as in the original manuscript.This article introduces a paradigm-shifting approach to text steganography that fundamentally redefines the capacity limits of covert communication through the synergistic integration of combinatorial color optimization and Huffman compression. By exploiting the combinatorial richness of the 24-bit RGB color space enhanced with lossless compression, we present a framework that achieves unprecedented embedding capabilities—reaching up to 400% effective capacity, representing a 17.9 × improvement over state-of-the-art permutation-based method (Sadie et al., 2023) for n = 10 colors. Our methodology combines optimal color subset selection from 16.7 million possibilities with hybrid combinatorial–permutational encoding and Huffman compression, creating exponential growth in steganographic potential while maintaining format compatibility with standard communication channels. Theoretical analysis confirms O ( ( 2 24 ) k n ) complexity scaling with only 12% compression overhead, while experimental validation demonstrates practical implementation achieving 350 to 400% capacity with only 5 to 8% cover text modification. The compression-enhanced scheme establishes new benchmarks for high-capacity steganography, offering robust security against statistical detection through dynamic palette selection, adaptive encoding strategies, and compression-induced entropy redistribution. This work represents a significant advancement in digital covert communication, providing a scalable, efficient solution for modern security requirements while enhancing both capacity and undetectability beyond existing text-based steganographic systems.

3 September 2026 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
SEStéphane Gaël R. Ekodeck
Stéphane Gaël R. Ekodeck
PKPatrick Dany Bavoua Kenfack
Patrick Dany Bavoua Kenfack
SESerge Alain Ebélé
Serge Alain Ebélé
GEGuy Landry Youmbi Essouma
Guy Landry Youmbi Essouma
CMChantal Marguerite Mveh‐Abia
Chantal Marguerite Mveh‐Abia