A Decentralized Online Social Network with Efficient User-Driven Replication

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI:10.1109/SocialCom-PASSAT.2012.127

Rammohan Narendula, Thanasis G. Papaioannou, K. Aberer

{"title":"A Decentralized Online Social Network with Efficient User-Driven Replication","authors":"Rammohan Narendula, Thanasis G. Papaioannou, K. Aberer","doi":"10.1109/SocialCom-PASSAT.2012.127","DOIUrl":null,"url":null,"abstract":"Unprecedented growth of online social networks (OSNs) increasingly makes privacy advocates and government agencies worrisome alike. In this paper, we propose My3, a privacy-friendly decentralized alternative for online social networking. The My3 system exploits well-known interesting properties of the current online social networks in its novel design namely, locality of access, predictable access times, geolocalization of friends, unique access requirements of the social content, and implicit trust among friends. It allows users to exercise finer granular access control on the content, thus making My3 extremely privacy-preserving. Moreover, we propose different replication strategies that users may independently choose for meeting their personalized performance objectives. A detailed performance study evaluates the system regarding profile availability, access delay, freshness and storage load. By using real-world data traces, we prove that My3 offers high availability even with low average online time of users in the network.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SocialCom-PASSAT.2012.127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 34

Abstract

Unprecedented growth of online social networks (OSNs) increasingly makes privacy advocates and government agencies worrisome alike. In this paper, we propose My3, a privacy-friendly decentralized alternative for online social networking. The My3 system exploits well-known interesting properties of the current online social networks in its novel design namely, locality of access, predictable access times, geolocalization of friends, unique access requirements of the social content, and implicit trust among friends. It allows users to exercise finer granular access control on the content, thus making My3 extremely privacy-preserving. Moreover, we propose different replication strategies that users may independently choose for meeting their personalized performance objectives. A detailed performance study evaluates the system regarding profile availability, access delay, freshness and storage load. By using real-world data traces, we prove that My3 offers high availability even with low average online time of users in the network.

查看原文本刊更多论文

一个分散的在线社交网络，具有高效的用户驱动复制

在线社交网络(OSNs)的空前增长越来越让隐私倡导者和政府机构感到担忧。在本文中，我们提出了My3，一个隐私友好的分散的在线社交网络替代方案。My3系统在其新颖的设计中利用了当前在线社交网络中众所周知的有趣特性，即访问的局地性、可预测的访问时间、朋友的地理定位、社交内容的独特访问要求以及朋友之间的隐性信任。它允许用户对内容进行更细粒度的访问控制，从而使My3非常保护隐私。此外，我们提出了不同的复制策略，用户可以独立选择，以满足他们个性化的性能目标。详细的性能研究评估了系统关于配置文件的可用性，访问延迟，新鲜度和存储负载。通过使用真实世界的数据跟踪，我们证明了My3即使在网络中用户的平均在线时间较低的情况下也具有高可用性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing

自引率

0.00%

发文量