BSIEM-IoT: un SIEM distribuido y basado en blockchain para Internet de las cosas

El papel que nos ocupa propone si SIEM-IoT, una solución de gestión de eventos e información de seguridad (SIEM) para Internet de las cosas (IoT) que se basa en blockchain para almacenar y acceder a eventos de seguridad. Los eventos de seguridad incluidos en la cadena de bloques son aportados por varios centinelas de IoT encargados de proteger un grupo de dispositivos de IoT. Una característica clave aquí es que la cadena de bloques garantiza un registro seguro de eventos de seguridad. Además, la propuesta permite que los componentes funcionales SIEM se asignen a diferentes servidores mineros que componen un SIEM distribuido y resistente. Nuestra propuesta se implementa utilizando Ethereum y se valida a través de diferentes casos de uso y experimentos.The paper at hand proposes BSIEM-IoT, a Security Information and Event Management solution (SIEM) for the Internet of Things (IoT) relying on blockchain to store and access security events. The security events included in the blockchain are contributed by a number of IoT sentinels in charge of protecting a group of IoT devices. A key feature here is that the blockchain guarantees a secure registry of security events. Additionally, the proposal allows SIEM functional components to be assigned to the ff erent miners servers composing to resilient and distributed SIEM. Our proposal is implemented using Ethereum and validated through different use cases and experiments

Numerical solution of a Laplace equation with data in L1

In this work, we address the numerical solution of the Laplace equation with data in L1 by IP1 finite element schemes. Even if this is a simple problem, its analysis is difficult and requires new tools because finite element schemes are based on variational formulations which do not lend themselves to estimates in the L1 norm. The approach for analyzing this problem consists in applying some of the techniques that are used by Murat (cf. [5]) and Boccardo & Gallouet (cf. [2]) in constructing the renormalized solution of the problem. The key ingredient is the assumption that all the angles of the grid are acute; then the matrix of the system is an M matrix. Interestingly, with this sole assumption, we prove that uh tends to u in mesure in O

Mobility in Collaborative Alert Systems: Building Trust through Reputation

Part 3: - WCNS 2011 WorkshopInternational audienceCollaborative Intrusion Detection Networks (CIDN) are usually composed by a set of nodes working together to detect distributed intrusions that cannot be easily recognized with traditional intrusion detection architectures. In this approach every node could potentially collaborate to provide its vision of the system and report the alarms being detected at the network, service and/or application levels. This approach includes considering mobile nodes that will be entering and leaving the network in an ad hoc manner. However, for this alert information to be useful in the context of CIDN networks, certain trust and reputation mechanisms determining the credibility of a particular mobile node, and the alerts it provides, are needed. This is the main objective of this paper, where an inter-domain trust and reputation model, together with an architecture for inter-domain collaboration, are presented with the main aim of improving the detection accuracy in CIDN systems while users move from one security domain to another