Probabilistic analysis of an anonymity system

Journal of Computer Security

Volumn 12, Issue 3-4 SPEC. ISS., 2004, Pages 355-377

  Shmatikov, Vitaly ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; MARKOV PROCESSES; NETWORK PROTOCOLS; PROBABILITY; SECURITY OF DATA; SERVERS; WEB BROWSERS;

ANONYMITY SYSTEMS; ASYMPTOTIC PROBABILITIES; MODEL CHECKERS;

WORLD WIDE WEB;

EID: 3042662497     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/jcs-2004-123-403     Document Type: Conference Paper

References (30)

1. R. Alur and T. Henzinger, Reactive modules, in: Proc. 11th Annual IEEE Symposium on Logic in Computer Science (LICS), 1996, pp. 207-218.
2. http://www.anonymizer.com.
3. C. Baier, On algorithmic verification methods for probabilistic systems, Fakultät für Mathematik & Informatik, Universität Mannheim, 1998.
4. A. Bianco and L. de Alfaro, Model checking of probabilistic and nondeterministic systems, in: Proc. Foundations of Software Technology and Theoretical Computer Science (FST & TCS), Volume 1026 of LNCS. Springer-Verlag, 1995, pp. 499-513.
5. C. Baier and M. Kwiatkowska, Model checking for a probabilistic branching time logic with fairness, Distributed Computing 11(3) (1998), 125-155.
6. R. Canetti, A unified framework for analyzing security of protocols, IACR Cryptology ePrint Archive 2000/067 (http://eprint.iacr.org), December 2000.
7. D. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM 24(2) (1981), 84-88.
8. E.M. Clarke, S. Jha and W. Marrero, Verifying security protocols with Brutus, ACM Transactions in Software Engineering Methodology 9(4) (2000), 443-487.
9. I. Clarke, O. Sandberg, B. Wiley and T.W. Hong, Freenet: A distributed anonymous information storage and retrieval system, in: Proc. International Workshop on Design Issues in Anonymity and Unobservability, Volume 2009 of LNCS, Springer-Verlag, 2001, pp. 46-66.
10. D. Dolev and A. Yao, On the security of public key protocols, IEEE Transactions on Information Theory 29(2) (1983), 198-208.
11. J.W. Gray, Toward a mathematical foundation for information flow security, J. Computer Security 1(3) (1992), 255-294.
12. H. Hansson and B. Jonsson, A logic for reasoning about time and probability, Formal Aspects of Computing 6(5) (1994), 512-535.
13. S. Hart and M. Shark, Probabilistic temporal logics for finite and bounded models, in: Proc. ACM Symposium on the Theory of Computing (STOC), 1984, pp. 1-13.
14. M. Kwiatkowska, G. Norman and D. Parker, PRISM: Probabilistic symbolic model checker, Technical Report 760/2001, University of Dortmund, September 2001. Also in: Proc. PAPM/PROBMIV 2001 Tools Session.
15. M. Kwiatkowska, G. Norman and D. Parker, PRISM: Probabilistic symbolic model checker, Technical Report 760/2001, University of Dortmund, September 2001. Also in: Proc. PAPM/PROBMIV 2001 Tools Session.
16. P. Lincoln, J.C. Mitchell, M. Mitchell and A. Scedrov, Probabilistic polynomial-time equivalence and security analysis, in: Proc. World Congress on Formal Methods, Volume 1708 of LNCS, Springer-Verlag, 1999, pp. 776-793.
17. G. Lowe, Breaking and fixing the Needham-Schroeder public-key protocol using FOR, in: Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Volume 1055 of LNCS, Springer-Verlag, 1996, pp. 147-166.
18. D. Lehmann and S. Shelah, Reasoning with time and chance, Information and Control 53(3) (1982), 165-198.
19. D. Malkhi, Private communication, 2001.
20. J.C. Mitchell, M. Mitchell and U. Stern, Automated analysis of cryptographic protocols using Murφ, in: Proc. IEEE Symposium on Security and Privacy, 1997, pp. 141-153.
21. L. Paulson, The inductive approach to verifying cryptographic protocols, J. Computer Security 6(1) (1998), 85-128.
22. M. Reiter and A. Rubin, Crowds: Anonymity for web transactions, ACM Transactions on Information and System Security 1(1) (1998), 66-92.
23. P. Syverson and J.W. Gray, The epistemic representation of information flow security in probabilistic systems, in: Proc. 8th IEEE Computer Security Foundations Workshop, 1995, pp. 152-166.
24. P. Syverson, D. Goldschlag and M. Reed, Anonymous connections and onion routing, in: Proc. IEEE Symposium on Security and Privacy, 1997, pp. 44-54.
25. V. Shmatikov, Probabilistic analysis of anonymity, in: Proc. 15th IEEE Computer Security Foundations Workshop, 2002, pp. 119-128.
26. S. Schneider and A. Sidiroupoulos, CSP and anonymity, in: Proc. ESORICS, Volume 1146 of LNCS, Springer-Verlag, 1996, pp. 198-218.
27. P. Syverson and S. Stubblebine, Group principals and the formalization of anonymity, in: Proc. World Congress on Formal Methods, Volume 1708 of LNCS, Springer-Verlag, 1999, pp. 814-833.
28. M. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in: Proc. 26th IEEE Symposium on Foundations of Computer Science (FOCS), 1985, pp. 327-338.
29. D. Volpano and G. Smith, Probabilistic non-interference in a concurrent language, in: Proc. 11th IEEE Computer Security Foundations Workshop, 1998, pp. 34-43.
30. M. Wright, M. Adler, B.N. Levine and C. Shields, An analysis of the degradation of anonymous protocols, in: Proc. ISOC Network and Distributed System Security Symposium (NDSS), 2002.