Sunday, December 9, 2007

Trust Bootstrapping: TRULLO @ Mobiquitous

At Mobiquitous 2007, we presented TRULLO. Here are the slides (some animations do not work properly in slideshare, sorry). A brief description follows.



Situation: Using mobile devices, such as smart phones, people may create and distribute different types of digital content (e.g., photos, videos). One of the problems is that digital content, being easy to create and replicate, may likely swamp users rather than informing them. To avoid that, users may run trust models on their mobile devices. A trust model is a piece of software that keeps track of who provides quality content and who does not.

Problem: Devices should be able to set their initial trust for other devices. One way of doing so is for devices to learn from their own past experiences. To see how, consider the following quotes about human trust: ``We may initially trust or not trust those involved on our projects based on past experience'', and ``If your boyfriend is unfaithful, you won't initially trust the next man you date'' :-) Algorithms that model human trust on pervasive devices, one might say, ought to do the same thing - they should assign their initial trust upon `similar' past experiences.

Existing Solutions: Existing solutions usually require an ontology upon which they decide which past experiences are similar, and, in so doing, they require both that the same ontology is shared by all users (which is hardly the case in reality) and that users agree on that ontology for good (ie, the ontology is not supposed to change over time) :-(

Proposal: TRULLO gathers ratings of past experiences in a matrix, learns staticial "features" from that matrix, and combines those features to set initial trust values. It works quite well in a simulated antique market and its implementation is reasonably fast on a Nokia mobile phone.

Future: TRULLO does not work if one does not have past experiences. That is why we will propose a distributed trust propadation algorithm (pdf)

No comments: