Campus Event Calendar
Event Entry
What and Who
Reasoning about trustworthiness of identities in social computing systems
Bimal Viswanath
MMCI
SWS Student Defense Talks - Thesis Proposal
SWS
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 16 January 2015
16:00
60 Minutes
E1 5
029
Saarbrücken
Abstract
The huge popularity of social computing platforms such as Facebook, Google+, Twitter, Yelp and Twitter has attracted rampant forms of service abuse on these platforms. While this degrades a user's experience, service abuse can also have serious economic consequences; click fraud in social ad platforms is a significant concern for advertisers. The main cause for this lack of reliability is the identity infrastructure: in most systems, the users operate behind weak identities that are easy to create. The use of weak identities makes these systems vulnerable to Sybil attacks, where an attacker creates multiple fake (Sybil) identities to manipulate and abuse the system. Thus, the key research challenge is: Given a weak identity-based social computing system, how can we reason about the (un)trustworthiness of identities in the system? In this thesis, I propose various schemes to address this problem.
In this talk, I will first present a high level overview of my thesis research where I will describe the limitations of existing approaches to reason about trust and how my work addresses those limitations. Next, I will present my most recent project "Robust Tamper Detection in Crowd Computations". Popular social computing systems increasingly rely on crowd computing to rate and rank content, users, products and businesses. Today, attackers who create Sybil identities can easily tamper with these computations. Existing defenses that largely focus on detecting individual Sybil identities have a fundamental limitation: Adaptive attackers can create hard-to-detect Sybil identities to tamper arbitrary crowd computations. We propose Stamper, an approach for detecting tampered crowd computations. Stamper gains strength in numbers – we propose statistical analysis techniques that can determine if a large crowd computation has been tampered by Sybils, even when it is fundamentally hard to infer which of the participating identities are Sybil.
In this talk, I will first present a high level overview of my thesis research where I will describe the limitations of existing approaches to reason about trust and how my work addresses those limitations. Next, I will present my most recent project "Robust Tamper Detection in Crowd Computations". Popular social computing systems increasingly rely on crowd computing to rate and rank content, users, products and businesses. Today, attackers who create Sybil identities can easily tamper with these computations. Existing defenses that largely focus on detecting individual Sybil identities have a fundamental limitation: Adaptive attackers can create hard-to-detect Sybil identities to tamper arbitrary crowd computations. We propose Stamper, an approach for detecting tampered crowd computations. Stamper gains strength in numbers – we propose statistical analysis techniques that can determine if a large crowd computation has been tampered by Sybils, even when it is fundamentally hard to infer which of the participating identities are Sybil.
Contact
Maria-Louise Albrecht
--email hidden
Video Broadcast
Yes
Kaiserslautern
G26
112
passcode not visible
logged in users only
Maria-Louise Albrecht, 01/14/2015 14:08 -- Created document.