Private Key Management Schemes for Mobile Agents
Date Issued
2012
Date
2012
Author(s)
Chen, Tzer-Long
Abstract
With the rapid development of computer techniques and internet, many resources are shared through the internet nowadays. The problems of access control arise naturally as the resources are shared over the internet. It is important to notice that the access control mechanism has been widely applied in various areas, such as on-line video systems, wireless network, and electronic documents. It is hence important to construct an access control mechanism based upon which data can be accessed efficiently and securely. There are some common access control problems: demand of unauthorized access, data invasion or destruction, privileges inconsistency, and privacy leakage. These imply that the access control problem is worth of further study.
The access control and key management mechanism proposed by Volker and Mehrdad based on mobile agents is not secure and the agents themselves take up a lot of storage space. We hence propose three access control mechanisms for mobile agents which are constructed based on three different mathematical fundamentals: Chinese remainder theorem, Lagrange interpolation, and Elliptic curve cryptography. The Chinese remainder theorem is used in scheme one to construct an access control scheme, which is easy to understand and can be implemented in various applications, such as on-line video systems. The Lagrange interpolation and ElGamal algorithm are used in scheme two to enhance security. The security of scheme two is higher than that of scheme one so that it can be applied to an environment which requires higher security, such as banking systems or insurances systems. The Elliptic curve cryptography and Date-constraint are used in scheme three. Therefore, scheme three can be applied to environments which require even more security. For instance, it can be implemented in a medical institution to evaluate and supervise doctors’ work schedules. The new schemes constructed in this study remedy the defects of the security mechanisms proposed by a number of previous related researches to enhance the performance of key management. We conduct numerical experiments to compare the efficiency of our proposed schemes with that of several related published schemes in both key generation phase and key derivation phase. Our new schemes are proved to be more efficient and more secure in protecting the mobile agents. We also conduct numerical experiments to compare the three schemes constructed in this study. It is shown, as expected, a more efficient scheme provides relatively less security and a more secure scheme is relatively less efficient for private keys of the same size.
Subjects
Mobile Agent
Access Control
Key Management
Elliptic Curve Cryptosystem
Chinese Remainder Theorem
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
index.html
Size
23.27 KB
Format
HTML
Checksum
(MD5):8bdceec8bc83bf83e5740a1dc4981242