Lilliput: A Storage Service for Lightweight Peer-to-Peer Online Social Networks

Paul, Thomas; Lochschmidt, Niklas; Salah, Hani; Datta, Anwitaman; Strufe, Thorsten

doi:10.1109/icccn.2017.8038443

Cited by 7 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Efforts are rife in literature with the aim of logically decentralizing the functionalities of OSNs and mitigate privacy issues. Based on the literature, decentralized architectures can be implemented using multiple independent and trusted servers [2,13,30]. Some of these efforts used federated architectures as proposed in [26].…”

Section: State-of-the-art In Online Social Network Sensitive Data Promentioning

confidence: 99%

“…The model allows trusted friends to be admitted with continuous security from unsuspecting malicious nodes. The DHT with static replication technique has also been used to secure the storage of static bulk data (videos, photo albums) from their basic profile information or social glue [30]. An ensemble of Encryption, decentralization and direct data exchange has been applied to solve privacy and connectivity problems [33].…”

Section: State-of-the-art In Online Social Network Sensitive Data Promentioning

confidence: 99%

See 1 more Smart Citation

Towards an Architecture-based Ensemble Methods for Online Social Network Sensitive Data Privacy Protection

Idepefo

Akhigbe

Aderibigbe

et al. 2021

Int. J. Recent Contrib. Eng. Sci. IT

View full text Add to dashboard Cite

Abstract - In 2014, the world woke up to a giant data breach that leveraged users’ personal information that was taken from one of the world’s biggest social network platform. Based on the literature, this was possible because of the Centralised Architectural-based Approach to protecting the privacy of users’ online data. Although the literature is inundated with decentralized approaches, there is none to the best of our knowledge that uses an ensemble of methods and draws on a consensus mechanism to address the challenges caused by the Centralised Architectural-based Approach. This paper presents a decentralized approach that adopts and adapts an ensemble of methods. These methods include cryptographic, hashing, and the plenum byzantine fault tolerance algorithms that present a consensus platform, protocol, and mechanism to use the technology of blockchain in a novel manner as a significant contribution. This paper adopts the descriptive approach in its presentation as the usable implementation of the presented proposal is near completion with issues of computational overhead addressed based on preliminary results that show promise of being able to support agreement up to ≈ 75% in terms of making changes by participants in the chain.

show abstract

Section: State-of-the-art In Online Social Network Sensitive Data Promentioning

confidence: 99%

Section: State-of-the-art In Online Social Network Sensitive Data Promentioning

confidence: 99%

Towards an Architecture-based Ensemble Methods for Online Social Network Sensitive Data Privacy Protection

Idepefo

Akhigbe

Aderibigbe

et al. 2021

Int. J. Recent Contrib. Eng. Sci. IT

View full text Add to dashboard Cite

show abstract

“…Lilliput [31] is a replication scheme that separates the storage of static bulk data (videos and photo albums) from the essential social glue (e.g. basic profile information, frequent updates, notifications, and personal messages).…”

Section: Related Workmentioning

confidence: 99%

A Noise-Robust Image Encryption Algorithm Based on Hyper Chaotic Cellular Neural Network

Hu¹,

Yuenyong²,

Qu³

et al. 2018

Journal of Digital Information Management

View full text Add to dashboard Cite

Decentralized Social Networks are proposed to provide more privacy guarantee to the users. They avoid storing data in central servers. The profiles are important and critical objects of this type of network. They are stored in the user's devices. In order to ensure more availability, every profile is replicated in several devices. The different copies of any given profile stored in different devices are correctly updated with all the writes that happened in any single copy. Since the profiles undergo frequent writes, an important network load is generated during the update process. In this paper, we propose an update model based on the use of a log file to store the writ s. This reduces the size of the data exchanged between the devices storing the same profiles. Simulation results show that the proposed model is globally satisfactory.

show abstract

“…However, the two similar behaviors to the mentioned are: peers churn and peers' mobility. This behavior is different than peers churn where peers go completely off the network . It is also different than the mobility of peers where peers move from one location to another.…”

Section: Introductionmentioning

confidence: 99%

“…Further, sharing human digital memories of M4L systems were investigated by explaining the sharing according to different technologies. Web‐based online social networks (WBOSNs) such as Facebook have various issues, for example, the data privacy issues and single point of failure and so on.…”

Section: Introductionmentioning

confidence: 99%

A community‐based social P2P network for sharing human life digital memories

Rahman

Merabti

Llewellyn‐Jones³

et al. 2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Social peer-to-peer (P2P) networks are usually designed by reflecting a user's interest/behavior for structuring the underlying network. Human interest is affected by various factors such as age, locality, and so on which changes after some time. The behavior when reflected in a network, results in peers moving within the network in order to connect the peer with peers of the same behavior/interest. Especially in community-based schemes when a peer leaves a community the data that a peer was sharing will not be accessible in the same community anymore. It has an effect on the performance of the network due to the inaccessibility of data and the unavailability of connections, which affect network robustness. We address this issue by considering entities in data in the form of digital memories of a user and structuring network according to entity-based communities. The simulation results for the proposed entity-based community are demonstrated, which shows the effect on network performance during varying network size and traffic.Abbreviations: EBCs, entity-based communities; IRF, interferon regulatory factor; P2P, peer-to-peer.Trans Emerging Tel Tech. 2020;31:e3866.wileyonlinelibrary.com/journal/ett of the individual, will result in peers moving within the network by disconnecting from some peers and connecting to others. The behavior of peers, that is, moving within a network, which we have identified is a distinct behavior in social P2P networks, which to the best of our knowledge has not been mentioned before. However, the two similar behaviors to the mentioned are: peers churn and peers' mobility. This behavior is different than peers churn where peers go completely off the network. 10,11 It is also different than the mobility of peers where peers move from one location to another. In the problem we identified, peers keep their credentials and location and are not disconnected from the network, which makes it different and distinct than the two issues. Community-based schemes, 12-14 for example, interest-based communities (IBCs) 15,16 are more affected by this behavior because any change in an individual's social network disconnects its peer from the whole community which makes the data inaccessible to all peers of that community. As described earlier that human interest is affected by many factors, which any change in these factors results in a change of a human interest. So, change in the interest of a person, when reflected in a social P2P network results in leaving the community by the peer and joining another community of the new interest. People capture their data using various devices such as camera, mobile phones, etc. which form their digital memories. A memory for life (M4L) system 17 is one of the grand challenges in UK which aims to capture, store, annotate, organize, analyze, and share an individual's digital memories. By analyzing digital memories, an M4L system will identify various entities such as places, people, events, etc. in digital memories and which will further be used to generate meanin...

show abstract

Lilliput: A Storage Service for Lightweight Peer-to-Peer Online Social Networks

Cited by 7 publications

References 21 publications

Towards an Architecture-based Ensemble Methods for Online Social Network Sensitive Data Privacy Protection

Towards an Architecture-based Ensemble Methods for Online Social Network Sensitive Data Privacy Protection

A Noise-Robust Image Encryption Algorithm Based on Hyper Chaotic Cellular Neural Network

A community‐based social P2P network for sharing human life digital memories

Contact Info

Product

Resources

About