Chapter 3. Foundational Results
MARIA: Ay, but you must confine yourself within the modest limits of order. | ||
| --Twelfth Night, I, iii, 8–9. | ||
In 1976, Harrison, Ruzzo, and Ullman [401] proved that in the most general abstract case, the security of computer systems was undecidable and explored some of the limits of this result.
Models explore the most basic question of the art and science of computer security: under what conditions can a generic algorithm determine whether a system is secure? Understanding models and the results derived from them lays the foundations for coping with limits in policy and policy composition as well as applying the theoretical work.
The General Question
Given a computer system, how can we determine if it is secure? More ...
Get Introduction to Computer Security now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
