A New Public Key Signcrypted Challenge Response Identification (PKS-CR-ID) Protocol Using Smart Cards

Abstract

How to prove yourself? This is the problem. Secure civilian and military identification protocols are very important and useful cryptographic tool. In computer network security, the secure personal identification protocol is an interactive proof system; the prover and verifier exchange multiple messages in multi-passes typically dependent on random numbers which they keep secret. In military aircraft identification friend or foe (IFF) systems, the aircraft can identify itself to the ground station using two-pass challenge-response identification protocol in real time process to distinguish friendly from hostile aircraft. In this paper, a new Public Key Signcrypted two-pass Challenge Response Identification (PKS-CR-ID) protocol using smart card is proposed. The PKS-CR- ID scheme is based on the intractability of the discrete logarithm problem. Using the minimum security parameters recommended for use in current practice and comparing with the Schnorr and Okamoto identification schemes which are the recent most attractive practical identification schemes, the numerical results for the proposed scheme has a saving in communication overhead by about 56% over Schnorr and 65% over Okamoto identification schemes. The proposed scheme uses the Advanced Encryption Standard algorithm which satisfies today's security, speed and memory requirements. PKS-CR-ID scheme has an efficient computation time due to the saving in communication overhead which satisfies the real time process and it is designed to resist the advanced identification attacks using random challenges and timestamps techniques.