Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Verifying security protocols with Brutus
ACM Transactions on Software Engineering and Methodology (TOSEM)
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Probabilistic Polynomial-Time Equivalence and Security Analysis
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Group Principals and the Formalization of Anonymity
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The epistemic representation of information flow security in probabilistic systems
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Probabilistic Noninterference in a Concurrent Language
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Repudiative information retrieval
Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society
Defending Anonymous Communications Against Passive Logging Attacks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
The predecessor attack: An analysis of a threat to anonymous communications systems
ACM Transactions on Information and System Security (TISSEC)
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Theoretical Computer Science - Automated reasoning for security protocol analysis
Formal analysis of PIN block attacks
Theoretical Computer Science - Automated reasoning for security protocol analysis
Probabilistic analysis of an anonymity system
Journal of Computer Security - Special issue on CSFW15
Passive-Logging Attacks Against Anonymous Communications Systems
ACM Transactions on Information and System Security (TISSEC)
Anonymity protocols as noisy channels
Information and Computation
A survey of state-of-the-art in anonymity metrics
Proceedings of the 1st ACM workshop on Network data anonymization
Survey on anonymity in unstructured peer-to-peer systems
Journal of Computer Science and Technology
Verifying privacy-type properties of electronic voting protocols
Journal of Computer Security
A privacy-enabled architecture for an RFID-based location monitoring system
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
Survey on anonymous communications in computer networks
Computer Communications
ESOP'03 Proceedings of the 12th European conference on Programming
Anonymity analysis of P2P anonymous communication systems
Computer Communications
Proceedings of the 11th international conference on Security Protocols
A survey of anonymous peer-to-peer file-sharing
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
Compulsion resistant anonymous communications
IH'05 Proceedings of the 7th international conference on Information Hiding
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
The dangers of composing anonymous channels
IH'12 Proceedings of the 14th international conference on Information Hiding
Preface to the special issue on Probabilistic Model Checking
Formal Methods in System Design
| Hi-index | 0.00 |
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of group members and the adversary is modeled as a discrete-time Markov chain, and security properties are expressed as PCTL formulas. To illustrate feasibility of the approach, we model the Crowds system for anonymous Web browsing, and use a probabilistic model checker, PRISM, to perform automated analysis of the system and verify anonymity guarantees itprovides. The main result of the Crowds analysis is a demonstration of how certain forms of anonymity degrade with the increase in group size and the number of random routing paths.