Probabilistic and nondeterministic aspects of anonymity

Theoretical Computer Science

Volumn 410, Issue 41, 2009, Pages 4006-4025

  Beauxis, Romain ^a,b   Palamidessi, Catuscia ^a,b  

^a INRIA SACLAY   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Anonymity; Probabilistic automata; Probability

Indexed keywords

CALCULATIONS; PROBABILISTIC LOGICS; PROBABILITY; SEMANTICS;

ANONYMITY; FORMAL DEFINITION; GENERAL SITUATION; NON-DETERMINISM; NONDETERMINISTIC BEHAVIOR; NONDETERMINISTIC FRAMEWORK; PROBABILISTIC AUTOMATA; RANDOM MECHANISMS;

AUTOMATA THEORY;

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

References (38)

1. Abadi M., and Fournet C. Private authentication. Theoretical Computer Science 322 3 (2004) 427-476
2. Abadi M., and Gordon A.D. A calculus for cryptographic protocols: The spi calculus. Information and Computation 148 1 (1999) 1-70
3. Amadio R.M., and Lugiez D. On the reachability problem in cryptographic protocols. Proceedings of CONCUR 00. Lecture Notes in Computer Science vol. 1877 (2000), Springer INRIA Research Report 3915, March 2000
4. Beauxis R., Chatzikokolakis K., Palamidessi C., and Panangaden P. Formal approaches to information-hiding (tutorial). In: Barthe G., and Fournet C. (Eds). Proceedings of the Third Symposium on Trustworthy Global Computing. TGC 2007. Lecture Notes in Computer Science vol. 4912 (2008), Springer 347-362
5. Bhargava M., and Palamidessi C. Probabilistic anonymity. In: Abadi M., and de Alfaro L. (Eds). Proceedings of CONCUR. Lecture Notes in Computer Science vol. 3653 (2005), Springer 171-185. http://www.lix.polytechnique.fr/catuscia/papers/Anonymity/concur.pdf
6. Boreale M., and Sangiorgi D. Some congruence properties for π-calculus bisimilarities. Theoretical Computer Science 198 1-2 (1998) 159-176
7. Chatzikokolakis K., Norman G., and Parker D. Bisimulation for demonic schedulers. In: De Alfaro L. (Ed). Proceedings of the Twelfth International Conference on Foundations of Software Science and Computation Structures. FOSSACS 2009, York, UK, March 2009. Lecture Notes in Computer Science vol. 5504 (2009), Springer 318-332
8. Chatzikokolakis K., and Palamidessi C. Making random choices invisible to the scheduler. In: Caires L., and Vasconcelos V.T. (Eds). Proceedings of CONCUR'07. Lecture Notes in Computer Science vol. 4703 (2007), Springer 42-58. http://www.lix.polytechnique.fr/catuscia/papers/Scheduler/report.pdf
9. Chatzikokolakis K., Palamidessi C., and Panangaden P. Anonymity protocols as noisy channels. Information and Computation 206 2-4 (2008) 378-401. http://www.lix.polytechnique.fr/catuscia/papers/Anonymity/Channels/full.pdf
10. Chatzikokolakis K., Palamidessi C., and Panangaden P. On the bayes risk in information-hiding protocols. Journal of Computer Security 16 5 (2008) 531-571
11. Chaum D. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1 (1988) 65-75
12. Clarke I., Sandberg O., Wiley B., and Hong T.W. Freenet: A distributed anonymous information storage and retrieval system. Designing Privacy Enhancing Technologies, International Workshop on Design Issues in Anonymity and Unobservability. Lecture Notes in Computer Science vol. 2009 (2000), Springer 44-66
13. Díaz C., Seys S., Claessens J., and Preneel B. Towards measuring anonymity. In: Dingledine R., and Syverson P.F. (Eds). Proceedings of the Workshop on Privacy Enhancing Technologies. PET 2002. Lecture Notes in Computer Science vol. 2482 (2002), Springer 54-68
14. Gill R.D., van der Laan M., and Robins J. Coarsening at random: Characterizations, conjectures and counterexamples. In: Lin D.Y., and Fleming T.R. (Eds). Proceedings of the First Seattle Symposium in Biostatistics. Lecture Notes in Statistics (1997), Springer 255-294
15. Grunwald P.D., and Halpern J.Y. Updating probabilities. Journal of Artificial Intelligence Research 19 (2003) 243-278
16. Halpern J.Y., and O'Neill K.R. Anonymity and information hiding in multiagent systems. Journal of Computer Security 13 3 (2005) 483-512
17. Herescu O.M., and Palamidessi C. Probabilistic asynchronous π-calculus. In: Tiuryn J. (Ed). Proceedings of FOSSACS 2000 (Part of ETAPS 2000). Lecture Notes in Computer Science vol. 1784 (2000), Springer 146-160. http://www.lix.polytechnique.fr/~catuscia/papers/Prob_asy_pi/fossacs.ps
18. Hoare C.A.R. Communicating Sequential Processes (1985), Prentice-Hall
19. Hughes D., and Shmatikov V. Information hiding, anonymity and privacy: A modular approach. Journal of Computer Security 12 1 (2004) 3-36
20. Kremer S., and Ryan M.D. Analysis of an electronic voting protocol in the applied pi-calculus. In: Sagiv M. (Ed). Programming Languages and Systems - Proceedings of the 14th European Symposium on Programming. ESOP'05. Lecture Notes in Computer Science vol. 3444 (2005), Springer, Edinburgh, U.K. 186-200
21. Lowe G. Casper: A compiler for the analysis of security protocols. Proceedings of 10th IEEE Computer Security Foundations Workshop, 1997. Journal of Computer Security 6 (1998) 53-84
22. Malacaria P. Assessing security threats of looping constructs. In: Hofmann M., and Felleisen M. (Eds). Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL 2007, Nice, France, 17-19 January, 2007 (2007), ACM 225-235
23. Malacaria P., and Chen H. Lagrange multipliers and maximum information leakage in different observational models. In: Erlingsson Ú., and Pistoia M. (Eds). Proceedings of the 2008 Workshop on Programming Languages and Analysis for Security. PLAS 2008 (2008), ACM, Tucson, AZ, USA 135-146
24. Milner R. Communication and concurrency. International Series in Computer Science (1989), Prentice Hall
25. Milner R., Parrow J., and Walker D. A calculus of mobile processes, I and II. Information and Computation 100 1 (1992) 1-40 41-77. A preliminary version appeared as Technical Reports ECF-LFCS-89-85 and -86, University of Edinburgh, 1989
26. Catuscia Palamidessi, Comparing the expressive power of the synchronous and the asynchronous π-calculus, in: Conference Record of POPL '97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Paris, France, 1997, pp. 256-265
27. Palamidessi C., and Herescu O.M. A randomized encoding of the π-calculus with mixed choice. Theoretical Computer Science 335 2-3 (2005) 373-404. http://www.lix.polytechnique.fr/~catuscia/papers/prob_enc/report.pdf
28. Reiter M.K., and Rubin A.D. Crowds: Anonymity for Web transactions. ACM Transactions on Information and System Security 1 1 (1998) 66-92
29. Roscoe A.W. Modelling and verifying key-exchange protocols using CSP and FDR. Proceedings of the 8th IEEE Computer Security Foundations Workshop (1995), IEEE Computer Soc Press 98-107
30. Ryan P.Y., and Schneider S. Modelling and Analysis of Security Protocols (2001), Addison-Wesley
31. Sangiorgi D. π-calculus, internal mobility and agent-passing calculi. Theoretical Computer Science 167 1-2 (1996) 235-274
32. S. Schneider, Security properties and CSP, in: Proceedings of the IEEE Symposium Security and Privacy, 1996
33. Schneider S., and Sidiropoulos A. CSP and anonymity. Proc. of the European Symposium on Research in Computer Security. ESORICS. Lecture Notes in Computer Science vol. 1146 (1996), Springer 198-218
34. Segala R., and Lynch N. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2 2 (1995) 250-273 An extended abstract appeared in: Proceedings of CONCUR'94, in: LNCS, vol. 836, pp. 481-496
35. Serjantov A., and Danezis G. Towards an information theoretic metric for anonymity. In: Dingledine R., and Syverson P.F. (Eds). Proceedings of the Workshop on Privacy Enhancing Technologies. PET 2002. Lecture Notes in Computer Science vol. 2482 (2002), Springer 41-53
36. Smith G. On the foundations of quantitative information flow. In: De Alfaro L. (Ed). Proceedings of the Twelfth International Conference on Foundations of Software Science and Computation Structures. FOSSACS 2009. Lecture Notes in Computer Science vol. 5504 (2009), Springer, York, UK 288-302
37. Paul F. Syverson, Stuart G. Stubblebine, Group principals and the formalization of anonymity, in: World Congress on Formal Methods, vol. 1, 1999, pp. 814-833
38. P.F. Syverson, D.M. Goldschlag, M.G. Reed, Anonymous connections and onion routing, in: IEEE Symposium on Security and Privacy, Oakland, California, 1997, pp. 44-54