| Anonymity |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| n | We will
model events as consisting of two |
||||||||||||
| components:
the event itself, x, and the identity of |
|||||||||||||
| the agent performing the event, a |
|||||||||||||
| a.x |
|||||||||||||
| n | AnUsers: the users who want to remain secret |
||||||||||||
| n | нGiven x, defineннннн A = { a.x |
a e AnUsers } |
||||||||||||
| n | Definition: A protocol described as a CSP |
||||||||||||
| system
P provides anonymity if an arbitrary |
|||||||||||||
| permutation
of the events in A, applied to all |
|||||||||||||
| the
traces of P, does not alter the set of all |
|||||||||||||
| possible
traces of P |
|||||||||||||
