[PDF][PDF] Secure computer systems: Mathematical foundations

DE Bell, LJ LaPadula - 1973 - Citeseer
systems, and from a knowledge of security problems. The reader can find numerous articles
i Lhe literature which touch on the area of a secure computer system… and proving the security

[图书][B] Building a secure computer system

M Gasser - 1988 - Citeseer
… Some sophisticated features appear in research systems that are used daily at universities,
proving that the concepts are viable, but for various reasons (not the fault of the researchers) …

A logic of secure systems and its application to trusted computing

A Datta, J Franklin, D Garg… - … Symposium on Security …, 2009 - ieeexplore.ieee.org
secure systems, including the trusted computing systems examined in this paper, they are by
no means sufficient to model all systems of … to prove security properties of trusted computing

[图书][B] Computer Systems established, maintained and trusted by mutually suspicious groups

DL Chaum - 1979 - chaum.com
… techniques described here provide secure computer systems that can be trusted by … systems
prove practical, those providing information to, or relying on the output of a computer system

Design and verification of secure systems

JM Rushby - ACM SIGOPS Operating Systems Review, 1981 - dl.acm.org
security kernel is widely considered to offer the most promising basis for the construction of
truly secure computer systems… some: we prove a property (isolation) of one system (that with …

Proving security protocols correct

LC Paulson - … on Logic in Computer Science (Cat. No …, 1999 - ieeexplore.ieee.org
… For all protocols that involve session keys, we must prove that those keys remain secret.
For Yahalom, we must moreover prove that Nb remains secret. We must prove secrecy in the …

[图书][B] Secure information flow in computer systems.

DER Denning - 1975 - search.proquest.com
… It is used for stating andi proving the security and determinacy requirements of systems
that control information flow. 2. Analysis of the properties of the model, and of the …

Proving properties of security protocols by induction

LC Paulson - Proceedings 10th Computer Security …, 1997 - ieeexplore.ieee.org
… Each safety property is proved by induction over the protocol. Each case considers a state
… We must prove Po to cover the empty trace. For each of the other rules, we must prove an …

Foundations of secure interactive computing

D Beaver - Annual International Cryptology Conference, 1991 - Springer
… , proving the relative resilience of each successive protocol with greater clarity and less
complexity. Folk theorems about the “transitivity” of security and the security of … to provably secure

Verifying security

M Harris Cheheyl, M Gasser, GA Huff… - ACM Computing Surveys …, 1981 - dl.acm.org
… This paper focuses on the way they are used to prove security properties of an operating
system design. We survey and compare a few prominent systems that have been, or could …