In vehicular ad hoc networks, establishing a secure channel between any two vehicles is fundamental. Authenticated key agreement is a useful mechanism, which can be used to negotiate a shared key for secure data transmission between authentic vehicles in vehicular ad hoc networks. Among the existing identity-based two-party authenticated key agreement protocols without pairings, there are only a few protocols that provide provable security in strong security models such as the extended Canetti-Krawczyk model. This article presents an efficient pairing-free identity-based one-round two-party authenticated key agreement protocol with provable security, which is more suitable for real-time application environments with highly dynamic topology such as vehicular ad hoc networks than the existing identity-based two-party authenticated key agreement protocols. The proposed protocol is proven secure under the passive and active adversaries in the extended Canetti-Krawczyk model based on the Gap Diffie-Hellman assumption. The proposed protocol can capture all essential security attributes including known-session key security, perfect forward secrecy, basic impersonation resistance, key compromise impersonation resistance, unknown key share resistance, no key control, and ephemeral secrets reveal resistance. Compared with the existing identity-based two-party authenticated key agreement protocols, the proposed protocol is superior in terms of computational cost and running time while providing higher security.
A secure and efficient mobile IP (MIP) registration protocol using certificateless signature scheme is proposed. The protocol minimises the registration time through minimal usage of an efficient certificateless signature scheme between a foreign agent (FA) and a home agent (HA). Protocol parameters can be kept resynchronised by reusing the initial values in the MIP registration in case the synchronisation between a mobile node (MN) and HA is lost. User anonymity is achieved via a temporary identity transmitted by a mobile user, instead of its true identity. Additional replay protection from the FA is included in the registration messages to prevent a possible replay attack. Numerical results and performance analyses demonstrate that the proposed protocol outperforms the existing ones in terms of the registration time, registration signalling traffic and computational load on an MN while providing improved security. For example, the proposed protocol reduces the registration time up to 83% compared with the protocol from Yang.
In order to address the anonymous batch authentication problem of a legal reader to many tags in RFID (Radio Frequency Identification) system, an efficient RFID anonymous batch authentication protocol was proposed based on group signature. The anonymous batch authentications of reader to many tags are achieved by using a one-time group signature based on Hash function; the authentication of the tag to the reader is realized by employing MAC (Message Authentication Code). The tag's anonymity is achieved via the dynamic TID (Temporary Identity) instead of the tag's identity. The proposed protocol can resist replay attacks by using random number. Theoretical analyses show that, the proposed protocol reaches the expected security goals. Compared with the protocol proposed by Liu, the proposed protocol reduces the computation and storage of the server and tag while improving the security. 2010 Mathematics Subject Classification. 97R50.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.