skip to main content
article
Free Access

The enforcement of security policies for computation

Published:01 November 1975Publication History
Skip Abstract Section

Abstract

Security policies define who may use what information in a computer system. Protection mechanisms are built into a system to enforce security policies. In most systems, however, it is quite unclear what policies a mechanism can or does enforce.

This paper defines security policies and protection mechanisms precisely and bridges the gap between them with the concept of soundness: whether a protection mechanism enforces a policy. Different sound protection mechanisms for the same policy can then be compared. We also show that the “union” of mechanisms for the same program produces a more “complete” mechanism. Although a “maximal” mechanism exists, it cannot necessarily be constructed.

References

  1. 1 D. W. Bell. Secure systems: A refinement of the mathematical model. The Mitre Corporation MTR 2547, Volume III, 1974.Google ScholarGoogle Scholar
  2. 2 D. Denning. Secure information flow in computer systems. PhD thesis, Purdue University CSD-TR-145. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 A. C. Doyle. Silver blaze. The Memoirs of Sherlock Holmes, 1874.Google ScholarGoogle Scholar
  4. 4 J. S. Fenton. Memoryless subsystems. Computer Journal 17(2):143-147, 1974.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5 A. K. Jones. Protection in programmed systems. PhD thesis, Carnegie-Mellon University, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 B. W. Lampson. A note on the confinement problem. CACM 16(10)m 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 P. G. Neumann, L. Robinson, K. N. Levitt, R. S. Boyer, and A. R. Saxena. A provably secure operating system. SRI Final Report, 1975.Google ScholarGoogle Scholar
  8. 8 E. Organick. The Multics System: An Examination of Its Structure. MIT Press, 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 D. Parnas. A technique for software module specification, with examples. CACM 15: 330-336, 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 G. Popek and C. S. Kline. Verifiable secure operating system software. AFIPS National Computer Conference Proceedings, 145-151, 1974.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 L. Rotenberg. Making computers keep secrets. MIT-TR-115, 1974.Google ScholarGoogle Scholar
  12. 12 M. D. Schroeder. Cooperation of mutually suspicious subsystems in a computer utility. PhD thesis, MAC TR-104, Massachusetts Institute of Technology, 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 K. G. Walter, W. F. Ogden, W. C. Rounds, F. T. Bradshaw, S. R. Ames, and D. G. Schuman. Models for secure computer systems. Case Western Reserve Technical Report 1137, 1973.Google ScholarGoogle Scholar
  14. 14 C. Weissman. Security controls in the ADEPT-50 time sharing system. AFIPS FJCC, 119-133, 1969.Google ScholarGoogle Scholar
  15. 15 W. A. Wulf, E. Cohen, W. Corwin, A. Jones, R. Levin, C. Pierson, and R. Pollack. HYDRA: The kernel of a multiprocessor operating system. CACM 17(6):337-345, 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The enforcement of security policies for computation

        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 SIGOPS Operating Systems Review
          ACM SIGOPS Operating Systems Review  Volume 9, Issue 5
          November 1975
          222 pages
          ISSN:0163-5980
          DOI:10.1145/1067629
          Issue’s Table of Contents
          • cover image ACM Conferences
            SOSP '75: Proceedings of the fifth ACM symposium on Operating systems principles
            November 1975
            222 pages
            ISBN:9781450378635
            DOI:10.1145/800213

          Copyright © 1975 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 November 1975

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader