In this paper, we propose a new dynamic cryptographic key generation scheme for access control in a hierarchy. Our method can achieve the following three goals. First, the storage space needed to s. Grand theft auto episodes from liberty city serial key generator. The KeyPairGenerator class is used to generate pairs of public and private keys. Key pair generators are constructed using the getInstance factory methods (static methods that return instances of a given class). A Key pair generator for a particular algorithm creates a public/private key pair that can be used with this algorithm.

• What Is Dynamic Key Generation X
• What Is Dynamic Key Generation Review
• What Is Dynamic Key Generation 2

Creating and managing keys is an important part of the cryptographic process. Symmetric algorithms require the creation of a key and an initialization vector (IV). The key must be kept secret from anyone who should not decrypt your data. The IV does not have to be secret, but should be changed for each session. Asymmetric algorithms require the creation of a public key and a private key. The public key can be made public to anyone, while the private key must known only by the party who will decrypt the data encrypted with the public key. This section describes how to generate and manage keys for both symmetric and asymmetric algorithms.

Symmetric Keys

The symmetric encryption classes supplied by the .NET Framework require a key and a new initialization vector (IV) to encrypt and decrypt data. Whenever you create a new instance of one of the managed symmetric cryptographic classes using the parameterless constructor, a new key and IV are automatically created. Anyone that you allow to decrypt your data must possess the same key and IV and use the same algorithm. Generally, a new key and IV should be created for every session, and neither the key nor IV should be stored for use in a later session.

To communicate a symmetric key and IV to a remote party, you would usually encrypt the symmetric key by using asymmetric encryption. Sending the key across an insecure network without encrypting it is unsafe, because anyone who intercepts the key and IV can then decrypt your data. For more information about exchanging data by using encryption, see Creating a Cryptographic Scheme.

The following example shows the creation of a new instance of the TripleDESCryptoServiceProvider class that implements the TripleDES algorithm.

When the previous code is executed, a new key and IV are generated and placed in the Key and IV properties, respectively.

Sometimes you might need to generate multiple keys. In this situation, you can create a new instance of a class that implements a symmetric algorithm and then create a new key and IV by calling the GenerateKey and GenerateIV methods. The following code example illustrates how to create new keys and IVs after a new instance of the symmetric cryptographic class has been made.

When the previous code is executed, a key and IV are generated when the new instance of TripleDESCryptoServiceProvider is made. Another key and IV are created when the GenerateKey and GenerateIV methods are called.

Asymmetric Keys

The .NET Framework provides the RSACryptoServiceProvider and DSACryptoServiceProvider classes for asymmetric encryption. These classes create a public/private key pair when you use the parameterless constructor to create a new instance. Asymmetric keys can be either stored for use in multiple sessions or generated for one session only. While the public key can be made generally available, the private key should be closely guarded.

A public/private key pair is generated whenever a new instance of an asymmetric algorithm class is created. After a new instance of the class is created, the key information can be extracted using one of two methods:

• The ToXmlString method, which returns an XML representation of the key information.

• The ExportParameters method, which returns an RSAParameters structure that holds the key information.

Both methods accept a Boolean value that indicates whether to return only the public key information or to return both the public-key and the private-key information. An RSACryptoServiceProvider class can be initialized to the value of an RSAParameters structure by using the ImportParameters method.

Asymmetric private keys should never be stored verbatim or in plain text on the local computer. If you need to store a private key, you should use a key container. For more on how to store a private key in a key container, see How to: Store Asymmetric Keys in a Key Container.

Cisco crypto key generate rsa modulus. The following code example creates a new instance of the RSACryptoServiceProvider class, creating a public/private key pair, and saves the public key information to an RSAParameters structure.

See also

What Is Dynamic Key Generation X

• This alert has been successfully added and will be sent to:

  You will be notified whenever a record that you have chosen has been cited.

  To manage your alert preferences, click on the button below.

  Manage my Alerts

  Please log in to your account

• Save to Binder

  Create a New Binder

  Name

In this paper, we propose a new dynamic cryptographic key generation scheme for access control in a hierarchy. Our method can achieve the following three goals. First, the storage space needed to store public information is smaller than that required in previous work. Second, when a security class is added to the hierarchy, we assign a secret key and a public derivation key to the security class without affecting the keys of the other security classes in the hierarchy. Third, when a security class is deleted from the hierarchy, we simply erase the keys of that security class in the hierarchy and change the derivation key of its immediate ancestor.

1. {1} AKL, S.G. AND TAYLOR, P.D. 1983 Cryptographic solution to a problem of access control in a hierarchy. ACM Transactions on Computer Systems 1, 3 (July), 239-248. Google ScholarDigital Library
2. {2} CHANG, C.C., LIN, C.H., AND LEE, R.C.T. 1992 Hierarchy representations based on arithmetic coding for dynamic information protection systems. Information Sciences 64, 35-48. Google ScholarDigital Library
3. {3} CHANG, C.C. HWANG, R.J., AND Wu, T.C. 1992. Cryptographic key assignment scheme for access control in a hierarchy. Information Systems 17, 3, 243-247. Google ScholarDigital Library
4. {4} DENNING, D.E.R. 1982. Cryptography and Data Security. Addison-Wesley, Massachusetts. Google Scholar
5. {5} HARN, L. AND LIN, H.Y. 1990. A cryptographic key generation scheme for multilevel data security. Computers & Security 9, 6 (Oct.), 539-546. Google ScholarDigital Library
6. {6} HWANG, M.S., CHANG, C.C., AND YANG, W.P. 1993. Modified Chang-Hwang-Wu access control scheme. IEE Electronics Letters 29, 24 (Nov.), 2095-2096.Google ScholarCross Ref
7. {7} HWANG, M.S. AND YANG, W.P. 1995. A two-phase encryption scheme for enhancing database security. Journal of Systems and Software 31, 12 (Dec.), 257-265. Google ScholarDigital Library
8. {8} HWANG, M.S. AND YANG, W.P. 1995. Multilevel database security with subkeys. Submitted for publication.Google Scholar
9. {9} HWANG, M.S. 1997. A cryptolographic key assignment scheme in a hierarchy for access control. Mathematical and Computer Modelling 26, 2, 27-31. Google ScholarDigital Library
10. {10} HWANG, M.S. 1999. An improvement of a dynamic cryptographic key assignment scheme in a tree hierarchy. Computers & Mathematics with Applications 37, 3, 19-22.Google ScholarCross Ref
11. {11} HWANG, M.S. 1999. An improvement of novel cryptographic key assignment scheme for dynamic access control in a hierarchy. IEICE Transactions on Fundamentals E82-A, 3 (Mar.), 548-550.Google Scholar
12. {12} HWANG, M.S. 1999. Extension of CHW cryptographic key assignment scheme in a hierarchy. IEE Proceedings - Computers and Digital Techniques 146, 4 (July), 219.Google ScholarCross Ref
13. {13} KNUTH, D.E. 1980. The Art of Computer Programming, Vol. 2 (Seminumerical Algorithms), 2nd edition. Addison-Wesley, Massachusetts. Google Scholar
14. {14} LIAW, H.T., WANG, S.J., AND LEI, C.L. 1993. A dynamic cryptographic key assignment scheme in a tree structure. Computers and Math. with Applic. 25, 6, 109-114.Google ScholarCross Ref
15. {15} MACKINNON, S.J., TAYLOR, P.D., MEIJER, H., AND AKL, S.G. 1985. An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Transactions on Computers 34, 9 (Sep.), 797-802. Google Scholar
16. {16} SANDHU, R.S. 1988. Cryptographic implementation of a tree hierarchy for access control. Information Processing Letters 27, 95-98. Google ScholarDigital Library

1. A new dynamic key generation scheme for access control in a hierarchy

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

• Published in

  In-Cooperation

  Publisher

  Publishing Association Nordic Journal of Computing

  Finland

  Publication History

  Author Tags

  Qualifiers

  • article

  Funding Sources

• Article Metrics

  • Total Citations
    View Citations
  • Total Downloads

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0

  Other Metrics

Digital Edition

What Is Dynamic Key Generation Review

View this article in digital edition.

What Is Dynamic Key Generation 2