Social power for privacy protected opportunistic networks

Distl, Bernhard; Neuhaus, Stephan

doi:10.1109/comsnets.2015.7098697

Cited by 5 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…B. Distl and S. Neuhaus [84] proposed a mechanism based on the Bloom filter that uses social connections (preestablished social links) to improve performance without revealing users' private information. The algorithm detects social links, uses them for mutual authentication while protecting personal information.…”

Section: Oppnets Privacy Protection Schemesmentioning

confidence: 99%

Securing and Facilitating Communication Within Opportunistic Networks: A Holistic Survey

2021

View full text Add to dashboard Cite

Opportunistic Networks is a new concept that is increasingly gaining ground since it appears as a concrete example of the Internet of Things, Internet of Vehicles, Industrial Internet of Things, and the Internet of Everything with Mobile ad hoc Networks' characteristics. An Opportunistic Network starts with a Seed OppNet that sets up the network; expands from the Seed OppNet to an extended Seed OppNet through devices' discovery. The characteristics of Opportunistic Networks make OppNets more challenging than any other networks. So, a deep understanding of OppNets' characteristics and demands is an unavoidable precondition before proposing any OppNets related scheme. However, under OppNets' constraints, the relevance of the Opportunistic Networks related articles in literature is yet to be established. Also, most surveys tackling Opportunistic Networks do not give a complete insight into what Opportunistic Networks stand for. This work reviews state of the art on Opportunistic Networks providing three main contributions. First, resorting to the primary definition of Opportunistic Networks, it elucidates what OppNets are, pointing out the particularities of an OppNet, its domains of applications, and challenges. Second, it provides a comprehensive review that encompasses most Opportunistic Networks' research areas: routing, intrusion detection, authentication, privacy protection, data aggregation, and the technology for OppNets, organising them in a taxonomy. Third, it evaluates the role of the Seed OppNet in Opportunistic Networks related schemes. Any proposed OppNets related scheme, to be relevant to OppNets' research, should include OppNets' characteristics and demands.

show abstract

Section: Oppnets Privacy Protection Schemesmentioning

confidence: 99%

Securing and Facilitating Communication Within Opportunistic Networks: A Holistic Survey

2021

View full text Add to dashboard Cite

show abstract

“…In this paper, we focus on social relationship measurement and the efficient routing schemes, which may have security and privacy problems. Recently, a number of solutions [ 22 , 23 , 24 , 25 , 26 ] have been proposed to deal with the security and privacy issues in information exchange between nodes in MONs. The solutions to the privacy and security problems in the proposed scheme can refer to the related works mentioned above.…”

Section: Social Relationship Measurementmentioning

confidence: 99%

Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks

Zeng

Zhao

2017

Sensors

View full text Add to dashboard Cite

In mobile opportunistic networks, the social relationship among nodes has an important impact on data transmission efficiency. Motivated by the strong share ability of “circles of friends” in communication networks such as Facebook, Twitter, Wechat and so on, we take a real-life example to show that social relationships among nodes consist of explicit and implicit parts. The explicit part comes from direct contact among nodes, and the implicit part can be measured through the “circles of friends”. We present the definitions of explicit and implicit social relationships between two nodes, adaptive weights of explicit and implicit parts are given according to the contact feature of nodes, and the distributed mechanism is designed to construct the “circles of friends” of nodes, which is used for the calculation of the implicit part of social relationship between nodes. Based on effective measurement of social relationships, we propose a social-based clustering and routing scheme, in which each node selects the nodes with close social relationships to form a local cluster, and the self-control method is used to keep all cluster members always having close relationships with each other. A cluster-based message forwarding mechanism is designed for opportunistic routing, in which each node only forwards the copy of the message to nodes with the destination node as a member of the local cluster. Simulation results show that the proposed social-based clustering and routing outperforms the other classic routing algorithms.

show abstract

“…FindU [28] offers interest matching among co-located devices and uses secure multi-party computation (SMC) to ensure that only the profile of the best matching nearby user is revealed. Dong et al [18] and Distl et al [17] also address privacy-preserving profile matching. Privacypreserving attribute matching can be built on top of enClosure, but remains as future work.…”

Section: Introductionmentioning

confidence: 99%

enClosure

Tsai

Viti

Lentz

et al. 2019

Proceedings of the 17th Annual International Conference on Mobile Systems, Applications, and Services

View full text Add to dashboard Cite

New applications enabled by personal smart devices and the Internetof-Things (IoT) require communication in the context of periods of spatial co-location. Examples of this encounter-based communication (EbC) include social exchange among individuals who shared an experience, and interaction among personal and IoT devices that provide location-based services. Existing EbC systems are limited to communication among participants that share a direct encounter. This paper is inspired by two insights: (1) encounters also enable group communication among devices connected by paths in the encounter graph that is contextual, spontaneous, secure, and does not require users to reveal identifying or linkable information; and (2) addressing communication partners using encounter closures subject to causal, spatial, and temporal constraints enables powerful new forms of group communication.We present the design of enClosure, a service providing group communication based on encounter closures for mobile and IoT applications, and a prototype implementation for Android and the Microsoft Embedded Social Cloud platform. Using real-world traces, we show that enClosure provides a privacy-preserving, secure platform for a wide range of group communication applications ranging from connecting attendees of a large event and virtual guest books to disseminating health risk warnings, lost-and-found, and tracing missing persons. CCS CONCEPTS• Security and privacy → Pseudonymity, anonymity and untraceability; Privacy-preserving protocols; Social network security and privacy; • Human-centered computing → Ubiquitous and mobile computing systems and tools. , Seoul, Korea users who shared an experience like a large event or journey; communication among users and stationary devices in their wider vicinity; virtual guest book and context-based recommendation services; lost-and-found services; targeted dissemination of health risk warnings; and even aid in the investigation of missing person cases. Users can retain the opportunity to participate in these forms of communication in a privacy-preserving manner, i.e., without disclosing their identity, whereabouts, or linkable information, merely by running the enClosure service in the background. enClosure differs fundamentally from existing forms of group communication. Unlike in conventional address-based group communication, users need not exchange individual addresses or agree on a group address. Unlike in publish-subscribe services, users need not agree on a topic ontology or reveal their interests. Unlike in Web-based location services like Foursquare, Facebook Places, or Google Latitude, users need not disclose their identities, whereabouts, social connections, and communication to a third party. With enClosure, users address intended receivers via encounter closures with causal, temporal, and spatial constraints. This form of addressing gives enClosure unique expressive power to name communication partners, without requiring users to reveal upfront their interests, contact details, or other l...

show abstract

Social power for privacy protected opportunistic networks

Cited by 5 publications

References 12 publications

Securing and Facilitating Communication Within Opportunistic Networks: A Holistic Survey

Securing and Facilitating Communication Within Opportunistic Networks: A Holistic Survey

Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks

enClosure

Contact Info

Product

Resources

About