POSN: A Personal Online Social Network

Erdin, Esra; Klukovich, Eric; Gunduz, Gurhan; Güneş, Mehmet Hadi

doi:10.1007/978-3-319-18467-8_4

Cited by 6 publications

(4 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast, our approach has a number of encryption operation, which is upper-bounded by the height of the LKH tree (h) and each node has only one symmetric key. Cachet employs [6] 0.00082 0.41066 0.41107 LotusNet [24] 0.16 0.16 160.0004 Cachet [8] 155 87 87 LifeSocial [7] 0 160.0004 160.0004 POSN [32] 0.16041 160 0.00082 Vegas [33] 0 160.0004 160.0004 DIBBE [11] ---DECLKH [34] 0.085595 0.02432 0.00082 encryption scheme based on ABE, where ecryption/decryption cost are quite expensive with respect standard symmetric encryption and it depends on the number of attributes [41].…”

Section: Related Work and Comparisonmentioning

confidence: 99%

“…When access to a group is revoked, the affected user is removed from the access control list and the m contents will be encrypted with a new symmetric key which is securely distributed to the n current users of the group by using their public keys. Authors of [32] propose POSN: a DOSN exploiting the resources of the users' mobile devices and the storage clouds to distribute encrypted users' contents. Every user has an individual (RSA) public key, which is exchanged at the time Laura Ricci Laura Ricci is a Professor of the Department of Computer Science, University of Pisa where she has taught several courses in the area of Computer Networks.…”

mentioning

confidence: 99%

See 1 more Smart Citation

A Logical Key Hierarchy Based Approach to Preserve Content Privacy in Decentralized Online Social Networks

Salve

Pietro

Mori

et al. 2020

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Distributed Online Social Networks (DOSNs) have been proposed to shift the control over user data from a unique entity, the online social network provider, to the users of the DOSN themselves. In this paper we focus on the problem of preserving the privacy of the contents shared to large groups of users. In general, content privacy is enforced by encrypting the content, having only authorized parties being able to decrypt it. When efficiency has to be taken into account, new solutions have to be devised that: i) minimize the re-encryption of the contents published in a group when the composition of the group changes; and, ii) enable a fast distribution of the cryptographic keys to all the members (n) of a group, each time a set of users is removed from or added to the group by the group owner. Current solutions fall short in meeting the above criteria, while our approach requires only O(d • log d (n)) encryption operations when a user is removed from a group (where d is an input parameter of the system), and O(2 • log d (n)) when a user joins the group. The effectiveness of our approach is evaluated through simulations based on a real online social network.

show abstract

Section: Related Work and Comparisonmentioning

confidence: 99%

mentioning

confidence: 99%

A Logical Key Hierarchy Based Approach to Preserve Content Privacy in Decentralized Online Social Networks

Salve

Pietro

Mori

et al. 2020

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

show abstract

“…We begin our discussion with server-based solutions. These solutions typically assume that each user has a (web-)server-which can also be hosted in a cloud environment-available to store and retrieve her data [22][23][24][25][26][27][28][29], as shown in Figure 3. The approaches differ in that the servers can either be operated by users themselves, contributed in an altruistic fashion, or supplied by commercial providers.…”

Section: Server-based Solutionsmentioning

confidence: 99%

“…POSN [29]: As a more recent approach, POSN is similar to Vis-à-Vis. User data is stored exclusively on cloud services, while users mainly interact Figure 4: A decentralized OSN that exploits user cooperation replaces the cloud infrastructure with a distributed overlay (bottom layer).…”

Section: Commercial Cloud Storagementioning

confidence: 99%

The Good Left Undone: Advances and Challenges in Decentralizing Online Social Networks

Koll

2017

Computer Communications

View full text Add to dashboard Cite

Billions of users are now interconnected in Online Social Networks (OSNs) and, as they interact with each other, massive amounts of potentially private data are collected at the OSN providers' (e.g., Facebook or Twitter) premises. Unfortunately, provider-initiated privacy violations on this data are frequent and there is little chance that the providers will grant users effective dataprotection means. To address these issues and to help users regain the control over their data, decentralized OSNs (DOSNs) have lately been introduced as a competitive paradigm to provider-controlled, centralized OSNs. DOSNs are built to function without the participation of a provider and with the intent to prevent any misuse of private user data. However, all proposed DOSNs still lack widespread adoption. While challenging the market-leading OSNs is difficult for many reasons, in this paper, we set out to understand the technical deficiencies behind the absence of a successful DOSN. We focus on the major technical challenge of DOSNs: they need to substitute the datacenter-based infrastructure of centralized OSNs. We first review recent advances in decentralizing OSNs based on how they approach that challenge. In a next step, we analyze the advantages and disadvantages each approach yields, and then derive a series of challenges that a successful DOSN will have to fulfill. Finally, we discuss options of moving forward in designing a new DOSN that could be successful in doing so.

show abstract