default search action
2nd S&P 1981: Oakland, California, USA
- 1981 IEEE Symposium on Security and Privacy, Oakland, CA, USA, April 27-29, 1981. IEEE Computer Society 1981, ISBN 0-8186-0345-3
- Jonathan K. Millen:
Information Flow Analysis of Formal Specifications. 3-8 - Allen Stoughton:
Access Flow: A Protection Model which Integrates Access Control and Information Flow. 9-18 - David A. Bonyun:
The Role of a Well Defined Auditing Process in the Enforcement of Privacy Policy and Data Security. 19-25 - Lawrence J. Shirley, Roger R. Schell:
Mechanism Sufficiency Validation by Assignment. 26-32 - Dorothy E. Denning:
Restriciting Queries that Might Lead to Compromise. 33-40 - Naftaly H. Minsky:
On the Transport of Privileges. 41-48 - Luke C. Dion:
A Complete Protection Model. 49-55 - Daniel J. Solomon:
Processing Multilevel Secure Objects. 56-64 - Gustavus J. Simmons:
Half a Loaf is Better than None: Some Novel Message Integrity Problems. 65-69 - Charles Cresson Wood:
Future Applications of Cryptography. 70-74 - G. R. Blakley, Laif Swanson:
Security Proofs for Information Protection Systems. 75-88 - Carl H. Meyer, Stephen M. Matyas, Richard E. Lennon:
Required Cryptographic Authentication Criteria for Electronic Funds Transfer Systems. 89-98 - Peter S. Tasker:
Trusted Computer Systems. 99-100 - James S. Miller, Robert G. Resnick:
Military Message Systems: Applying a Security Model. 101-112 - Margaret S. Wu:
Hierarchical Protection Systems. 113-123 - Lyle A. Cox Jr., Roger R. Schell:
The Structure of a Security Kernel for the Z8000 Multiprocessor. 124-132 - George I. Davida, Jon Livesey:
The Design of Secure CPU-Multiplexed Computer Systems: The Master/Slave Architecture. 133-140 - Stanley R. Ames Jr.:
Security Kernels: A Solution or a Problem? 141-
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.