Pasar al contenido principal

SEGURIDAD EN ENTORNOS MOVILES CON CONECTIVIDAD INTERMITENTE PARA SUS APLICACIONES MEDICAS Y AEROESPACIALES

TIN2010-15764

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2010
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSIDAD AUTONOMA DE BARCELONA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 10
Encontrada(s) 1 página(s)

RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Information System for Supporting Location-based Routing Protocols

  • Garcia, Gerard
  • Robles, Sergi
  • Sánchez, Adrià
  • Borrego, Carlos
This article presents an information system for location-based routing protocols that does not compromise the privacy of the involved nodes. This information system provides a representational model of the most frequented locations of a node, this most frequented zone is called its habitat, and a protocol to compare these habitats among nodes given a target location of interest. Then, the protocol can determine which of the neighbors of a node is nearer or farther from this target location and provides this information to the underlying routing protocol. As it is designed for DTNs, the protocol does not require a trusted third party, instead, it implements a secure multi-party computation based on homomorphic encryption. The protocol is demonstrated to be secure against passive and active adversaries.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Un enfoque tolerante a interrupciones para la seguridad de la Internet de las cosas

  • Ezquerra, Daniel
  • Fabregas, Àngela
  • Toro, M. Carmen de
  • Borrell, Joan
La Internet de las cosas (IoT, Internet of Things) es un paradigma emergente que pretende la interconexión de cualquier objeto susceptible de contar con una parte de electrónica, favorecido por la miniaturización de los componentes. El estado de desarrollo de la IoT hace que no haya ninguna propuesta firme para garantizar la seguridad y la comunicación extremo a extremo. En este artículo presentamos un trabajo en progreso hacia una aproximación tolerante a retrasos (DTN, Delay and Disruption Tolerant Networks) para la comunicación en el paradigma de la IoT y planteamos la adaptación de los mecanismo de seguridad existentes en DTN a la IoT.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Endeavouring to be in the good books, awarding DTN network use for acknowledging the reception of bundles

  • Sánchez-Carmona, Adrián|||0000-0003-0813-3927
  • Robles, Sergi|||0000-0002-9924-2477
  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
This paper describes an incentive scheme for promoting the cooperation, and, therefore, avoiding selfish behaviours, in Delay Tolerant Networks (DTN) by rewarding participant nodes with cryptographic keys that will be required for sending bundles. DTN are normally sparse, and there are few opportunistic contacts, so forwarding of other's bundles can be left out. Moreover, it is difficult to determine the responsible nodes in case of bundle loss. The mechanism proposed in this paper contributes to both problems at the same time. On one hand, cryptographic receipts are generated using time-limited Identity Based Cryptography (IBC) keys to keep track of bundle transmissions. On the other hand, these receipts are used to reward altruistic behaviour by providing newer IBC keys. Finally, these nodes need these IBC keys to send their own bundles. When all nodes behave in a cooperative way, this incentive scheme works as a virtuous circle and achieves a Nash equilibrium, improving very much the network performance in terms of latency. The scheme is not difficult to implement, and it can use an already existing IBC infrastructure used for other purposes in a DTN.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Podcast distribution on Gwanda using PrivHab, a multiagent secure georouting protocol

  • Sánchez Carmona, Adrian|||0000-0003-0813-3927
  • Robles, Sergi|||0000-0002-9924-2477
  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
We present PrivHab, a georouting protocol that improves multiagent systems itinerary decision-making. PrivHab uses the mobility habits of the nodes of the network to select an itinerary for each agent carrying a piece of data. PrivHab makes use of cryptographic techniques to make the decisions while preserving nodes' privacy. PrivHab uses a waypoint-based georouting that achieves a high performance and low overhead in rugged terrain areas that are plenty of physical obstacles. The store-carry-and-forward approach used is based on mobile agents and is designed to operate in areas that lack network infrastructure. We have evaluated PrivHab under the scope of a realistic podcast distribution application in remote rural areas. The PrivHab protocol is compared with a set of well-known delay-tolerant routing algorithms and shown to outperform them.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A mobile code bundle extension for application-defined routing in delay and disruption tolerant networking

  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Robles, Sergi|||0000-0002-9924-2477
  • Fàbregues, Àngela|||0000-0001-9712-1690
  • Sánchez-Carmona, Adrián|||0000-0003-0813-3927
In this paper, we introduce software code to improve Delay and Disruption Tolerant Networking (DTN) performance. DTN is extremely useful when source and destination nodes are intermittently connected. DTN implementations use application-specific routing algorithms to overcome those limitations. However, current implementations do not support the concurrent execution of several routing algorithms. In this paper, we contribute to this issue providing a solution that consists on extending the messages being communicated by incorporating software code for forwarding, lifetime control and prioritisation purposes. Our proposal stems from the idea of moving the routing algorithms from the host to the message. This solution is compatible with Bundle Protocol (BP) and facilitates the deployment of applications with new routing needs. A real case study based on an emergency scenario is presented to provide details of a real implementation. Several simulations are presented to prove the feasibility and usability of the system and to analyse its performance in comparison to state-of-the-art approaches.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Supervised learning using a symmetric bilinear form for record linkage

  • Abril Castellano, Daniel
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
Record Linkage is used to link records of two different files corresponding to the same individuals. These algorithms are used for database integration. In data privacy, these algorithms are used to evaluate the disclosure risk of a protected data set by linking records that belong to the same individual. The degree of success when linking the original (unprotected data) with the protected data gives an estimation of the disclosure risk. In this paper we propose a new parameterized aggregation operator and a supervised learning method for disclosure risk assessment. The parameterized operator is a symmetric bilinear form and the supervised learning method is formalized as an optimization problem. The target of the optimization problem is to find the values of the aggregation parameters that maximize the number of re-identification (or correct links). We evaluate and compare our proposal with other non-parametrized variations of record linkage, such as those using the Mahalanobis distance and the Euclidean distance (one of the most used approaches for this purpose). Additionally, we also compare it with other previously presented parameterized aggregation operators for record linkage such as the weighted mean and the Choquet integral. From these comparisons we show how the proposed aggregation operator is able to overcome or at least achieve similar results than the other parameterized operators. We also study which are the necessary optimization problem conditions to consider the described aggregation functions as metric functions.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Spherical microaggregation, anonymizing sparse vector spaces

  • Abril Castellano, Daniel
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Torra i Reventós, Vicenç|||0000-0002-0368-8037
Unstructured texts are a very popular data type and still widely unexplored in the privacy preserving data mining field. We consider the problem of providing public information about a set of confidential documents. To that end we have developed a method to protect a Vector Space Model (VSM), to make it public even if the documents it represents are private. This method is inspired by microaggregation, a popular protection method from statistical disclosure control, and adapted to work with sparse and high dimensional data sets.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Data privacy

  • Torra i Reventós, Vicenç|||0000-0002-0368-8037
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
Data privacy studies methods, tools, and theory to avoid the disclosure of sensitive information. Its origin is in statistics with the goal to ensure the confidentiality of data gathered from census and questionnaires. The topic was latter introduced in computer science and more particularly in data mining, where due to the large amount of data currently available, has attracted the interest of researchers, practitioners, and companies. In this paper we will review the main topics related to data privacy and privacy-enhancing technologies.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A bloom filter based model for decentralized authorization

  • Foley, Simon N.
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
A decentralized authorization mechanism is proposed that uses Bloom filters to implement authorization delegation. This lightweight mechanism is unlike conventional approaches that typically rely on public key certificates to implement distributed delegation. In taking an approach based on one-way hash functions, the mechanism may be preferable for use in computationally constrained environments where public-key cryptography is not desirable.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Identity-based access control for pro-active message's DTN

  • Sánchez-Carmona, Adrián|||0000-0003-0813-3927
  • Robles, Sergi|||0000-0002-9924-2477
  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
Pro-active message's delay tolerant networks (DTNs) are based on the usage of mobile code to obtain messages that contain their own routing code. This architecture allows applications to use the same network in different ways. The keystone of this type of heterogeneous network is a collection of contextual and application-related information that it is stored in every node and accessed by the messages' routing code. Access to that information must be protected in order to make the whole architecture feasible; the operation of the network has to be secure, and attacks of information poisoning have to be avoided. We propose an identity-based access control system for pro-active message's DTN based on tools that are available in DTN networks, like symmetric key encryption and hashes. Our system grants confidentiality and integrity to the contextual information and solves the question of messages needing to use distributed information stored in nodes to route properly. The proof of concept of identity-based access control in a certain kind of application demonstrates the feasibility of the proposal. The comparison between our proposal and other access control systems shows that identity-based access control is the only system that fits well with the special characteristics of pro-active message's DTN. Copyright © 2016 John Wiley & Sons, Ltd.