Key Authentication Scheme-based on Discrete Logarithms and Chinese Remainder Theorem

Defence Science Journal

K.V.T.K.N. Prashanth¹  P. Kumaraswamy¹  V. Janaki¹  C.V. Guru Rao¹ 

[1] Department of Computer Science and Engineering, S.R. Engineering College, Warangal - 506 371, India

关键词: Certificate;    authentication;    chinese remainder theorem;    discrete logarithms;    confidentiality;    non-repudiation;    public key cryptosystem;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: Defence Scientific Information & Documentation Centre

【 摘 要 】

Public key cryptosystems are secure only when the authenticity of the public key is assured. Shao proposed a new scheme to overcome the problems of the existing schemes, which suffers from two major drawbacks. The first drawback is the availability of users’ passwords in plaintext format in key server which are prone to attacks by ill-minded users. The second one is depending on the key server blindly for certificate generation, without further verification by the user. To overcome these severe drawbacks, we proposed an improved key authentication scheme based on Chinese remainder theorem and discrete logarithms. Our scheme allows the user to generate his/ her certificate without the help of any trusted third party. This scheme is intended for online services, military and defense applications to exchange keys securely.  

【 授权许可】

Unknown