Trust in Crowds: probabilistic behaviour in anonymity protocols
Sassone, Vladimiro, El-Salamouny, Ehab and Hamadou, Sardaouna (2010) Trust in Crowds: probabilistic behaviour in anonymity protocols. In, Symposium on Trustworthy Global Computing, TGC 2010, Lecture Notes in Computer Science 6084 LNCS, Springer, 88-102.
- Published Version
The existing analysis of the Crowds anonymity protocol assumes that a participating member is either ‘honest’ or ‘corrupted’. This paper generalises this analysis so that each member is assumed to maliciously disclose the identity of other nodes with a probability determined by her vulnerability to corruption. Within this model, the trust in a principal is defined to be the probability that she behaves honestly. We investigate the effect of such a probabilistic behaviour on the anonymity of the principals participating in the protocol, and formulate the necessary conditions to achieve ‘probable innocence’. Using these conditions, we propose a generalised Crowds-Trust protocol which uses trust information to achieves ‘probable innocence’ for principals exhibiting probabilistic behaviour.
|Item Type:||Conference or Workshop Item (Paper)|
|Divisions:||Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
|Date Deposited:||12 Mar 2010 11:28|
|Last Modified:||27 May 2013 01:20|
|Contributors:||Sassone, Vladimiro (Author)
El-Salamouny, Ehab (Author)
Hamadou, Sardaouna (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||0|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)