Anonymity and information hiding in multiagent systems

Proceedings of the Computer Security Foundations Workshop

Volumn 2003-January, Issue , 2003, Pages 75-88

  Halpern, J Y ^a   O'Neill, K R ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

Algebra; Computer science; Computer security; Cryptography; Internet; Logic; Multiagent systems; Protection; Research initiatives; Uncertainty

Indexed keywords

ALGEBRA; COMPUTER SCIENCE; CRYPTOGRAPHY; INTERNET; SECURITY OF DATA; SECURITY SYSTEMS;

INFORMATION HIDING; LOGIC; MODAL LOGIC; PROCESS ALGEBRAS; PROTECTION; RESEARCH INITIATIVES; SYSTEMS FRAMEWORK; UNCERTAINTY;

MULTI AGENT SYSTEMS;

EID: 33646018220     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2003.1212706     Document Type: Conference Paper

References (22)

1. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Fourth ACM Conference on Computer and Communications Security, pages 36-47, 1997.
2. D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65-75, 1988.
3. R. Fagin, J. Y. Halpern, and N. Megiddo. A logic for reasoning about probabilities. Information and Computation, 87(1/2):78-128, 1990.
4. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, Mass., 1995.
5. R. Focardi and R. Gorrieri. Classification of security properties (Part I: Information flow). In Foundations of Security Analysis and Design, pages 331-396. Springer, 2001.
6. J. Glasgow, G. MacEwen, and P. Panangaden. A logic for reasoning about security. ACM Trans. on Computer Systems, 10(3):226-264, 1992.
7. S. Goel, M. Robson, M. Polte, and E. G. Sirer. Herbivore: A scalable and efficient protocol for anonymous communication. Unpublished manuscript, 2002.
8. J. W. Gray and P. F. Syverson. A logical approach to multillevel security of probabilistic systems. Distributed Computing, 11(2):73-90, 1998.
9. J. Y. Halpern and K. O'Neill. Secrecy in multiagent systems. In Proc. 15th IEEE Computer Security Foundations Workshop, pages 32-46, 2002.
10. 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, pages 106-115, 2001. To appear, ACM Transactions on Information and System Security.
11. J. Y. Halpern and M. R. Tuttle. Knowledge, probability, and adversaries. Journal of the ACM, 40(4):917-962, 1993.
12. C. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
13. D. Hughes and V. Shmatikov. Information hiding, anonymity and privacy: a modular approach. Journal of Computer Security, 2003.
14. R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science, Vol. 92. Springer-Verlag, Berlin/New York, 1980.
15. M. Reiter and A. Rubin. Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security, 1(1):66-92, 1998.
16. S. Schneider. Security Properties and CSP. In Proceedings of the 1996 IEEE Symposium on Security and Privacy, pages 174-187, 1996.
17. S. Schneider and A. Sidiropoulos. CSP and anonymity. In European Symposium on Research in Computer Security, pages 198-218, 1996.
18. V. Shmatikov. Probabilistic analysis of anonymity. In Proc. 15th IEEE Computer Security Foundations Workshop, pages 119-128, 2002.
19. P. F. Syverson and S. G. Stubblebine. Group principals and the formalization of anonymity. In World Congress on Formal Methods, pages 814-833, 1999.
20. R. van der Meyden. Common knowledge and update in finite environments. Information and Computation, 140(2):115-157, 1998.
21. R. van der Meyden and K. Su. Symbolic model checking the knowledge of the dining cryptographers. Unpublished manuscript, 2002.
22. S. Zdancewic and A. C. Myers. Robust declassification. In Proceedings of the 14th IEEE Computer Security Foundations Workshop, pages 15-23, 2001.