Anonymity and information hiding in multiagent systems

Journal of Computer Security

Volumn 13, Issue 3, 2005, Pages 483-514

  Halpern, Joseph Y ^a   O'Neill, Kevin R ^a,b  

^a Department of Obstetrics Gynecology   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Anonymity; Epistemic logic; Formal methods; Security

Indexed keywords

ALGEBRA; INFORMATION ANALYSIS; KNOWLEDGE ACQUISITION; PROBABILISTIC LOGICS;

ANONYMITY; EPISTEMIC LOGIC; FORMAL METHODS; INFORMATION HIDING; SECURITY;

MULTI AGENT SYSTEMS;

EID: 24144492346     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2005-13305     Document Type: Conference Paper

References (34)

1. M. Abadi and A.D. Gordon, A calculus for cryptographic protocols: The spi calculus, in: Fourth ACM Conference on Computer and Communications Security, 1997, pp. 36-47.
2. L. von Ahn, A. Bortz and N.J. Hopper, k-anonymous message transmission, in: 10th ACM Conference on Computer and Communications Security, 2003, pp. 122-130.
3. D. Chaum, The dining cryptographers problem: Unconditional sender and recipient untraceability, Journal of Cryptology 1(1) (1988), 65-75.
4. G. Danezis, Mix-networks with restricted routes, in: Proc. Privacy Enhancing Technologies Workshop (PET 2003), R. Dingledine, ed., Volume 2760 of Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York, 2003, pp. 54-68.
5. C. Diaz, S. Seys, J. Claessens and B. Preneel, Towards measuring anonymity, in: Proc. Privacy Enhancing Technologies Workshop (PET 2002), R. Dingledine and P. Syverson, eds, Volume 2482 of Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York, 2002, pp. 54-68.
6. R. Fagin, J.Y. Halpern and N. Megiddo, A logic for reasoning about probabilities, Information and Computation 87(1/2) (1990), 78-128.
7. R. Fagin, J.Y. Halpern, Y. Moses and M.Y. Vardi, Reasoning about Knowledge, MIT Press, Cambridge, MA, 1995.
8. R. Focardi and R. Gorrieri, Classification of security properties (Part I: Information flow), in: Foundationsof Security Analysis and Design, Springer-Verlag, 2001, pp. 331-396.
9. C. Fournet and M. Abadi, Hiding names: Private authentication in the applied pi calculus, in: Proc. International Symposium on Software Security (ISSS 2002), Volume 2609 of Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York, 2003, pp. 317-338.
10. J. Glasgow, G. MacEwen and P. Panangaden, A logic for reasoning about security, ACM Transactions on Computer Systems 10(3) (1992), 226-264.
11. S. Goel, M. Robson, M. Polte and E.G. Sirer, Herbivore: A scalable and efficient protocol for anonymous communication, 2002 (unpublished manuscript).
12. J.W. Gray and P.F. Syverson, A logical approach to multillevel security of probabilistic systems, Distributed Computing 11(2) (1998), 73-90.
13. J.Y. Halpern and K. O'Neill, Secrecy in multiagent systems, in: Proc. 15th IEEE Computer Security Foundations Workshop, 2002, pp. 32-46.
14. J.Y. Halpern and K. O'Neill, Anonymity and information hiding in multiagent systems, in: Proc. 16th IEEE Computer Security Foundations Workshop, 2003, pp. 75-88.
15. J.Y. Halpern and R. Pucella, On the relationship between strand spaces and multi-agent systems, in: Proc. Eighth ACM Conference on Computer and Communications Security, 2001, pp. 106-115. To appear, ACM Transactions on Information and System Security.
16. J.Y. Halpern and M.R. Tuttle, Knowledge, probability, and adversaries, Journal of the ACM 40(4) (1993), 917-962.
17. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985.
18. D. Hughes and V. Shmatikov, Information hiding, anonymity and privacy: a modular approach, Journal of Computer Security 12(1) (2004), 3-36.
19. M. Kwiatkowska, G. Norman and D. Parker, PRISM: Probabilistic symbolic model checker, in: Proc. Tools Session of Aachen 2001 International Multiconference on Measurement, Modelling and Evaluation of Computer-Communication Systems, P. Kemper, ed., 2001, pp. 7-12. Available as Technical Report 760/2001, University of Dortmund.
20. B.N. Levine and C. Shields, Hordes: A multicast based protocol for anonymity, Journal of Computer Security 10(3) (2002), 213-240.
21. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92, Springer-Verlag, Berlin/New York, 1980.
22. R. van der Meyden, Common knowledge and update in finite environments, Information and Computation 140(2) (1998), 115-157.
23. R. van der Meyden and K. Su, Symbolic model checking the knowledge of the dining cryptographers, in: Proc. 17th IEEE Computer Security Foundations Workshop (2004) (to appear).
24. A. Pfitzmann and M. Köhntopp, Anonymity, unobservability, and pseudeonymity: a proposal for terminology, in: International Workshop on Designing Privacy Enhancing Technologies, Springer-Verlag, New York, 2001, pp. 1-9.
25. M. Reiter and A. Rubin, Crowds: Anonymity for web transactions, ACM Transactions on Information and System Security 1(1) (1998), 66-92.
26. S. Schneider, Security Properties and CSP, in: Proc. 1996 IEEE Symposium on Security and Privacy, 1996, pp. 174-187.
27. S. Schneider and A. Sidiropoulos, CSP and anonymity, in: European Symposium on Research in Computer Security, 1996, pp. 198-218.
28. A. Serjantov and G. Danezis, Towards an information theoretic metric for anonymity, in: Proc. Privacy Enhancing Technologies Workshop (PET 2002), R. Dingledine and P. Syverson, eds, Volume 2482 of Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York, 2002, pp. 41-53.
29. R. Sherwood, B. Bhattacharjee and A. Srinivasan, P5: A protocol for scalable anonymous communication, in: IEEE Symposium on Security and Privacy, 2002, pp. 58-70.
30. V. Shmatikov, Probabilistic analysis of anonymity, in: Proc. 15th Computer Security Foundations Workshop, 2002, pp. 119-128.
31. P.F. Syverson, D.M. Goldschlag and M.G. Reed, Anonymous connections and onion routing, in: IEEE Symposium on Security and Privacy, 1997, pp. 44-54.
32. P.F. Syverson and S.G. Stubblebine, Group principals and the formalization of anonymity, in: World Congress on Formal Methods, 1999, pp. 814-833.
33. F.J. Thayer, J.C. Herzog and J.D. Guttman, Strand spaces: Proving security protocols correct, Journal of Computer Security 7(2/3) (1999), 191-230.
34. S. Zdancewic and A.C. Myers, Robust declassification, in: Proc. 14th IEEE Computer Security Foundations Workshop, 2001, pp. 15-23.