By Topic

Verification of the security of a secure network component

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
E. A. Schneider ; ORA Corp., Ithaca, NY, USA

The author formally proves using a mechanical verifier that a security multiplexer for a network is secure and has no timing channels. While this multiplexer is only a small piece of a system, it handles multiple security levels and contains a process and two procedures that interact with other parts of the system. Security is expressed using an information flow model, extended to handle time. He shows how the multiplexer is specified in this model, describes the synchronous deterministic security model used, and discuss the security proof

Published in:

Computer Security Applications Conference, 1991. Proceedings., Seventh Annual

Date of Conference:

2-6 Dec 1991