Anonymous opinion exchange over untrusted social networks

Kacimi, Mouna; Ortolani, Stefano; Crispo, Bruno

doi:10.1145/1578002.1578007

Cited by 10 publications

(17 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Golbeck [2009] investigates profiles similarity and how those relate to the way users determine trust, hence their willingness to share private information. Kacimi et al [2009] present a privacy protocol allowing anonymous opinion exchanges over untrusted SNSs. Korolova et al [2008] investigate the number of user accounts needed to be compromised to rebuild the entire social graph.…”

Section: Related Workmentioning

confidence: 99%

Virtual private social networks and a facebook implementation

2013

Self Cite

View full text Add to dashboard Cite

The popularity of Social Networking Sites (SNS) is growing rapidly, with the largest sites serving hundreds of millions of users and their private information. The privacy settings of these SNSs do not allow the user to avoid sharing some information (e.g., name and profile picture) with all the other users. Also, no matter the privacy settings, this information is always shared with the SNS (that could sell this information or be hacked). To mitigate these threats, we recently introduced the concept of Virtual Private Social Networks (VPSNs).In this work we propose the first complete architecture and implementation of VPSNs for Facebook. In particular, we address an important problem left unexplored in our previous research-that is the automatic propagation of updated profiles to all the members of the same VPSN. Furthermore, we made an in-depth study on performance and implemented several optimization to reduce the impact of VPSN on user experience.The proposed solution is lightweight, completely distributed, does not depend on the collaboration from Facebook, does not have a central point of failure, it offers (with some limitations) the same functionality as Facebook, and apart from some simple settings, the solution is almost transparent to the user. Thorough experiments, with an extended set of parameters, we have confirmed the feasibility of the proposal and have shown a very limited time-overhead experienced by the user while browsing Facebook pages. ACM Reference Format:Conti, M., Hasani, A., and Crispo, B. 2013. Virtual private social networks and a Facebook implementation.

show abstract

Section: Related Workmentioning

confidence: 99%

Virtual private social networks and a facebook implementation

2013

Self Cite

View full text Add to dashboard Cite

show abstract

“…4). This feature of ad hoc networks allows us to support our privacy requirements by creating an element of anonymity or plausible deniability for question askers and answerers, in a similar fashion to the work on crowds (Reiter andRubin 1998), Freenet Clarke et al (2001) and the network of Kacimi et al (2009), whereby the complete path of the route of a particular question or answer is not known by any one node in the network and therefore the exact author of a specific question or answer is plausibly deniable (see below for an outline of the model). In order for such mechanisms to work, we use a uniform random topology for the network graph (C n;N , where n is the number of nodes and N is the number of links) based on the Erd} os and Rényi random graph model.…”

Section: User Privacy: Plausible Deniabilitymentioning

confidence: 99%

“…They also do not follow privacy considerations between asker and answers, nor do they investigate stigmergic techniques to solving this problem. Finally, Kacimi et al (2009) investigate anonymous opinion routing through social networks. They too use single hop routing tactics to mask the source of a message, however they do not consider the direction of the routing nor the quality of the users, and instead, simply look at accumulating opinions from a source statement.…”

Section: Related Workmentioning

confidence: 99%

A deniable and efficient question and answer service over ad hoc social networks

2012

View full text Add to dashboard Cite

When people are connected together over ad hoc social networks, it is possible to ask questions and retrieve answers using the wisdom of the crowd. However, locating a suitable candidate for answering a specific unique question within larger ad hoc groups is non-trivial, especially if we wish to respect the privacy of users by providing deniability. All members of the network wish to source the best possible answers from the network, while at the same time controlling the levels of attention required to generate them by the collective group of individuals and/or the time taken to read all the answers. Conventional expert retrieval approaches rank users for a given query in a centralised indexing process, associating users with material they have previously published. Such an approach is antithetical to privacy, so we have looked to distribute the routing of questions and answers, converting the indexing process into one of building a forwarding table. Starting from the simple operation of flooding the question to everyone, we compare a number of different routing options, where decisions must be made based on past performance and exploitation of the knowledge of our immediate neighbours. We focus on fully decentralised protocols using ant-inspired tactics to route questions towards members of the network who may be able to answer them well. Simultaneously, privacy concerns are acknowledged by allowing both question asking and answering to be plausibly deniable. We have found that via our routing method, it is possible to improve answer quality and also reduce the total amount of user attention required to generate those answers.

show abstract

“…The new technologies may also have a number of benefits for health care professionals [15]. First, they may support professional development and marketing efforts.…”

Section: Benefits For Providers and Insurersmentioning

confidence: 99%

“…Although informal networking was supported by the early World Wide Web, social networking sites are explicitly designed around group and network formation. In this setting, social networks form as users create links to one another, typically on the basis of offline relationships or shared interests and hobbies [15].…”

Section: Modeling Social Networking Applicationsmentioning

confidence: 99%

Social networking applications in health care

Williams

2010

Proceedings of the 2010 ICSE Workshop on Software Engineering in Health Care

View full text Add to dashboard Cite

The advent of social networking websites for use in health care has prompted concerns about the risks that such systems pose to the security and privacy of personal health information. In this paper, we survey the research literature, in order to provide a current snapshot of privacy and security safeguards for social network websites. We describe some of the unique features of the health care space, and recommend directions for future research in this relatively new area.

show abstract

Anonymous opinion exchange over untrusted social networks

Cited by 10 publications

References 18 publications

Virtual private social networks and a facebook implementation

Virtual private social networks and a facebook implementation

A deniable and efficient question and answer service over ad hoc social networks

Social networking applications in health care

Contact Info

Product

Resources

About