skip to main content
article

Secure safe ambients

Published:01 January 2001Publication History
Skip Abstract Section

Abstract

Secure Safe Ambients (SSA) are a typed variant of Safe Ambients [9], whose type system allows behavioral invariants of ambients to be expressed and verified. The most significant aspect of the type system is its ability to capture both explicit and implicit process and ambient behavior: process types account not only for immediate behavior, but also for the behavior resulting from capabilities a process acquires during its evolution in a given context. Based on that, the type system provides for static detection of security attacks such as Trojan Horses and other combinations of malicious agents.We study the type system of SSA, define algorithms for type checking and type reconstruction, define powerful languages for expressing security properties, and study a distributed version of SSA and its type system. For the latter, we show that distributed type checking ensures security even in ill-typed contexts, and discuss how it relates to the security architecture of the Java Virtual Machine.

References

  1. 1 D. Brewer and M. Nash. The chinese wall security policy. In Proc. of lEEE Symposium on Security and Privacy, pages 206-214, 1982.Google ScholarGoogle Scholar
  2. 2 H. R. N. C. Bodei, E Degano and E Nielson. Static analysis of processes for no read-up and no write-down. In Porceedins of FoSSaCS'99. 1999.Google ScholarGoogle Scholar
  3. 3 L. Cardelli, G. Ghelli, and A. Gordon. Mobility types for mobile ambients. In Proceedings of ICALP'99, LNCS 1644, pages 230-239. 1999.Google ScholarGoogle ScholarCross RefCross Ref
  4. 4 L. Cardelli, G. Ghelli, and A. D. Gordon. Ambient groups and mobility types. In Int. Conf. IFIP TCS, LNCS 1872, pages 333-347. 2000.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5 L. Cardelli and A. Gordon. Mobile ambients. In Proceedings of POPL'98. ACM Press, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 L. Cardelli and A. Gordon. Types for mobile ambients. In Proceedings of POPL'99, pages 79-92. ACM Press, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 P. J. Denning. Fault tolerant operating systems. ACM Computing Surveys, 8(4):359-389, Dec. 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 L. Gong. Inside Java 2 Platform Security. Addison-Wesley, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 E Levi and D. Sangiorgi. Controlling interference in ambients. In POPL '00, pages 352-364. ACM Press, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 T. Lindholm and E Yellin. The Java Virtual Machine Specification. Java series. Addison-Wesley, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 G. Necula. Proof carrying code. In A. Press, editor, POPL '97, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 E Nielson, H. R. Nielson, R. R. Hansen, and J. G. Jensen. Validating firewalls in mobile ambients. In Proc. CONCUR'99, LNCS 1664, pages 463-477, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  13. 13 H. R. Nielson and F. Nielson. Shape analysis for mobile ambients. In POPL'00, pages 135-148. ACM Press, 2000. Google ScholarGoogle Scholar
  14. 14 P. Sewell and J. Vitek. Secure composition of untrusted code: Wrappers and causality types. In 13th IEEE Computer Security Foundations Workshop, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 J. Vitek and G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, LNCS 1686, 1999.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Secure safe ambients

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM SIGPLAN Notices
            ACM SIGPLAN Notices  Volume 36, Issue 3
            March 2001
            303 pages
            ISSN:0362-1340
            EISSN:1558-1160
            DOI:10.1145/373243
            Issue’s Table of Contents
            • cover image ACM Conferences
              POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
              January 2001
              304 pages
              ISBN:1581133367
              DOI:10.1145/360204

            Copyright © 2001 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 January 2001

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader