Probable innocence revisited

Theoretical Computer Science

Volumn 367, Issue 1-2, 2006, Pages 123-138

  Chatzikokolakis, Konstantinos ^a   Palamidessi, Catuscia ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Anonymity; Crowds; Nondeterminism; Probability; Probable innocence

Indexed keywords

COMPUTER SCIENCE; CONSTRAINT THEORY; PROBABILISTIC LOGICS; PROBABILITY; SECURITY OF DATA;

CROWDS; PROBABILISTIC ANONYMITY; PROBABLE INNOCENCE; PROTOCOL COMPOSITION; SYMMETRY ASSUMPTIONS;

NETWORK PROTOCOLS;

EID: 33750488738     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.08.033     Document Type: Article

References (24)

1. Berthold O., Federrath H., and Köpsell S. Web mixes: A system for anonymous and unobservable internet access. Designing Privacy Enhancing Technologies, Internat. Workshop on Design Issues in Anonymity and Unobservability, Lecture Notes in Computer Science Vol. 2009 (2000), Springer, Berlin 115-129
2. Bhargava M., and Palamidessi C. Probabilistic anonymity. In: Abadi M., and de Alfaro L. (Eds). Proc. CONCUR 2005, Lecture Notes in Computer Science Vol. 3653 (2005), Springer, Berlin 171-185
3. Chaum D. The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptology 1 (1988) 65-75
4. Clarke I., Sandberg O., Wiley B., and Hong T.W. Freenet: a distributed anonymous information storage and retrieval system. Designing Privacy Enhancing Technologies, Internat. Workshop on Design Issues in Anonymity and Unobservability, Lecture Notes in Computer Science Vol. 2009 (2000), Springer, Berlin 44-66
5. Y. Deng, C. Palamidessi, J. Pang, Weak probabilistic anonymity, in: Proc. of the International Workshop on Security Issues in Concurrency (SecCo), 2005. Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers, 2005, to appear.
6. C. Díaz, S. Seys, J. Claessens, B. Preneel, Towards measuring anonymity, in: Proc. of the International Workshop on Privacy Enhancing Technologies (PET), Lecture Notes in Computer Science, Vol. 2482, Springer, 2002. pp. 54-68.
7. Dingledine R., Freedman M.J., and Molnar D. The free haven project: distributed anonymous storage service. Designing Privacy Enhancing Technologies, Internat. Workshop on Design Issues in Anonymity and Unobservability, Lecture Notes in Computer Science Vol. 2009 (2000), Springer, Berlin 67-95
8. A.V. Evfimievski, J. Gehrke, R. Srikant, Limiting privacy breaches in privacy preserving data mining, in: Proc. PODS 2003, 2003, pp. 211-222.
9. J.Y. Halpern, K.R. O'Neill, Anonymity and information hiding in multiagent systems, in: Proc. 16th IEEE Computer Security Foundations Workshop, 2003, pp. 75-88.
10. J.Y. Halpern, K.R. O'Neill, Anonymity and information hiding in multiagent systems, J. Comput. Security 13 (3) (2005) 483-512.
11. Herescu O.M., and Palamidessi C. Probabilistic asynchronous π-calculus. In: Tiuryn J. (Ed). Proc. FOSSACS 2000 (Part of ETAPS 2000), Lecture Notes in Computer Science Vol. 1784 (2000), Springer, Berlin 146-160
12. Hughes D., and Shmatikov V. Information hiding, anonymity and privacy: a modular approach. J. Comput. Security 12 1 (2004) 3-36
13. M.Z. Kwiatkowska, G. Norman, D. Parker, PRISM 2.0: a tool for probabilistic model checking, in: Proc. First Internat. Conf. on Quantitative Evaluation of Systems (QEST), 2004, IEEE Computer Society, pp. 322-323.
14. Palamidessi C., and Herescu O.M. A randomized encoding of the π-calculus with mixed choice. Theoret. Comput. Sci. 335 2-3 (2005) 73-404
15. Reiter M.K., and Rubin A.D. Crowds: anonymity for Web transactions. ACM Trans. Inform. System Security 1 1 (1998) 66-92
16. Ryan P.Y., and Schneider S. Modelling and Analysis of Security Protocols (2001), Addison-Wesley, Reading, MA
17. Schneider S., and Sidiropoulos A. CSP and anonymity. in: Proc. European Symp. on Research in Computer Security (ESORICS), Lecture Notes in Computer Science Vol. 1146 (1996), Springer, Berlin 198-218
18. Segala R., and Lynch N. Probabilistic simulations for probabilistic processes. Nordic J. Computing 2 2 (1995) 250-273 An extended abstract appeared in Proc. CONCUR '94, Lecture Notes in Computer Science, Vol. 836, Springer, Berlin, pp. 481-496
19. A. Serjantov, G. Danezis, Towards an information theoretic metric for anonymity, in: Proc. of the International Workshop on Privacy Enhancing Technologies (PET), Lecture Notes in Computer Science, Vol. 2482, Springer, 2002, pp. 41-53.
20. V. Shmatikov, Probabilistic analysis of anonymity, in: Proc. of the IEEE Computer Security Foundations Workshop (CSFW), 2002, pp. 119-128.
21. Shmatikov V. Probabilistic model checking of an anonymity system. J. Comput. Security 12 3/4 (2004) 355-377
22. P.F. Syverson, D.M. Goldschlag, M.G. Reed, Anonymous connections and onion routing, in: IEEE Symp. on Security and Privacy, Oakland, CA, 1997, pp. 44-54.
23. P.F. Syverson, S.G. Stubblebine, Group principals and the formalization of anonymity, in: World Cong. on Formal Methods (1), 1999, pp. 814-833.
24. M. Wright, M. Adler, B. Levine, C. Shields, An analysis of the degradation of anonymous protocols, in: ISOC Network and Distributed System Security Symp. (NDSS), 2002.