Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/346852
Full metadata record
DC FieldValueLanguage
dc.contributor.CRUESPUNIVERSIDADE ESTADUAL DE CAMPINASpt_BR
dc.contributor.authorunicampMoia, Vitor Hugo Galhardo-
dc.contributor.authorunicampHenriques, Marco Aurelio Amaral-
dc.typeArtigopt_BR
dc.titleSimilarity digest search: a survey and comparative analysis of strategies to perform known file filtering using approximate matchingpt_BR
dc.contributor.authorMoia, V.H.G.-
dc.contributor.authorHenriques, M.A.A.-
dc.subjectCiência forense digitalpt_BR
dc.subject.otherlanguageDigital forensic sciencept_BR
dc.description.abstractDigital forensics is a branch of Computer Science aiming at investigating and analyzing electronic devices in the search for crime evidence. There are several ways to perform this search. Known File Filter (KFF) is one of them, where a list of interest objects is used to reduce/separate data for analysis. Holding a database of hashes of such objects, the examiner performs lookups for matches against the target device. However, due to limitations over hash functions (inability to detect similar objects), newmethods have been designed, called approximate matching. This sort of function has interesting characteristics for KFF investigations but suffers mainly from high costs when dealing with huge data sets, as the search is usually done by brute force. To mitigate this problem, strategies have been developed to better perform lookups. In this paper, we present the state of the art of similarity digest search strategies, along with a detailed comparison involving several aspects, as time complexity, memory requirement, and search precision. Our results show that none of the approaches address at least these main aspects. Finally, we discuss future directions and present requirements for a new strategy aiming to fulfill current limitationspt_BR
dc.relation.ispartofSecurity and communication networkspt_BR
dc.relation.ispartofabbreviationSecurity comm. networkspt_BR
dc.publisher.cityHoboken, NJpt_BR
dc.publisher.countryEstados Unidospt_BR
dc.publisherJohn Wiley & Sonspt_BR
dc.date.issued2017-
dc.language.isoengpt_BR
dc.description.volume2017pt_BR
dc.rightsAbertopt_BR
dc.sourceSCOPUSpt_BR
dc.identifier.issn1939-0114pt_BR
dc.identifier.eissn1939-0122pt_BR
dc.identifier.doi10.1155/2017/1306802pt_BR
dc.identifier.urlhttps://www.hindawi.com/journals/scn/2017/1306802/pt_BR
dc.description.sponsorshipCOORDENAÇÃO DE APERFEIÇOAMENTO DE PESSOAL DE NÍVEL SUPERIOR - CAPESpt_BR
dc.description.sponsordocumentnumber23038.007604/2014-69pt_BR
dc.date.available2020-08-06T15:13:25Z-
dc.date.accessioned2020-08-06T15:13:25Z-
dc.description.provenanceSubmitted by Mariana Aparecida Azevedo (mary1@unicamp.br) on 2020-08-06T15:13:25Z No. of bitstreams: 0. Added 1 bitstream(s) on 2021-01-08T19:02:52Z : No. of bitstreams: 1 2-s2.0-85031995746.pdf: 1746586 bytes, checksum: 3ead24d571fd45035aa98d4af11175a5 (MD5)en
dc.description.provenanceMade available in DSpace on 2020-08-06T15:13:25Z (GMT). No. of bitstreams: 0 Previous issue date: 2017en
dc.identifier.urihttp://repositorio.unicamp.br/jspui/handle/REPOSIP/346852-
dc.contributor.departmentsem informaçãopt_BR
dc.contributor.departmentDepartamento de Engenharia de Computação e Automação Industrialpt_BR
dc.contributor.unidadeFaculdade de Engenharia Elétrica e de Computaçãopt_BR
dc.contributor.unidadeFaculdade de Engenharia Elétrica e de Computaçãopt_BR
dc.subject.keywordSimilarity Digestpt_BR
dc.subject.keywordCybercrimept_BR
dc.subject.keywordCourt of lawpt_BR
dc.subject.keywordKnown File Filterpt_BR
dc.identifier.source2-s2.0-85031995746pt_BR
dc.creator.orcidsem informaçãopt_BR
dc.creator.orcid0000-0001-9241-2229pt_BR
dc.type.formArtigo de pesquisapt_BR
dc.identifier.articleid1306802pt_BR
Appears in Collections:FEEC - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
2-s2.0-85031995746.pdf1.71 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.