Trust in Crowds: probabilistic behaviour in anonymity protocols
Trust in Crowds: probabilistic behaviour in anonymity protocols
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.
88-102
Sassone, Vladimiro
df7d3c83-2aa0-4571-be94-9473b07b03e7
El-Salamouny, Ehab
64e904ef-e94d-4fa4-80a2-d363df48a23e
Hamadou, Sardaouna
a3681473-229f-423a-8113-b466cd1b5e98
April 2010
Sassone, Vladimiro
df7d3c83-2aa0-4571-be94-9473b07b03e7
El-Salamouny, Ehab
64e904ef-e94d-4fa4-80a2-d363df48a23e
Hamadou, Sardaouna
a3681473-229f-423a-8113-b466cd1b5e98
Sassone, Vladimiro, El-Salamouny, Ehab and Hamadou, Sardaouna
(2010)
Trust in Crowds: probabilistic behaviour in anonymity protocols.
Symposium on Trustworthy Global Computing, TGC 2010, Lecture Notes in Computer Science 6084.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
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.
Text
crowds-trustTGC.pdf
- Version of Record
More information
Published date: April 2010
Venue - Dates:
Symposium on Trustworthy Global Computing, TGC 2010, Lecture Notes in Computer Science 6084, 2010-04-01
Organisations:
Web & Internet Science
Identifiers
Local EPrints ID: 268594
URI: http://eprints.soton.ac.uk/id/eprint/268594
PURE UUID: a561a106-86e9-4a12-ada3-e085aac6b76c
Catalogue record
Date deposited: 12 Mar 2010 11:28
Last modified: 10 Sep 2024 01:40
Export record
Contributors
Author:
Vladimiro Sassone
Author:
Ehab El-Salamouny
Author:
Sardaouna Hamadou
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics