Name
Abstract | ||
|---|---|---|
Abstract. Ballot stung,is the process of illegitimately creating a good reputation and requires a number,of colluding fraudsters. With the use of an anonymising network, a single user could pose as many separate users and possibly implement the ballot stung,scheme without the complexities of managing,multiple fraudsters. In this paper we propose a framework that deals with thwarting ballot stung,within the context of anonymising networks. The framework proposed depends on the ability to look up a single user’s physical location with a fair degree of certainty. With this mechanism in place, the framework is able to compare the locations of all users involved in a transaction. If the coordinates are within close proximity to one another (this is unlikely in a global trading system) then the transaction is tagged accordingly. The framework,proposed does not necessarily apply to only thwarting ballot stung,schemes, we discuss the fundamental problem of using anonymising networks to commit ballot stung,and analyse another scheme (ticket scalping) that may be thwarted with this framework. |
Year | Venue | Field |
|---|---|---|
2006 | ISSA | Internet privacy,Certainty,Computer security,Computer science,Scalping,Commit,Ticket,Ballot,Database transaction,Reputation |
DocType | Citations | PageRank |
Conference | 2 | 0.38 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wesley Brandi | 1 | 4 | 2.53 |
| Martin S. Olivier | 2 | 465 | 73.94 |