Secrecy in multiagent systems

ACM Transactions on Information and System Security

Volumn 12, Issue 1, 2008, Pages

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

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

Author keywords

Information flow; Secrecy

Indexed keywords

COMPUTER SCIENCE; SAFETY ENGINEERING;

ASYNCHRONOUS SYSTEM; INFORMATION FLOWS; NON-DETERMINISM; RESOURCE-BOUNDED; SECRECY; SHANNON; SYNCHRONOUS SYSTEM;

MULTI AGENT SYSTEMS;

EID: 56349155009     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/1410234.1410239     Document Type: Article

References (44)

1. CHAWLA, S., DWORK, C., MCSHERRY, F., SMITH, A., AND WEE, H. 2005. Towards privacy in public databases. Theory of Cryptography, To appear.
2. CHOR, B., GOLDREICH, O., KUSHILEVITZ, E., AND SUDAN, M. 1998. Private information retrieval. J. ACM 45, 6, 965-982.
3. CLARK, D., HUNT, S., AND MALACARIA, P. 2002. Quantitative analysis of the leakage of confidential data. Electronic Notes in Theoretical Computer Science 59, 3. In Proceedings of the Workshop on Quantitative Aspects of Programming Languages (QAPL'01).
4. COHEN, E. 1977. Information transmission in computational systems. In Proceedings of the 6th ACM Symposium on Operating Systems Principles (SOSP'77). 133-139.
5. DI PIERRO, A., HANKIN, C., AND WIKLICKY, H. 2002. Approximate non-interference. In Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW'02). 3-17.
6. EMERSON, E. A. 1983. Alternative semantics for temporal logics. Theor. Comput. Sci., 26, 121-130.
7. ENGELHARDT, K., VAN DER MEYDEN, R., AND MOSES, Y. 1998. Knowledge and the logic of local propositions. In Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK'98). 29-41.
8. EVFIMIEVSKI, A., GEHRKE, J. E., AND SRIKANT, R. 2003. Limiting privacy breaches in privacy preserving data mining. In Proceedings of the 22nd ACM Symposium on Principles of Database Systems (PODS'03). 211-222.
9. FAGIN, R., HALPERN, J. Y., AND MEGIDDO, N. 1990. A logic for reasoning about probabilities. Inf. Comput., 87, 1/2, 78-128.
10. FAGIN, R., HALPERN, J. Y., MOSES, Y., AND VARDI, M. Y. 1995. Reasoning about Knowledge (Revised 2003). MIT Press, Cambridge, MA.
11. FOCARDI, R. AND GORRIERI, R. 1994. A classification of security properties for process algebra. J. Comput. Sci., 3, 1, 5-33.
12. FOCARDI, R. AND GORRIERI, R. 2001. Classification of security properties (Part I: Information flow). In Foundations of Security Analysis and Design. Springer, 331-396.
13. GILL, R. D., VAN DER LAAN, M., AND ROBINS, J. 1997. Coarsening at random: Characterizations, conjectures and counter-examples. In Proceedings of the 1st Seattle Conference on Biostatistics. 255-294.
14. GOGUEN, J. A. AND MESEGUER, J. 1982. Security policies and security models. In Proceedings of the IEEE Symposium on Security and Privacy (SP'82). 11-20.
15. GRAY, J. W. AND SYVERSON, P. F. 1998. A logical approach to multilevel security of probabilistic systems. Dist. Comput, 11, 2, 73-90.
16. GRÜNWALD, P. D. AND HALPERN, J. Y. 2003. Updating probabilities. J. Art. Intell. Res., 19, 243-278.
17. HALPERN, J. Y. 2002. Characterizing the common prior assumption. J. Econ. Theory, 106, 2, 316-355.
18. HALPERN, J. Y. 2003. Reasoning About Uncertainty. MIT Press, Cambridge, MA.
19. HALPERN, J. Y. AND O'NEILL, K. 2003. Anonymity and information hiding in multiagent systems. In Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW'03). 75-88.
20. HALPERN, J. Y. AND O'NEILL, K. 2005. Secrecy in multiagent systems. Available at http://www.kevinoneill.org/papers.
21. HALPERN, J. Y. AND PUCELLA, R. 2003a. Modeling adversaries in a logic for security protocol analysis. In Proceedings of the Formal Aspects of Security (FASec'02). Lecture Notes in Computer Science, Volume 2629. Springer-Verlag, Berlin/Heidelberg/New York, 115-132.
22. HALPERN, J. Y. AND PUCELLA, R. 2003b. Probabilistic algorithmic knowledge. In Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK'03). 118-130.
23. HALPERN, J. Y. AND TUTTLE, M. R. 1993. Knowledge, probability, and adversaries. J. ACM, 40, 4, 917-962.
24. KYBURG, H. 1983. Recent work in inductive logic. In Recent Work in Philosophy, T. Machan and K. Lucey, Eds. Rowman & Allanheld, Totowa, NJ. 87-150.
25. LOWE, G. 2002. Quantifying information flow. In Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW'02). 18-31.
26. MANTEL, H. 2000. Possibilistic definitions of security-an assembly kit. In Proceedings of the IEEE Computer Security Foundations Workshop (CSFW'00). 185-199.
27. MANTEL, H. 2003. A uniform framework for the formal specification and verification of information flow security. Ph.D. thesis, Universität des Saarlandes.
28. MCCULLOUGH, D. 1987. Specifications for multi-level security and a hook-up property. In Proceedings of the IEEE Symposium on Security and Privacy (SP'87). 161-166.
29. MCLEAN, J. 1994. A general theory of composition for trace sets closed under selective interleaving functions. In Proceedings of the IEEE Symposium on Security and Privacy (SP'94). 79-93.
30. MEYDEN, R. VAN DER 1998. Common knowledge and update in finite environments. Inf. Comput., 140, 2, 115-157.
31. MITCHELL, J. C., RAMANATHAN, A., SCEDROV, A., AND TEAGUE, V. 2006. A probabilistic polynomial-time calculus for the analysis of cryptographic protocols. Theor. Comput. Sci. 353, 118-164.
32. MORRIS, S. 1995. The common prior assumption in economic theory. Econom. Philos., 11, 227-253.
33. MYERS, A. C., SABELFELD, A., AND ZDANCEWIC, S. 2004. Enforcing robust declassification. In Proceedings of the 17th IEEE Computer Security Foundations Workshop (CSFW'04). 172-186.
34. O'NEILL, K., CLARKSON, M., AND CHONG, S. 2006. Information-flow security for interactive programs. In Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW'06). 190-201.
35. RABIN, M. O. 1982. n-process mutual exclusion with bounded waiting by 4 · logr n-valued shared variable. J. Comp. Syst. Sci., 25, 1, 66-75.
36. RYAN, P. Y. A. AND SCHNEIDER, S. A. 1999. Process algebra and non-interference. In Proceedings of the 12th Computer Security Foundations Workshop (CSFW'99). 214-227.
37. RYAN, P. Y. A., SCHNEIDER, S. A., GOLDSMITH, M. H., LOWE, G., AND ROSCOE, A. W. 2001. Modeling and Analysis of Security Protocols. Addison-Wesley, Reading, MA.
38. SABELFELD, A. AND MYERS, A. C. 2003. Language-based information-flow security. IEEE J. Select. Areas Comm., 21, 1, 5-19.
39. SCHNEIDER, S. AND SIDIROPOULOS, A. 1996. CSP and anonymity. In European Symposium on Research in Computer Security (ESORICS'96). 198-218.
40. SHANNON, C. E. 1949. Communication theory of secrecy systems. Bell System Tech. J., 28-4, 656-715.
41. SUTHERLAND, D. 1986. A model of information. In Proceedings of the 9th National Security Conference. 175-183.
42. VARDI, M. Y. 1985. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (FOCS'85). 327-338.
43. WITTBOLD, J. T. AND JOHNSON, D. M. 1990. Information flow in nondeterministic systems. In Proceedings of the IEEE Symposium on Research in Security and Privacy (SP'90). 144-161.
44. ZAKINTHINOS, A. AND LEE, E. S. 1997. A general theory of security properties. In Proceedings of the IEEE Symposium on Security and Privacy (SP'97). 94-102.