Proceedings of the 2nd International Conference on Compute and Data Analysis 2018
DOI: 10.1145/3193077.3193087
|View full text |Cite
|
Sign up to set email alerts
|

A Non-Algorithmic Forensic Approach for Hiding Data in Image Files

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…DOI) related to the developed research. Examples of data sets with unique ID are GovDocs 3 (Sabir et al, 2018), a publicly available data set of government documents with 986,278 files, and Enron 4 (Iqbal et al, 2008), an e-mail data set that contains 200,399 real-life e-mails from 158 employees of the Enron corporation.…”
Section: Dissemination Conceptmentioning
confidence: 99%
“…DOI) related to the developed research. Examples of data sets with unique ID are GovDocs 3 (Sabir et al, 2018), a publicly available data set of government documents with 986,278 files, and Enron 4 (Iqbal et al, 2008), an e-mail data set that contains 200,399 real-life e-mails from 158 employees of the Enron corporation.…”
Section: Dissemination Conceptmentioning
confidence: 99%
“…1. Data hiding: Data hiding techniques are designed to place digital content beyond the discovery of an individual (unlike obfuscation where content may be present but nonintelligible) (Sabir et al, 2018). Data hiding may arguably be the weakest of the antiforensic techniques available to a potential offender given the forensic capabilities available to many DF practitioners.…”
Section: Category 1: Dedicated Af Toolsmentioning
confidence: 99%
“…In this way, the ROIs of the blurred image can be recovered without distortion. A black box approach was used to select the candidate from APP0-APPn to hide the secret information in [11], so that the execution efficiency of the algorithm could be improved without destroying the structure of the image.…”
Section: A Hiding Data Using Appn Markersmentioning
confidence: 99%
“…As far as we know, the document [19] published by NIST pointed out that when AES was used as the scrambling function of the unbalanced Feistel network, it could provide 128-bit security for the FF1 model after 10 rounds of transformation; also, it could provide 128-bit security for the FF3 model after 8 rounds of transformation. However, the authors of [28] pointed out that the FF3 model used in [19] could not provide 128-bit security for a small character set (less than 2 17 ) when the round number is 8; also, the FF1 model could not achieve 128-bit security when the round number is 10, if the size of the character set is less than 2 11 . Additionally, Durak et al pointed out the same results mentioned above in [29].…”
Section: B Feistel Network and Its Round Number For Securitymentioning
confidence: 99%
See 1 more Smart Citation