Results 1 -
9 of
9
Supernova: Super-peers based architecture for decentralized online social networks
- CoRR
"... Abstract. Recent years have seen several earnest initiatives from both academic researchers as well as open source communities to implement and deploy decen-tralized online social networks (DOSNs). The primary motivations for DOSNs are privacy and autonomy from big brotherly service providers. The p ..."
Abstract
-
Cited by 21 (2 self)
- Add to MetaCart
(Show Context)
Abstract. Recent years have seen several earnest initiatives from both academic researchers as well as open source communities to implement and deploy decen-tralized 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 heuris-tics such as reciprocal storage among nodes with similar availability, or storage
Selective Propagation of Social Data in Decentralized Online Social Network
"... Abstract. In Online Social Networks (OSNs) users are overwhelmed with huge amount of social data, most of which are irrelevant to their interest. Due to the fact that most current OSNs are centralized, people are forced to share their data with the site, in order to be able to share it with their fr ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract. In Online Social Networks (OSNs) users are overwhelmed with huge amount of social data, most of which are irrelevant to their interest. Due to the fact that most current OSNs are centralized, people are forced to share their data with the site, in order to be able to share it with their friends, and thus they lose control over it. Decentralized OSNs provide an alternative which allows users to maintain control over their data. This paper discusses an approach for propagation of social data in a decentralized OSN so as to reduce irrelevant data among users. The approach uses interaction between users to construct relationship model of interest. This relationship model acts as a filter later while propagating social data of the same interest group. This paper also presents a plan of a simulation to analyze our approach.
Privacy-Preserving Link Prediction in Decentralized Online Social Networks
"... Abstract. We consider the privacy-preserving link prediction problem in decentralized online social network (OSNs). We formulate the problem as a sparse logistic regression problem and solve it with a novel decentral-ized two-tier method using alternating direction method of multipliers (ADMM). This ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract. We consider the privacy-preserving link prediction problem in decentralized online social network (OSNs). We formulate the problem as a sparse logistic regression problem and solve it with a novel decentral-ized two-tier method using alternating direction method of multipliers (ADMM). This method enables end users to collaborate with their online service providers without jeopardizing their data privacy. The method also grants end users fine-grained privacy control to their personal data by supporting arbitrary public/private data split. Using real-world data, we show that our method enjoys various advantages including high pre-diction accuracy, balanced workload, and limited communication over-head. Additionally, we demonstrate that our method copes well with link reconstruction attack.
Secure Friend Discovery via Privacy-Preserving and Decentralized Community Detection
"... The problem of secure friend discovery on a so-cial network has long been proposed and stud-ied. The requirement is that a pair of nodes can make befriending decisions with minimum infor-mation exposed to the other party. In this paper, we propose to use community detection to tackle the problem of ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
The problem of secure friend discovery on a so-cial network has long been proposed and stud-ied. The requirement is that a pair of nodes can make befriending decisions with minimum infor-mation exposed to the other party. In this paper, we propose to use community detection to tackle the problem of secure friend discovery. We for-mulate the first privacy-preserving and decentral-ized community detection problem as a multi-objective optimization. We design the first proto-col to solve this problem, which transforms com-munity detection to a series of Private Set In-tersection (PSI) instances using Truncated Ran-dom Walk (TRW). Preliminary theoretical results show that our protocol can uncover communities with overwhelming probability and preserve pri-vacy. We also discuss future works, potential ex-tensions and variations. 1
pWeb: A Personal Interface to the World Wide Web
"... Abstract—Centralized social networking and media sharing portals provide inadequate support for preserving user privacy, content ownership and control. These problems can be mitigated through distributed Web services as demonstrated by a number of academic projects and industrial deployments. In gen ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Centralized social networking and media sharing portals provide inadequate support for preserving user privacy, content ownership and control. These problems can be mitigated through distributed Web services as demonstrated by a number of academic projects and industrial deployments. In general, these distributed services do not assign globally recognized, persistent names to the user devices. As a result, these solutions work in isolation and also cannot inter-operate with traditional Web technology. In this work, we present a decentralized and scalable platform, named pWeb, for distributing web services, like online social networks and media streaming, across end-user devices. pWeb assigns Internet compatible names to end-user devices, and provides name resolution and directory services. A user can retain ownership, and make the services and contents in his devices searchable and accessible at different privacy levels, e.g., friends, family and public. New services can be easily developed and deployed over the pWeb platform. We have developed a working prototype of the platform, and to demonstrate its effectiveness we have implemented a video streaming application for Android and Windows platforms. We also present performance results from our prototype implementation. I.
Distributed protocols for Ego Betweenness Centrality computation in DOSNs
"... Abstract-Online Social Networks (OSNs) tipically exploit a logically centralized infrastructure which has several drawbacks including scalability, privacy, and dependence on a provider. In contrast to centralized OSNs, a Distributed Online Social Network helps to lower the cost of the provider dras ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract-Online Social Networks (OSNs) tipically exploit a logically centralized infrastructure which has several drawbacks including scalability, privacy, and dependence on a provider. In contrast to centralized OSNs, a Distributed Online Social Network helps to lower the cost of the provider drastically, and allows better control of user privacy. A distributed approach introduces new problems to address, as data availability or information diffusion, which require the definition of methods for the analysis of the social graph. This paper focuses the problem of the evaluation of the centrality of a nodes in a Distributed Online Social Network and proposes a distributed approach for the computation of the Ego Betweenness Centrality, which is an ego-centric method to approximate the Betweenness Centrality. We propose a set of algorithms to compute the betweenness centrality in static and dynamic graphs, which can be directed or undirected. We propose both a broadcast and a gossip protocol to compute the Ego Betweenness Centrality. A set of experimental results proving the effectiveness of our approach are presented.
pWeb: A Personal Interface to the World Wide Web
"... Abstract—Centralized social networking and media sharing portals provide inadequate support for preserving user privacy, content ownership and control. These problems can be mitigated through distributed Web services as demonstrated by a number of academic projects and industrial deployments. In gen ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Centralized social networking and media sharing portals provide inadequate support for preserving user privacy, content ownership and control. These problems can be mitigated through distributed Web services as demonstrated by a number of academic projects and industrial deployments. In general, these distributed services do not assign globally recognized, persistent names to the user devices. As a result, these solutions work in isolation and also cannot inter-operate with traditional Web technology. In this work, we present a decentralized and scalable platform, named pWeb, for distributing web services, like online social networks and media streaming, across end user devices. pWeb assigns Internet compatible names to end user devices, and provides name resolution and directory services. A user can retain ownership, and make the services and contents in his devices searchable and accessible at different privacy levels, e.g., friends, family and public. New services can be easily developed and deployed over the pWeb platform. We have developed a working prototype of the platform, and to demonstrate its effectiveness we have implemented a video streaming application for Android and Windows platforms. We also present performance results from our prototype implementation. I.
SNSAPI: A Cross-Platform Middleware for Rapid Deployment of Decentralized Social Networks
"... In this paper, we present the design, implementation and our year-long maintenance experience of SNSAPI, a Python-based middleware which unifies the interfaces and data structures of heterogeneous Social Network-ing Services (SNS). Unlike most prior works, our mid-dleware is user-oriented and requir ..."
Abstract
- Add to MetaCart
(Show Context)
In this paper, we present the design, implementation and our year-long maintenance experience of SNSAPI, a Python-based middleware which unifies the interfaces and data structures of heterogeneous Social Network-ing Services (SNS). Unlike most prior works, our mid-dleware is user-oriented and requires zero infrastructure support. It enables a user to readily conduct online so-cial activities in a programmable, cross-platform fash-ion while gradually reducing the dependence on central-ized Online Social Networks (OSN). More importantly, as the SNSAPI middleware can be used to support de-centralized social networking services via conventional communication channels such as RSS or Email, it en-ables the deployment of Decentralized Social Networks (DSN) in an incremental, ad hoc manner. To demonstrate the viability of such type of DSNs, we have deployed an experimental 6000-node SNSAPI-based DSN on Plan-etLab and evaluate its performance by replaying traces of online social activities collected from a mainstream OSN. Our results show that, with only mild resource consumption, the SNSAPI-based DSN can achieve ac-ceptable forwarding latency comparable to that of a cen-tralized OSN. We also develop an analytical model to characterize the trade-offs between resource consump-tion and message forwarding delay in our DSN. Via 20 parameterized experiments on PlanetLab, we have found that the empirical measurement results match reasonably with the performance predicted by our analytical model. 1
P2P Social Network with Dynamic Identity-Based Broadcast Encryption Using Rolls
"... Abstract, Recently, Social Network Service (SNS) market is stretch over worldwide, and then there are many security threats by attackers. In addition because sensitive data is concentrated on the central server, Privacy can be exposed to SNS provider as well as malicious users. To overcome this prob ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract, Recently, Social Network Service (SNS) market is stretch over worldwide, and then there are many security threats by attackers. In addition because sensitive data is concentrated on the central server, Privacy can be exposed to SNS provider as well as malicious users. To overcome this problem, many previous researches suggest decentralized system for SNS. In these systems sensitive data may not be stored in central server. When a user transmits a message, the server does not interfere with the process. Thus, the user who transmits a message needs way to message the keys that are used for message encryption scheme. In this paper, we suggest the rolls scheme using dynamic identity-based broadcast encryption. Using this scheme, it is possible to parted a message to many parts, and allow to some users to read special different parts in a message.
