Cryptographic Solution to a Multilevel Security Problem
A scheme based on cryptography is proposed for enforcing multilevel security in a system where hierarchy is represented by a partially ordered set (or poset). Straightforward implementation of the scheme requires users highly placed in the hierarchy to store a large number of cryptographic keys. A time-versus-storage trade-off is then described for addressing this key management problem.
KeywordsCentral Authority Hasse Diagram Modular Exponentiation Data Encryption Standard Security Class
Unable to display preview. Download preview PDF.
- 1.G. H. MacEwen, Secure information flow in distributed systems, Proceedings of the Eleventh Biennial Symposium on Communications, Queen’s University, Kingston, Ontario (1982).Google Scholar
- 2.D. E. R. Denning, “Cryptography And Data Security”, Addison-Wesley, Reading, Massachusetts (1982).Google Scholar
- 3.A. G. Konheim, “Cryptography: A Primer”, John Wiley & Sons, Toronto (1981).Google Scholar
- 4.C. Meyer and S. M. Matyas, “Cryptography - A New Dimension In Computer Security”, John Wiley & Sons, New York (1982).Google Scholar
- 6.Data Encryption Standard, Federal Information Processing Standard (FIPS), Publication 46, National Bureau of Standards, U.S. Department of Commerce (1977).Google Scholar
- 8.M. O. Rabin, Digitalized signatures and public-key functions as intractable as factorization, Technical Report MIT/LCS/TR-212, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts (1979).Google Scholar