DMCA
Analysing the Mute Anonymous File-Sharing System Using the Pi-calculus, in "26th IFIP WG 6.1 international conference on formal techniques for networked and distributed systems (2006)
| Venue: | Lecture Notes in Computer Science, n o 4229 |
| Citations: | 9 - 3 self |
BibTeX
@INPROCEEDINGS{Chothia06analysingthe,
author = {Tom Chothia},
title = {Analysing the Mute Anonymous File-Sharing System Using the Pi-calculus, in "26th IFIP WG 6.1 international conference on formal techniques for networked and distributed systems},
booktitle = {Lecture Notes in Computer Science, n o 4229},
year = {2006},
pages = {115--130},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. This paper gives details of a formal analysis of the MUTE system for anonymous file-sharing. We build pi-calculus models of a node that is innocent of sharing files, a node that is guilty of file-sharing and of the network environment. We then test to see if an attacker can distinguish between a connection to a guilty node and a connection to an innocent node. A weak bi-simulation between every guilty network and an innocent network would be required to show possible innocence. We find that such a bi-simulation cannot exist. The point at which the bisimulation fails leads directly to a previously undiscovered attack on MUTE. We describe a fix for the MUTE system that involves using authentication keys as the nodes ’ pseudo identities and give details of its addition to the MUTE system. 1
Keyphrases
international conference ifip wg mute anonymous file-sharing system formal technique distributed system mute system pi-calculus model guilty network formal analysis authentication key possible innocence bi-simulation cannot innocent node innocent network network environment guilty node undiscovered attack weak bi-simulation
