Arrow Research search
Back to FOCS

FOCS 1976

A Linear Time Algorithm for Deciding Security

Conference Paper Session I Algorithms and Complexity ยท Theoretical Computer Science

Abstract

The Folklore is replete with stories of "secure" protection systems being compromised in a matter of hours. This is quite astounding since one is not likely to claim that a system is secure without some sort of proof to support the claim. In practice, proof is not provided and one reason for this is clear: although the protection primitives are apparently quite simple, they may potentially interact in extremely complex ways. Vague and informal arguments, therefore, often overlook subtleties that an adversary can exploit. Precision is not merely desirable for protection systems, it is mandatory.

Authors

Keywords

  • Protection
  • Data security
  • Concrete
  • Set Of Rules
  • Graphical Model
  • Protection System
  • Directed Graph
  • Subject And Object
  • Distinct Vertices
  • Distinct Blocks
  • Transitive Closure
  • Grant System

Context

Venue
IEEE Symposium on Foundations of Computer Science
Archive span
1975-2025
Indexed papers
3809
Paper id
365692730312499776
v2026.09.13