12.12.2012 Views

Lecture Notes in Computer Science 5185

Lecture Notes in Computer Science 5185

Lecture Notes in Computer Science 5185

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

72 F. P<strong>in</strong>gel and S. Ste<strong>in</strong>brecher<br />

Unl<strong>in</strong>kability of rat<strong>in</strong>gs and actions: Users want their rat<strong>in</strong>gs and actions<br />

to be unl<strong>in</strong>kable. Otherwise behaviour profiles of pseudonyms could be built.<br />

If the pseudonym becomes l<strong>in</strong>ked to a real name, as it often does <strong>in</strong> a reputation<br />

network, the profile becomes related to this real name as well.<br />

Anonymity of users: Users want to <strong>in</strong>form themselves anonymously about<br />

others’ reputation to prevent behaviour profiles of their possible <strong>in</strong>terests.<br />

Authorisability of <strong>in</strong>teractions, rat<strong>in</strong>gs and reputation computation:<br />

Interactions should only take place between authorised members. Rat<strong>in</strong>gs<br />

should only be given by members if an <strong>in</strong>teraction took place between them.<br />

Confidentiality of <strong>in</strong>teractions, rat<strong>in</strong>gs and reputations: Though a reputation<br />

system’s functional requirement is to collect rat<strong>in</strong>gs, the aggregated<br />

reputation should only be obta<strong>in</strong>able by members. Concrete users also might<br />

want only a subset of other members to know their rat<strong>in</strong>gs and reputation.<br />

There exist countless models to design possible rat<strong>in</strong>gs and the reputation<br />

computation algorithm [8]. As outl<strong>in</strong>ed <strong>in</strong> [6] the follow<strong>in</strong>g requirements hold:<br />

Accuracy of the reputation computation algorithm: The reputation<br />

computation algorithm has to consider all rat<strong>in</strong>gs given. This should also<br />

consider long-term performance. Other aspects <strong>in</strong>clude solicit<strong>in</strong>g rat<strong>in</strong>gs,<br />

but also educ<strong>in</strong>g hidden one (e.g. lack of rat<strong>in</strong>g). It should be possible to<br />

dist<strong>in</strong>guish between newcomers and users with bad reputation.<br />

Trustworth<strong>in</strong>ess of the raters: Exist<strong>in</strong>g social networks, and weight<strong>in</strong>g recommendations<br />

accord<strong>in</strong>g to the trustworth<strong>in</strong>ess of the raters should be used<br />

to scale the reputation computation algorithm to the needs of the one who<br />

wants to <strong>in</strong>form himself about others’ reputation.<br />

Self-correction: If a user agrees not or no longer with certa<strong>in</strong> rat<strong>in</strong>gs for a<br />

certa<strong>in</strong> reputation object, he should correct both the trust values for the<br />

correspond<strong>in</strong>g raters <strong>in</strong> the reputation computation algorithm and the reputation<br />

of the reputation object.<br />

These requirements show the need for <strong>in</strong>dividual reputation <strong>in</strong> contrast to the<br />

common concept of global reputation. Due to the need of multilateral secucurity<br />

we also favoured global repuation and had to neglect the last two requirements<br />

above to reach anonymity and unl<strong>in</strong>kability of the uders <strong>in</strong>volved.<br />

2.2 Cross-Community Reputation Management<br />

With the help of cross-community reputation a significant reputation can be<br />

built up easily <strong>in</strong> short time even <strong>in</strong> very small communities.<br />

The reputation system should be <strong>in</strong>dependent from the communities the reputation<br />

it aggregates s used for. The reputation system provides the communication<br />

protocols necessary. But it might offer the communities the possibility to<br />

def<strong>in</strong>e their own reputation computation algorithm that should be used by the<br />

reputation system. In practice this will mean that the reputation visible <strong>in</strong> the<br />

communities will differ. For this reason the rat<strong>in</strong>gs given should consist of

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!