Search

In this work, we describe a security solution that can be used to securely establish mobile payment transactions over the Near-Field Communication (NFC) radio interface. The proposed solution is very lightweight one; it uses symmetric cryptographic primitives on devices having memory and CPU resources limitations. We show that our approach maintains the security of NFC communications and we further demonstrate that our solution is simple, scalable, cost-effective, and incurs minimal computational processing overheads. [ABSTRACT FROM AUTHOR]

Abstract: Wireless sensor network have received much attention due to its realistic, meaningful, and potential applications ranging from military to non-military types of applications. The wireless sensor network is prone to various attacks such as impersonation, eavesdropping, data medication and physical of capture of a node. Thus, how to balance the level of security versus the resource limitations of nodes is a main challenge to design a secure key exchange protocols for wireless sensor networks. In this paper, we proposed an improvement protocols so that proposed protocols can be suitable for wireless sensor networks using Tate pairing [Copyright &y& Elsevier]

In 2009, Huang ( Int. J. Commun. Syst., 22, 857-862) proposed a simple and efficient three-party password-based key exchange protocol without server's public key. This work shows that the protocol could be vulnerable to an undetectable online password guessing attack. Furthermore, an improved protocol is proposed to avoid the attack. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In three-party password-based key exchange protocol, a client is allowed to share a human-memorable password with a trusted server such that two clients can negotiate a session key to communicate with each other secretly. Recently, many three-party password-based key exchange protocols have been developed. However, these proposed schemes cannot simultaneously achieve security and efficiency. Based on elliptic curve cryptography (ECC), this paper will propose a new simple three-party password-based authenticated key exchange scheme. The proposed method not only reduces computation cost for remote users and a trusted server but also is more efficient than previously proposed schemes. It is better suited for resource constrained devices, such as smart cards or mobile units. Copyright © 2010 John Wiley & Sons, Ltd. Recently, many three-party password-based key exchange protocols have been developed. However, these proposed schemes cannot simultaneously achieve security and efficiency. Based on elliptic curve cryptography (ECC), this paper, will propose a new simple three-party password-based authenticated key exchange protocol. The proposed method not only reduces computation cost for remote users and a trusted server but also is more efficient than previously proposed schemes. It is better suited for resource constrained devices, such as smart cards or mobile units. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In three-party password-based key exchange (3PAKE) protocol, a client is allowed to share a human-memorable password with a trusted server such that two clients can agree on a secret session key for secure connectivity. Recently, many 3PAKE protocols have been developed. However, not all of them can simultaneously achieve security and efficiency. Without any server's public key, this article will propose a simple three-party password-based authenticated key exchange scheme. Compared with the existing schemes, the proposed scheme is not only more efficient, but also is secure. Copyright © 2009 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In recent years, several anonymous routing protocols for wireless ad hoc networks have been proposed. In 2007, Lu, Cao, Wang, and Sun proposed a secure routing protocol with anonymity property and key exchange for ad hoc networks. However, in this paper, it is demonstrated that the so-called secure, anonymous key exchange protocol introduced by Lu et al. is vulnerable to a passive attack and, as a result, the anonymity property of the protocol may be compromised. A simple improvement is suggested to eliminate the vulnerability. [ABSTRACT FROM AUTHOR]

Menezes et al. developed an MQV key exchange protocol that does not use a one-way hash function in 1995. Harn–Lin and Hwang–Shiau–Lai later respectively proposed efficient authenticated key exchange protocols. Lee and Wu recently proposed an enhanced authentication key exchange protocol to solve the drawbacks of the Hwang–Shiau–Lai protocol. Based on the Lee–Wu protocol, this work presents two new authenticated multiple key exchange protocols based on ECC and bilinear pairing. The proposed ECC-based protocol is more efficient than the Harn–Lin, Hwang–Shiau–Lai, and Lee–Wu protocols. Moreover, the proposed pairing-based protocol is better than other protocols in terms of the number of available shared session keys because all agreed session keys can be adopted by the communicating parties in the protocol. [Copyright &y& Elsevier]

Abstract: We show how cryptographic protocols using Diffie–Hellman primitives, i.e., modular exponentiation on a fixed generator, can be encoded in Horn clauses modulo associativity and commutativity. In order to obtain a sufficient criterion of security, we design a complete (but not sound in general) resolution procedure for a class of flattened clauses modulo simple equational theories, including associativity–commutativity. We report on a practical implementation of this algorithm in the MOP modular platform for automated proving; in particular, we obtain the first fully automated proof of security of the IKA.1 initial key agreement protocol in the so-called pure eavesdropper model. [Copyright &y& Elsevier]

Recently, Hsu et al. showed that Ku and Wang''s authenticated key agreement protocol is vulnerable to the modification attack and then proposed an improved protocol, called HWWM protocol. In this paper, we argue that the HWWM protocol is still vulnerable to the modification attack and cannot also withstand the password guessing attack. Then, we propose an improved protocol to solve these problems. [Copyright &y& Elsevier]