|
Descripción
|
|
|---|---|
| Similarity preserving hash applications, also known as fuzzy hash functions, help to analyse the content of digital devices by performing a resemblance comparison between different files. In practice, the similarity matching procedure is a two-step process, where first a signature associated to the files under comparison is generated, and then a comparison of the signatures themselves is performed. Even though ssdeep is the best-known application in this field, the edit distance algorithm that ssdeep uses for performing the signature comparison is not well-suited for certain scenarios. In this contribution we present a new edit distance algorithm that better reflects the similarity of two strings, and that can be used by fuzzy hash applications in order to improve their results. | |
|
Internacional
|
Si |
|
Nombre congreso
|
In The 2015 World Congress in Computer Science, Computer Engineering, and Applied Computing (WORLDCOMP''15), The 2015 International Conference on Security and Management (SAM''15) |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
|
|
Revisores
|
Si |
|
ISBN o ISSN
|
1-60132-412-X |
|
DOI
|
|
|
Fecha inicio congreso
|
20/07/2015 |
|
Fecha fin congreso
|
24/07/2015 |
|
Desde la página
|
326 |
|
Hasta la página
|
332 |
|
Título de las actas
|
The 2015 World Congress in Computer Science, Computer Engineering, and Applied Computing (WORLDCOMP''15) |