Skip to main content

SEGURIDAD PARA MOBILE CROWD SENSING CON PROTOCOLOS OPORTUNISTAS

TIN2014-55243-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2014
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSIDAD AUTONOMA DE BARCELONA

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Measuring QoS in an Aeronautical Opportunistic Network Architecture with Limited Access to a Satellite Communications Backhaul

  • Martínez Vidal, Rubén|||0000-0002-9767-4057
  • Martí, Ramon|||0000-0003-3887-2165
  • Sreenan, Cormac J.|||0000-0002-0767-7888
  • Borrell i Viader, Joan|||0000-0001-6649-0450
We measure quality of service (QoS) in a wireless network architecture of transoceanic aircraft. A distinguishing characteristic of the network scheme we analyze is that it mixes the concept of Delay Tolerant Networking (DTN) through the exploitation of opportunistic contacts, together with direct satellite access in a limited number of the nodes. We provide a graph sparsification technique for deriving a network model that satisfies the key properties of a real aeronautical opportunistic network while enabling scalable simulation. This reduced model allows us to analyze the impact regarding QoS of introducing Internet-like traffic in the form of outgoing data from passengers. Promoting QoS in DTNs is usually really challenging due to their long delays and scarce resources. The availability of satellite communication links offers a chance to provide an improved degree of service regarding a pure opportunistic approach, and therefore it needs to be properly measured and quantified. Our analysis focuses on several QoS indicators such as delivery time, delivery ratio, and bandwidth allocation fairness. Obtained results show significant improvements in all metric indicators regarding QoS, not usually achievable on the field of DTNs.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Methodological evaluation of architectural alternatives for an aeronautical delay tolerant network

  • Martínez Vidal, Rubén|||0000-0002-9767-4057
  • Martí Escalé, Ramon|||0000-0001-8203-5642
  • Sreenan, Cormac J.|||0000-0002-0767-7888
  • Borrell i Viader, Joan|||0000-0001-6649-0450
In this paper, we use graph analysis to evaluate the network architecture of a large scale delay tolerant network (DTN) of transoceanic aircraft. At LCN (Local Computer Networks) 2014 we analyzed information propagation inside a pure opportunistic version of this network, a scenario constructed from more than 2,500 traces of transatlantic flights in which communications relied only on the sporadic contacts between airplanes. As only a small percentage of the nodes were capable of performing efficient air-to-ground communications we concluded the need to devise a more suitable network architecture by combining opportunistic and satellite communication systems. We propose a generic methodology based on graph analysis (both static and dynamic temporal) to evaluate the different ways to create this new architecture. We show the architectural combination that most improves the network delivery performance while minimizing its deployment costs.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Collateral damage of Facebook apps, friends, providers, and privacy interdependence

  • Symeonidis, Iraklis|||0000-0003-4494-6685
  • Shirazi, Fatemeh
  • Biczók, Gergely
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Preneel, Bart|||0000-0003-2005-9651
Third-party apps enable a personalized experience on social networking platforms; however, they give rise to privacy interdependence issues. Apps installed by a user's friends can collect and potentially misuse her personal data inflicting collateral damage on the user while leaving her without proper means of control. In this paper, we present a multi-faceted study on the collateral information collection of apps in social networks. We conduct a user survey and show that Facebook users are concerned about this issue and the lack of mechanisms to control it. Based on real data, we compute the likelihood of collateral information collection affecting users; we show that the probability is significant and depends on both the friendship network and the popularity of the app. We also show its significance by computing the proportion of exposed user attributes including the case of profiling, when several apps are offered by the same provider. Finally, we propose a privacy dashboard concept enabling users to control the collateral damage.
Dipòsit Digital de Documents de la UAB
Publication Capítulo o parte de un libro (BookPart)

Onion routing in deterministic delay tolerant networks

  • Antunez-Veas, Adrian
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
Deterministic DTNs are networks where the behavior is known in advance or where a repetitive action occurs over time like in public transportation networks. This work proposes the application of an onion routing approach to deterministic DTNs to achieve anonymous communications. We show how the prior stage of path selection in onion routing can be achieved using the information provided by deterministic networks.
Dipòsit Digital de Documents de la UAB
Publication Capítulo o parte de un libro (BookPart)

Integral privacy

  • Torra i Reventós, Vicenç|||0000-0002-0368-8037
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
When considering data provenance some problems arise from the need to safely handle provenance related functionality. If some modifications have to be performed in a data set due to provenance related requirements, e.g. remove data from a given user or source, this will affect not only the data itself but also all related models and aggregated information obtained from the data. This is specially aggravated when the data are protected using a privacy method (e.g. masking method), since modification in the data and the model can leak information originally protected by the privacy method. To be able to evaluate privacy related problems in data provenance we introduce the notion of integral privacy as compared to the well known definition of differential privacy.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Towards inferring communication patterns in online social networks

  • Balsa, Ero
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Diaz, Claudia
The separation between the public and private spheres on online social networks is known to be, at best, blurred. On the one hand, previous studies have shown how it is possible to infer private attributes from publicly available data. On the other hand, no distinction exists between public and private data when we consider the ability of the online social network (OSN) provider to access them. Even when OSN users go to great lengths to protect their privacy, such as by using encryption or communication obfuscation, correlations between data may render these solutions useless. In this article, we study the relationship between private communication patterns and publicly available OSN data. Such a relationship informs both privacy-invasive inferences as well as OSN communication modelling, the latter being key toward developing effective obfuscation tools. We propose an inference model based on Bayesian analysis and evaluate, using a real social network dataset, how archetypal social graph features can lead to inferences about private communication. Our results indicate that both friendship graph and public traffic data may not be informative enough to enable these inferences, with time analysis having a non-negligible impact on their precision.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Filling in the missing link between simulation and application in opportunistic networking

  • Sánchez-Carmona, Adrián|||0000-0003-0813-3927
  • Guidec, Frédéric
  • Launay, Pascale
  • Mahéo, Yves
  • Robles, Sergi|||0000-0002-9924-2477
In the domain of opportunistic networking, just like in any other domain of computer science, the engineering process should span all stages between an original idea and the validation of its implementation in real conditions. Yet most researchers often stop halfway along this process: they rely on simulation to validate the protocols and distributed applications they design, and neglect to go further. Their algorithms are thus only rarely implemented for real, and when they are, the validation of the resulting code is usually performed at a very small scale. Therefore, the results obtained are hardly repeatable or comparable to others. LEPTON is an emulation platform that can help bridge the gap between pure simulation and fully operational implementation, thus allowing developers to observe how the software they develop (instead of pseudo-code that simulates its behavior) performs in controlled, repeatable conditions. In this paper we present LEPTON, an emulation platform we developed, and we show how existing opportunistic networking systems can be adapted to run with this platform. Taking two existing middleware systems as use cases, we also demonstrate that running demanding scenarios with LEPTON constitute an excellent stress test and a powerful tool to improve the opportunistic systems under test.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

PrivHab, A privacy preserving georouting protocol based on a multiagent system for podcast distribution on disconnected areas

  • Sánchez-Carmona, Adrián|||0000-0003-0813-3927
  • Robles, Sergi|||0000-0002-9924-2477
  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
We present PrivHab, a privacy preserving georouting protocol that improves multiagent decision-making. PrivHab learns the mobility habits of the nodes of the network. Then, it uses this information to dynamically select to route an agent carrying a piece of data to reach its destination. PrivHab makes use of cryptographic techniques from secure multi-party computation to make the decisions while preserving nodes' privacy. PrivHab uses a waypoint-based routing 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 combined with mobile agents that provide intelligence, and it 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, where these programs have to be recorded into a physical format and distributed to the local radio stations. The usage of PrivHab aims to reduce this spending of resources. 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
Publication Artículo científico (JournalArticle)

PrivHab+, A secure geographic routing protocol for DTN

  • 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 secure geographic routing protocol that learns about the mobility habits of the nodes of the network and uses this information in a secure manner. PrivHab+ is designed to operate in areas that lack of network, using the store-carry-and-forward approach. PrivHab+ compares nodes and chooses the best choice to carry messages towards a known geographical location. To achieve a high performance and low overhead, PrivHab+ uses information about the usual whereabouts of the nodes to make optimal routing decisions. PrivHab+ makes use of cryptographic techniques from secure multi-party computation to preserve nodes' privacy while taking routing decisions. The overhead introduced by PrivHab+ is evaluated using a proof-of-concept implementation, and its performance is studied under the scope of a realistic application of podcast distribution. PrivHab+ is compared, through simulation, with a set of well-known delay-tolerant routing algorithms in two different scenarios of remote rural areas.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Two birds, one stone, using mobility behavioral profiles both as destinations and as a routing tool

  • Sánchez Carmona, Adrian|||0000-0003-0813-3927
  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Robles, Sergi|||0000-0002-9924-2477
  • García-Vandellós, Gerard
We present HabCast, a profile-cast communication paradigm that learns about the mobility habits of the location-aware nodes of the network and uses this information both to route the messages, and to deliver them only to the nodes that match the target behavioral profile. HabCast substitutes destination's identifier by a mobility profile model called habitat, meaning that allows users to send messages "to any nodes who usually roams around this area" instead of sending messages intended to a node. HabCast is designed to operate without network infrastructure, using Opportunistic Networking strategies and operates in three phases: approximation, floating and delivery phase. HabCast enables new services and applications on Opportunistic Networking by automatically inferring the nodes' behavioral profiles and using them to define the messages' destinations. The overhead introduced by HabCast is evaluated using a proof-of-concept implementation, and its performance and feasibility is studied, through simulation, under the scope of a real carsharing application.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Explore and wait, a composite routing-delivery scheme for relative profile-casting in opportunistic networks

  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Sánchez-Carmona, Adrián|||0000-0003-0813-3927
  • Li, Zhiyuan|||0000-0002-6088-8086
  • Robles, Sergi|||0000-0002-9924-2477
In the context of Opportunistic Networking (OppNet), designing routing and delivery protocols is currently an open and active line of research. In some OppNet scenarios, destination addresses are not always known by sending applications. Profile-cast models solve this problem by allowing message destinations to be users or groups of users defined by their profiles. These profiles provide very effective ways of characterizing nodes in terms of node's attributes such as their profession, interests or typical whereabouts, for example. However, there are strong limitations in OppNet Profile-casting. There is no current way of representing special profiles defined by relative delivery functions such as best, maximum or over-the-average: nodes belong to these relative profiles taking into account not only attributes from the very same node but also relative to others from the same profile. In this article, we introduce Relcast, a Profile-cast model that allows messages to be sent to profiles defined in terms of relative delivery functions. Additionally, we present Explore and Wait, a composite routing-delivery scheme that uses optimal stopping theory-based delivery strategies to route Relcast messages. We show, using simulations, that this routing-delivery scheme performs better than traditional approaches that use state-of-the-art routing-delivery primitives.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Softwarecast, a code-based delivery Manycast scheme in heterogeneous and Opportunistic Ad Hoc Networks

  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Robles, Sergi|||0000-0002-9924-2477
  • García-Vandellós, Gerard
In the context of Opportunistic Ad Hoc Networking paradigms, group communication schemes (Manycast) are difficult to conduct. In this article, we propose a general delivery scheme for Manycast group communications based on mobile code. Our proposal extends network addressing by moving from the static header field paradigm to a software code-based addressing scheme. We allow messages to be delivered using built-in software codes that consider application-defined, context-aware or history-based information. Additionally, we allow messages to carry a delivery state that permits them to perform refined delivery-decision-making methods. As a consequence of this scheme, we have found that new group communication schemes, besides the traditional ones, may be beneficial to improve the network performance and to provide new functionalities to emerging scenarios like intermittently connected networks of heterogeneous physical objects. We present an application of this scheme to solve, following an analytical delivery method, the problem of sending a message to k and only k nodes of a heterogeneous and opportunistic network scenario that fit best a given criterion. We show, using simulations, that our proposal performs better than traditional approaches. Finally, to show that our proposal is feasible, we present an implementation of our proposal in a real Opportunistic Ad Hoc network, a DTN network, compatible with the de facto standard Bundle Protocol.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Another coin bites the dust, an analysis of dust in UTXO-based cryptocurrencies

  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Delgado-Segura, Sergi|||0000-0001-7783-7288
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
Unspent Transaction Outputs (UTXOs) are the internal mechanism used in many cryptocurrencies to represent coins. Such representation has some clear benefits, but also entails some complexities that, if not properly handled, may leave the system in an inefficient state. Specifically, inefficiencies arise when wallets (the software responsible for transferring coins between parties) do not manage UTXOs properly when performing payments. In this paper, we study three cryptocurrencies: Bitcoin, Bitcoin Cash and Litecoin, by analysing the state of their UTXO sets, that is, the status of their sets of spendable coins. These three cryptocurrencies are the top-3 UTXO-based cryptocurrencies by market capitalization. Our analysis shows that the usage of each cryptocurrency presents some differences, and led to different results. Furthermore, it also points out that the management of the transactions has not always been performed efficiently and therefore, the current state of the UTXO sets is far from ideal.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Synthetic generation of spatial graphs

  • Torra i Reventós, Vicenç|||0000-0002-0368-8037
  • Jonsson, Annie
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Salas, Julián
Graphs can be used to model many different types of interaction networks, for example, online social networks or animal transport networks. Several algorithms have thus been introduced to build graphs according to some predefined conditions. In this paper, we present an algorithm that generates spatial graphs with a given degree sequence. In spatial graphs, nodes are located in a space equiped with a metric. Our goal is to define a graph in such a way that the nodes and edges are positioned according to an underlying metric. More particularly, we have constructed a greedy algorithm that generates nodes proportional to an underlying probability distribution from the spatial structure, and then generates edges inversely proportional to the Euclidean distance between nodes. The algorithm first generates a graph that can be a multigraph, and then corrects multiedges. Our motivation is in data privacy for social networks, where a key problem is the ability to build synthetic graphs. These graphs need to satisfy a set of required properties (e.g., the degrees of the nodes) but also be realistic, and thus, nodes (individuals) should be located according to a spatial structure and connections should be added taking into account nearness.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Double-spending prevention for Bitcoin zero-confirmation transactions

  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Delgado-Segura, Sergi|||0000-0001-7783-7288
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
Zero-confirmation transactions, i.e. transactions that have been broadcast but are still pending to be included in the blockchain, have gained attention in order to enable fast payments in Bitcoin, shortening the time for performing payments. Fast payments are desirable in certain scenarios, for instance, when buying in vending machines, fast food restaurants, or withdrawing from an ATM. Despite being quickly propagated through the network, zero-confirmation transactions are not protected against double-spending attacks, since the double-spending protection Bitcoin offers relies on the blockchain and, by definition, such transactions are not yet included in it. In this paper, we propose a double-spending prevention mechanism for Bitcoin zero-confirmation transactions. Our proposal is based on exploiting the flexibility of the Bitcoin scripting language together with a well-known vulnerability of the ECDSA signature scheme to discourage attackers from performing such an attack.
Dipòsit Digital de Documents de la UAB
Publication Artículo de revisión (ReviewArticle)

Cryptocurrency Networks, A New P2P Paradigm

  • Delgado-Segura, Sergi|||0000-0001-7783-7288
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Borrell i Viader, Joan|||0000-0001-6649-0450
P2P networks are the mechanism used by cryptocurrencies to disseminate system information while keeping the whole system as much decentralized as possible. Cryptocurrency P2P networks have new characteristics that propose new challenges and avoid some problems of existing P2P networks. By characterizing the most relevant cryptocurrency network, Bitcoin, we provide details on different properties of cryptocurrency networks and their similarities and differences with standard P2P network paradigms. Our study allows us to conclude that cryptocurrency networks present a new paradigm of P2P networks due to the mechanisms they use to achieve high resilience and security. With this new paradigm, interesting research lines can be further developed, both in the focused field of P2P cryptocurrency networks and also when such networks are combined with other distributed scenarios.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

A fair protocol for data trading based on Bitcoin transactions

  • Delgado-Segura, Sergi|||0000-0001-7783-7288
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
On-line commercial transactions involve an inherent mistrust between participant parties since, sometimes, no previous relation exists between them. Such mistrust may be a deadlock point in a trade transaction where the buyer does not want to perform the payment until the seller sends the goods and the seller does not want to do so until the buyer pays for the purchase. In this paper we present a fair protocol for data trading where the commercial deal, in terms of delivering the data and performing the payment, is atomic, since the seller cannot redeem the payment unless the buyer obtains the data and the buyer cannot obtain the data without performing the payment. The protocol is based on Bitcoin scripting language and the fairness of the protocol can be probabilistically enforced.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Collateral damage of Facebook third-party applications, a comprehensive study

  • Symeonidis, Iraklis|||0000-0003-4494-6685
  • Biczók, Gergely
  • Shirazi, Fatemeh
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Schroers, Jessica
  • Preneel, Bart|||0000-0003-2005-9651
Third-party applications on Facebook can collect personal data of the users who install them, but also of their friends. This raises serious privacy issues as these friends are not notified by the applications nor by Facebook and they have not given consent. This paper presents a detailed multi-faceted study on the collateral information collection of the applications on Facebook. To investigate the views of the users, we designed a questionnaire and collected the responses of 114 participants. The results show that participants are concerned about the collateral information collection and in particular about the lack of notification and of mechanisms to control the data collection. Based on real data, we compute the likelihood of collateral information collection affecting users: we show that the probability is significant and greater than 80% for popular applications such as TripAdvisor. We also demonstrate that a substantial amount of profile data can be collected by applications, which enables application providers to profile users. To investigate whether collateral information collection is an issue to users' privacy we analysed the legal framework in light of the General Data Protection Regulation. We provide a detailed analysis of the entities involved and investigate which entity is accountable for the collateral information collection. To provide countermeasures, we propose a privacy dashboard extension that implements privacy scoring computations to enhance transparency toward collateral information collection. Furthermore, we discuss alternative solutions highlighting other countermeasures such as notification and access control mechanisms, cryptographic solutions and application auditing. To the best of our knowledge this is the first work that provides a detailed multi-faceted study of this problem and that analyses the threat of user profiling by application providers.