Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
The ant colony optimization meta-heuristic
New ideas in optimization
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
The free haven project: distributed anonymous storage service
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Probabilistic Asynchronous pi-Calculus
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
The Mobility Workbench - A Tool for the pi-Calculus
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
ARA - The Ant-Colony Based Routing Algorithm for MANETs
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
CONCUR 2005 - Concurrency Theory
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Securing anonymity in P2P network
Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
A survey of anonymous peer-to-peer file-sharing
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Analysis of an electronic voting protocol in the applied pi calculus
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Analyzing an Electronic Cash Protocol Using Applied Pi Calculus
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Knowledge Aware Bisimulation and Anonymity
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Measuring Anonymous Systems with the Probabilistic Applied Pi Calculus
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Probabilistic anonymity via coalgebraic simulations
Theoretical Computer Science
A framework for automatically checking anonymity with µCRL
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
| Hi-index | 0.00 |
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 bi-simulation 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.