Privacy-Aware and Highly-Available OSN Profiles

Narendula, Rammohan; Papaioannou, Thanasis G.; Aberer, Karl

doi:10.1109/wetice.2010.40

Cited by 18 publications

(11 citation statements)

References 17 publications

(21 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…User registration phase and secure P2P communications are inspected as well. Narendula et al (2010) proposed an initial design of such a system, referred to as porkut, where users organize a social network over a P2P overlay with privacy-preserving data access. They briefly outline the system architecture and mainly focus on the distributed storage layer.…”

Section: Related Workmentioning

confidence: 99%

Paradigm Shift in the Security-n-Privacy Implementation of Semi-Distributed Online Social Networking

Ahmad¹,

Aljumah²

2013

CIS

View full text Add to dashboard Cite

Social Networking Applications has gained tremendous response from all the sections of people across the entire world from last few years. Social networking has crossed all the boundaries and glued whole world population together. Users of OSN (Online Social Networking) sites can re-connect with school friends, find some activity or even life partners, and make new friends. OSN has also revolutionized the business community. Now the companies leverage OSN's credibility and build their reputation, get invaluable information about the customers. The companies are also using OSN for the advertising and the recruitment processes. However, posting of user information on OSN poses greater threats/risks as identity theft, online stalking, and information leakage. The volume and accessibility of personal information available on social networking sites have attracted malicious people who seek to exploit this information. This imposes greater threat to the users' privacy and security. In this article many security and privacy challenges currently faced by OSN applications are mentioned. The distributed OSN architecture with an external control module is proposed and a prototype is also presented which overcomes many of the privacy, security, accessibility and identity challenges in different perspectives faced by current OSN applications.

show abstract

Section: Related Workmentioning

confidence: 99%

Paradigm Shift in the Security-n-Privacy Implementation of Semi-Distributed Online Social Networking

Ahmad¹,

Aljumah²

2013

CIS

View full text Add to dashboard Cite

show abstract

“…PeerSoN [6], LifeSocial.KOM [11] and Pokurt [17] aim to overcome the OSN limitations by focusing on user privacy consolidation by means of encryption, access control and decentralization, while preserving OSN features. To provide reliable and replicated data storage, LifeSocial.KOM relies on PAST, while Pokurt exploits users' geographical location and online time period.…”

Section: Related Workmentioning

confidence: 99%

Towards robust and scalable peer-to-peer social networks

Olteanu

Pierre

2012

Proceedings of the Fifth Workshop on Social Network Systems

View full text Add to dashboard Cite

Peer-to-peer Online Social Networks (OSNs) promise to combine the functionalities of centralized OSNs with the good properties of peer-to-peer systems. However, in time, the number of connections between users of OSNs grows super-linearly in the number of users: the average node degree increases with the overall system size. In large-scale settings, mapping each friendship relation into an overlay link will thus overwhelm popular nodes. We propose simple techniques to build and maintain the peer-to-peer OSN overlay while significantly shifting node degrees towards lower ranges. We evaluate our algorithms using real large-scale datasets, and show that they can disseminate information efficiently while controlling node degrees, even in the presence of high churn.

show abstract

“…Finally, having such super-peers help facilitate new node joins in the system, since new joinees would typically not immediately know enough friends. This is a critical functionality, which is often ignored in existing literature [2,4,3,14], which deal with data management issues assuming that nodes have already established (adequate) social connections.…”

Section: Introductionmentioning

confidence: 99%

SuperNova: Super-peers based architecture for decentralized online social networks

Sharma

Datta

2012

2012 Fourth International Conference on Communication Systems and Networks (COMSNETS 2012)

View full text Add to dashboard Cite

Recent years have seen several earnest initiatives from both academic researchers as well as open source communities to implement and deploy decentralized online social networks (DOSNs). The primary motivations for DOSNs are privacy and autonomy from big brotherly service providers. The promise of decentralization is complete freedom for end-users from any service providers both in terms of keeping privacy about content and communication, and also from any form of censorship. However decentralization introduces many challenges. One of the principal problems is to guarantee availability of data even when the data owner is not online, so that others can access the said data even when a node is offline or down. Intuitively this can be solved by replicating the data on other users' machines. Existing DOSN proposals try to solve this problem using heuristics which are agnostic to the various kinds of heterogeneity both in terms of end user resources as well as end user behaviors in such a system. For instance, some propose replication at friends, or at some other peers based on other heuristics such as reciprocal storage among nodes with similar availability, or storage in a global DHT realized using all peers' resources. In this paper, we argue that a pragmatic design needs to explicitly allow for and leverage on system heterogeneity, and provide incentives for the resource rich participants in the system to contribute such resources. To that end we introduce SuperNova -a super-peer based DOSN architecture. Super-peers can help (i) bootstrap new peers who are yet to have/find any friends by either providing them storage space, (ii) maintaining a directory of users, so that users can find friends in the network by name or interests, (iii) help peers find other peers to store their content in case they don't have adequate friends to do so, or if their friends are already overloaded. We envision a self-organizing system, where nodes that provide substantial resources can gain reputation, and be elevated to the status of super-peers. Users may want to become super-peers out of altruism (they want DOSNs to succeed), for the sake of the reputation (e.g., being an influential member for an interest based community) as well as potentially to monetize their special roles (e.g., run advertisements). While proposing the SuperNova architecture, we envision a dynamic system driven by incentives and reputation, however, investigation of such incentives and reputation, and its effect on determining peer behaviors is a subject for our future study. In this paper we instead investigate the efficacy of a super-peer based system at any time point (a snap-shot of the envisioned dynamic system), that is to say, we try to quantify the performance of SuperNova system given any (fixed) mix of peer population and strategies.

show abstract

Privacy-Aware and Highly-Available OSN Profiles

Cited by 18 publications

References 17 publications

Paradigm Shift in the Security-n-Privacy Implementation of Semi-Distributed Online Social Networking

Paradigm Shift in the Security-n-Privacy Implementation of Semi-Distributed Online Social Networking

Towards robust and scalable peer-to-peer social networks

SuperNova: Super-peers based architecture for decentralized online social networks

Contact Info

Product

Resources

About