Modelo de arreglo de árboles para detección de cambios no autorizados



Título del documento: Modelo de arreglo de árboles para detección de cambios no autorizados
Revista: Avances en sistemas e informática
Base de datos: PERIÓDICA
Número de sistema: 000353207
ISSN: 1657-7663
Autores:
1
Instituciones: 1Universidad de Costa Rica, Escuela de Ciencias de la Computación e Informática, San Pedro de Montes de Oca, San José. Costa Rica
Año:
Periodo: Sep
Volumen: 6
Número: 2
Paginación: 69-76
País: Colombia
Idioma: Español
Tipo de documento: Artículo
Enfoque: Aplicado, descriptivo
Resumen en español This paper describes a mechanism for detection of changes in a data set to be protected or monitored. The mechanism is based on the creation of detectors derived from self character str ings from the data set. The data str ucture used for stor ing detectors is a tree array. Each tree in the array stores detectors for a sequence of r adjacent char acter s within a lchar acter string extr acted fr om the data set. Each node in a tr ee r epr esents a char acter in a detector. In the monitoring phase, changes in the data set are detected going acr oss nodes of the tree ar r ay. A character string being analyzed is compared with detectors in the tree array. A change is detected when no matching route from the
Resumen en inglés This paper describes a mechanism for detection of changes in a data set to be protected or monitored. The mechanism is based on the creation of detectors derived from self character str ings from the data set. The data str ucture used for stor ing detectors is a tree array. Each tree in the array stores detectors for a sequence of r adjacent char acter s within a lchar acter string extr acted fr om the data set. Each node in a tr ee r epr esents a char acter in a detector. In the monitoring phase, changes in the data set are detected going acr oss nodes of the tree ar r ay. A character string being analyzed is compared with detectors in the tree array. A change is detected when no matching route from the This paper describes a mechanism for detection of changes in a data set to be protected or monitored. The mechanism is based on the creation of detectors derived from self character str ings from the data set. The data str ucture used for stor ing detectors is a tree array. Each tree in the array stores detectors for a sequence of r adjacent char acter s within a lchar acter string extr acted fr om the data set. Each node in a tr ee r epr esents a char acter in a detector. In the monitoring phase, changes in the data set are detected going acr oss nodes of the tree ar r ay. A character string being analyzed is compared with detectors in the tree array. A change is detected when no matching route from the
Disciplinas: Ciencias de la computación
Palabras clave: Software,
Seguridad en cómputo,
Detección de cambio,
Detectores
Keyword: Computer science,
Software,
Computing security,
Change detection,
Detectors
Texto completo: Texto completo (Ver HTML)