Results 1 -
5 of
5
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
Virtual private social networks
- In CODASPY
, 2011
"... Social Networking Sites (SNSs) are having a significant im-pact on the social life of many people—even beyond the mil-lions of people that use them directly. These websites usu-ally allow users to present a profile of themselves through a long list of very detailed information. However, even when su ..."
Abstract
-
Cited by 12 (1 self)
- Add to MetaCart
(Show Context)
Social Networking Sites (SNSs) are having a significant im-pact on the social life of many people—even beyond the mil-lions of people that use them directly. These websites usu-ally allow users to present a profile of themselves through a long list of very detailed information. However, even when such SNSs have advanced privacy policies, users are often not aware of their settings and, on top of that, users can-not abstain from sharing a minimum set of information (e.g. name and location). Such a small set of information has been proven to be enough to completely re-identify a user [22, 25]. In this work we introduce the concept of Virtual Private Social Networks (VPSNs), a concept inspired by the one of Virtual Private Networks in traditional computer networks. We argue that VPSNs can mitigate the privacy issues of SNSs, building private social networks that leverage archi-tecture publicly available for SNSs. Furthermore, we pro-pose FaceVPSN, which is an implementation of VPSNs for Facebook, one of the most used SNSs. FaceVPSN is the first privacy threats mitigation solution that has a light and com-pletely distributed architecture—no coordinator is required. Furthermore, it can be implemented without any particular collaboration from the SNS platform. Finally, experimental evaluation shows that FaceVPSN adds a limited overhead, which, we argue, is acceptable for the user.
Computing in Social Networks
"... Abstract. This paper defines the problem of Scalable Secure Computing in a Social network: we call it the S 3 problem. In short, nodes, directly reflecting on associated users, need to compute a function f: V → U of their inputs in a set of constant size, in a scalable and secure way. Scalability me ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(Show Context)
Abstract. This paper defines the problem of Scalable Secure Computing in a Social network: we call it the S 3 problem. In short, nodes, directly reflecting on associated users, need to compute a function f: V → U of their inputs in a set of constant size, in a scalable and secure way. Scalability means that the message and computational complexity of the distributed computation is at most O ( √ n · polylog n). Security encompasses (1) accuracy and (2) privacy: accuracy holds when the distance from the output to the ideal result is negligible with respect to the maximum distance between any two possible results; privacy is characterized by how the information disclosed by the computation helps faulty nodes infer inputs of non-faulty nodes. We present AG-S3, a protocol that S 3-computes a class of aggregation functions, that is that can be expressed as a commutative monoid operation on U: f(x1,...,xn) =x1 ⊕ ·· · ⊕ xn, assuming the number of faulty participants is at most √ n / log 2 n. Key to our protocol is a dedicated overlay structure that enables secret sharing and distributed verifications which leverage the social aspect of the network: nodes care about their reputation and do not want to be tagged as misbehaving. 1
Secret sharing in the encrypted domain
- Proceedings of the 46th IEEE International Conference on Communications - ICC 2011
, 2011
"... Abstract—Secret sharing refers to dividing a secret into pieces or shares and allocating the shares among a group of participants. The secret can be reconstructed only when a sufficient number of shares are combined. To protect each share during secret reconstruction, it is desirable to reconstruct ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract—Secret sharing refers to dividing a secret into pieces or shares and allocating the shares among a group of participants. The secret can be reconstructed only when a sufficient number of shares are combined. To protect each share during secret reconstruction, it is desirable to reconstruct the secret directly from the encrypted shares. A composite algorithm using binary representation and precomputation is developed for efficient exponentiation of encrypted data. A new scheme of secret sharing in the encrypted domain is proposed that makes use of the efficient exponentiation algorithm. Experimental results verify the effectiveness of the efficient exponentiation algorithm and the scheme of secret sharing in the encrypted domain. Index Terms—Secret sharing, encrypted domain processing, information security, probabilistic encryption, homomorphic en-cryption, public key cryptosystem. I.
Chapter 8 Online Social Networks: Status and Trends
"... Abstract. The rapid proliferation of Online Social Network (OSN) sites has made a profound impact on the WWW, which tends to reshape its structure, design, and utility. Industry experts believe that OSNs create a potentially transformational change in consumer behavior and will bring a far-reaching ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. The rapid proliferation of Online Social Network (OSN) sites has made a profound impact on the WWW, which tends to reshape its structure, design, and utility. Industry experts believe that OSNs create a potentially transformational change in consumer behavior and will bring a far-reaching impact on traditional industries of content, media, and communications. This chapter starts out by presenting the current status of OSNs through a taxonomy which delineates the spectrum of attributes that relate to these systems. It also presents an overall reference system architecture that aims at capturing the building blocks of prominent OSNs. Additionally, it pro-vides a state-of-the-art survey of popular OSN systems, examining their ar-chitectural designs and business models. Finally, the chapter explores the future trends of OSN systems, presents significant research challenges and discusses their societal and business impact. 1
