Book Chapter10.1007/978-1-4757-0602-4_23
Cryptographic Solution to a Multilevel Security Problem
Selim G. Akl,Peter D. Taylor +1 more
- 01 Jan 1983
- pp 237-249
68
TL;DR: A time-versus-storage trade-off is described for addressing the key management problem of enforcing multilevel security in a system where hierarchy is represented by a partially ordered set.
read more
Abstract: 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
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Attribute-based encryption for fine-grained access control of encrypted data
Vipul Goyal,Omkant Pandey,Amit Sahai,Brent Waters +3 more
- 30 Oct 2006
TL;DR: This work develops a new cryptosystem for fine-grained sharing of encrypted data that is compatible with Hierarchical Identity-Based Encryption (HIBE), and demonstrates the applicability of the construction to sharing of audit-log information and broadcast encryption.
Flexible access control with master keys
Gerald C. Chick,Stafford E. Tavares +1 more
- 20 Aug 1989
TL;DR: This work shows how to create a master key scheme for controlling access to a set of services, such that only service keys in this list can be computed easily from the master key.
Protecting secret keys with personal entropy
TL;DR: A scheme whereby a user can protect a secret key using the "personal entropy" in his own life, by encrypting the passphrase using the answers to several personal questions, while an attacker must learn the answer to a large subset of the questions in order to recover the secret key.
134
A cryptographic solution to implement access control in a hierarchy and more
Indrakshi Ray,Indrajit Ray,Natu Narasimhamurthi +2 more
- 03 Jun 2002
TL;DR: This work proposes a new solution that addresses the problem of access control in a hierarchy and is a scheme similar to the RSAcryptosystem and can be easily incorporated in existing systems.
Key distribution based on hierarchical access control for conditional access system in DTV broadcast
TL;DR: The proposed key distribution scheme can greatly reduce the encrypting computation and acquire higher efficiency and security, and is more flexible in processing joining and leaving of subscriber, which is very important for service provider to manage the subscriber.
65
References
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
A Method for Obtaining Digital Signatures and Public Key Cryptosystems (Formerly on Digital Signatures and Public Key Cryptosystems)
Ronald L. Rivest,Adi Shamir,Len Adelman +2 more
- 01 Jan 1977
TL;DR: In this paper, a message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret prime numbers p and q.
8.2K
•Book
Cryptography and data security
Dorothy E. Denning
- 01 Jan 1982
TL;DR: The goal of this book is to introduce the mathematical principles of data security and to show how these principles apply to operating systems, database systems, and computer networks.
2.2K
Digitalized signatures and public-key functions as intractable as factorization
Michael O. Rabin
- 01 Jan 1979
TL;DR: It is proved that for any given n, if the authors can invert the function y = E (x1) for even a small percentage of the values y then they can factor n, which seems to be the first proved result of this kind.
A modification of the RSA public-key encryption procedure (Corresp.)
TL;DR: The Rivest, Shamir, and Adleman (RSA) public-key encryption algorithm can be broken if the integer R used as the modulus can be factored as discussed by the authors.
320
Related Papers (5)
Gerald C. Chick,Stafford E. Tavares +1 more
- 20 Aug 1989
Chung Kei Wong,Mohamed G. Gouda,Simon S. Lam +2 more
- 01 Oct 1998