|
![](images/pix01.gif) |
|
|
|
Key Management Scheme for Controlling Access in Secure Authorization |
|
PP: 2691-2701 |
|
Author(s) |
|
Tsung-Chih Hsiao,
Tzer-Long Chen,
Yu-Fang Chung,
Tzer-Shyong Chen,
|
|
Abstract |
|
With the rapid development of the Internet, on which many users start to take action in putting personal or corporate
information and sharing them with everyone. The Internet is public as it were, if the limit of authority is not controlled to assure the
security, it is possible that those attackers could illegally access to important information and destroy them. Not only is personal privacy
invaded, but the mass properties are also damaged. Therefore, an effective access control system has been strongly emphasized in
modern societies. To fight against these network attacks, it is necessary to establish an effective and secure access control system. Here,
a scheme, a key management called Lagrange interpolation mainly takes an access control model as the framework, is proposed and
Elliptic Curve Cryptography system is used for enhancing the security. The reason of choosing Lagrange interpolation is that the key
used is randomized, no relationship between each key. With Elliptic Curve Cryptography system, it is expected to have attackers waste
their time dealing with Elliptic Curve Discrete Logarithm Problem. Once the prime number is big enough, attackers will have trouble
deciphering the key. An access control is comprehensive. For example, if the mobile agent technology is applied to an access control
and key management, it would waste space and cause some flaws in the security.Moreover, there are still a lot of works to do on medical
applications. Hence, these schemes are proposed for mobile agents in order to reach the improvement and then analyze the security and
try to simulate what attackers will do. Four common attacks, namely External Collective Attack, Internal Attack, Collusion Attacks and
Equation Breaking Attack are concluded. As results, attackers are hard to decipher the key because of no relationship between each
key and will have to face Elliptic Curve Discrete Logarithm Problem. It is confirmed that the proposed schemes can be safer and more
efficient in protecting mobile agents. |
|
|
![](images/pix01.gif) |
|
|