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

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 serv...

Full description

Saved in:
Bibliographic Details
Published inDefense science journal Vol. 66; no. 6; pp. 590 - 593
Main Authors Kumaraswamy, P., Rao, C.V. Guru, Janaki, V., Prashanth, K.V.T.K.N.
Format Journal Article
LanguageEnglish
Published New Delhi Defence Scientific Information & Documentation Centre 01.11.2016
Subjects
Authentication
Availability
Cryptography
Defense industry
Exchange
Logarithms
Military applications
Network security
Public Key Infrastructure
Servers
Theorems
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0011-748X
0976-464X
DOI:10.14429/dsj.66.9649