Static Parsing Steganography

Farhat, Hikmat; Challita, Khalil; Zalaket, Joseph

doi:10.1007/978-3-642-21984-9_41

Cited by 1 publication

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The following section discusses the CPF probability analysis and CPF time complexity analysis. The experiments were carried out on the proposed method and three other existing methods which are SPS [10], MCO [11], and CPPM [14] as discussed in the previous section.…”

Section: Resultsmentioning

confidence: 99%

“…Bits "0" positions in image: 3, 4,6,7,8,9,10,14 . Bits "0" positions in secret message: 4,5,6,8,10,12,13,15,16,17,19,21,24,26,27,31,33,36,38,40 . b) Each position of the bits "1" in image and secret message are stored.…”

Section: B Methods Architecturementioning

confidence: 99%

“…Static Parsing Steganography (SPS) [10] is based on parsing the image instead of modifying it. Divide-and-conquer strategy is the fundamental of SPS that finds the longest common substring from the message and image files.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Secure Information Hiding Based on Random Similar Bit Mapping

Zakaria¹,

Abdullah²

2020

IJMLC

View full text Add to dashboard Cite

The goal of cryptography is to maintain the secrecy of information while steganography aims to hide the information. A hybrid steganography and cryptography method was introduced to increase the security of data transmission. Random Similar Bit Mapping (RSBM) was proposed to hide a secret message without modifying the image and generates a Position File (PF) which stores the positions of a hidden message. PF is encrypted using Advanced Encryption Standard (AES) algorithm before being sent to the receiver. Two security measures were proposed to estimate the message location in PF based on Correct Position Finding (CPF) for message detection against a brute force attack. This paper compared related works using the proposed security measures to evaluate its security. From the CPF probability analysis, RSBM produced the lowest CPF probability results, while recording the highest CPF time complexity results in CPF time complexity analysis. In conclusion, RSBM ensured high data security which can be implemented in any information hiding application.

show abstract

Section: Resultsmentioning

confidence: 99%