Search

Authenticated key exchange protocols represent an important cryptographic mechanism that enables several parties to communicate securely over an open network. Elashry, Mu, and Susilo proposed an identity-based authenticated key exchange (IBAKE) protocol where different parties establish secure communication by means of their public identities.The authors also introduced a new security notion for IBAKE protocols called resiliency, that is, if the secret shared key is compromised, the entities can generate another shared secret key without establishing a new session between them. They then claimed that their IBAKE protocol satisfies this security notion. We analyze the security of their protocol and prove that it has a major security flaw, which renders it insecure against an impersonation attack. We also disprove the resiliency property of their scheme by proposing an attack where an adversary can compute any shared secret key if just one secret bit is leaked. [ABSTRACT FROM AUTHOR]

In this paper, the random access procedure of Universal Mobile Telecommunications System network is investigated. We have proposed a model based on communicating timed automata that represents the main functions related to the random access procedure including the user equipment, the base station (node B or BTS), and the channel. Then, we have used computational tree logic formula to specify the proprieties to be verified. The model and the formulas serve as inputs to the model checker, which is used as a verification engine, ie, UPPAAL and SPIN. The formal verification approach shows that the protocol has several drawbacks that may not be detected by simulation. [ABSTRACT FROM AUTHOR]

Authentication schemes have been widely deployed access control and mobility management in various communication networks. Especially, the schemes that are based on multifactor authentication such as on password and smart card come to be more practical. One of the standard authentication schemes that have been widely used for secure communication over the Internet is session initiation protocol (SIP). The original authentication scheme proposed for SIP was vulnerable to some crucial security weaknesses. To overcome the security problems, various improved authentication schemes have been developed, especially based on elliptic curve cryptography (ECC). Very recently, Zhang et al. proposed an improved authentication scheme for SIP based on ECC using smart cards to overcome the security flaws of the related protocols. Zhang et al. claimed that their protocol is secure against all known security attacks. However, this paper indicates that Zhang et al. protocol is still insecure against impersonation attack. We show that an active attacker can easily masquerade as a legal server to fool users. As a remedy, we also improve Zhang et al. protocol by imposing a little extra computation cost. Copyright © 2014 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The SMEN protocol, proposed by Wu and Ustaoglu in 2009, has been considered to be secure as the authors claimed, and numerous theories are proposed based on this protocol. This paper analyzes the SMEN protocol and finds that this protocol is not resistant to the session corruption attack and the key compromise impersonation attack. Then, we propose an improved protocol with tight security reduction. Our improved protocol not only avoids the above attacks but also embraces the same efficiency as the SMEN protocol in terms of exponentiation. Besides, formal analysis of the improved protocol is presented by using the formal automatic security analysis tool Scyther. Copyright © 2014 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY In this paper, we first showed that Lou and Huang's three-party password-based key exchange protocol is still vulnerable to offline dictionary attacks. Thereafter, we proposed an enhanced protocol that can defeat the attack described and yet is efficient. Finally, we provided the rigorous proof of the security for it. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY Password-authenticated group key exchange protocols enable communication parties to establish a common secret key (a session key) by only using short secret passwords. Such protocols have been receiving significant attention. This paper shows some security weaknesses in some recently proposed password-authenticated group key exchange protocols. Furthermore, a secure and efficient password-authenticated group key exchange protocol in mobile ad hoc networks is proposed. It only requires constant round to generate a group session key under the dynamic scenario. In other words, the overhead of key generation is independent of the size of a total group. Further, the security properties of our protocol are formally validated by a model checking tool called AVISPA. Security and performance analyses show that, compared with other related group key exchange schemes, the proposed protocol is also efficient for real-world applications in enhancing the security over wireless communications. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY A fault-tolerant group key agreement is an essential infrastructure for Internet communication among all involved participants; it can establish a secure session key no matter how many malicious participants exit simultaneously in an effort to disrupt the key agreement process. Recently, Zhao et al. proposed an efficient fault-tolerant group key agreement protocol named efficient group key agreement that can resist denial-of-service attacks, reply attacks, man-in-middle attacks, and common modulus attacks; it can also preserve forward secrecy with lower computational cost than previous protocols. We show that it is still vulnerable to active attacks by malicious participants and modify the corresponding security weakness adaptively. Furthermore, we propose an efficient fault-tolerant group key agreement based on a binary tree structure and enhance it to a dynamic setting where participants can leave or join the group arbitrarily according to their preferences with instant session key refreshment. Additionally, our session key refreshment is based on secure key updating to protect forward/backward confidentiality and is resistant to active/passive attacks. The performance analysis shows that our proposed protocol has lower computational cost and little additional communication cost exploiting dynamic setting. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY Three-party password-authenticated key exchange (3PAKE) protocols allow entities to negotiate a secret session key with the aid of a trusted server with whom they share a human-memorable password. Recently, Lou and Huang proposed a simple 3PAKE protocol based on elliptic curve cryptography, which is claimed to be secure and to provide superior efficiency when compared with similar-purpose solutions. In this paper, however, we show that the solution is vulnerable to key-compromise impersonation and offline password guessing attacks from system insiders or outsiders, which indicates that the empirical approach used to evaluate the scheme's security is flawed. These results highlight the need of employing provable security approaches when designing and analyzing PAKE schemes. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY This paper focuses on two interesting radio-frequency identification (RFID) cryptographic protocols: the server-less RFID authentication protocol that allows readers to authenticate tags without the help of any online backend servers, and the RFID searching protocol in which the verifier explicitly specifies the target tag to be searched and authenticated. These two kinds of RFID protocols play important roles in many RFID applications; however, the existing protocols either had security weaknesses or exhibited poor efficiency. This paper shows the weaknesses, and then proposes our server-less RFID authentication protocol and RFID searching protocol. The proposed protocols greatly enhance the security using one more hashing. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

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]

Radio-frequency identification (RFID) technology enables the identification and tracking of objects by means of the wireless signals emitted by a tag attached to the objects of interest. Without adequate protection, however, malicious attackers can easily eavesdrop, scan or forge the information within the tag, thereby threatening the integrity of the system. Previous research has shown that the basic security requirements of RFID systems, i.e. identity authentication, information privacy and location privacy, can be satisfied using conventional cryptographic components. However, such components are expensive, and therefore conflict with the general requirement for low-cost tag designs. Accordingly, this paper presents a low-cost challenge-response security protocol designated as the hidden mutual authentication protocol (HMAP) to accomplish both a mutual authentication capability between the tag and the reader and information privacy. The results show that HMAP provides an efficient means of concealing the authentication messages exchanged between the tag and the reader and is robust toward replay attacks. In addition, it is shown that HMAP is easily extended to provide complete location privacy by utilizing a hash function to generate different tag identifiers in each authentication session. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

A secure architecture is proposed in the home/office networking environment with a special appliance, called Building Security Gateway (BSG), for cheap SIP devices and unsupported soft user agents (UAs) performing security functions successfully, such as construction of secure sessions and encrypting/decrypting media. Therefore, we apply BSG procedure to VoIP for getting secure session. Furthermore, VoIP call monitoring and intercepting functions are also implemented in BSG. Secure session monitoring is supported in this architecture. A prototype BSG is built in a home/office network, and BSG-based session mobility cases between UAs are examined and the protocol primitives for security and call intercepting are verified. Copyright © 2010 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]

To provide a multicasting service, several multicast protocols for mobile hosts (MHs) have been proposed. However, all of these protocols have faults, such as non-optimal delivery routes and data loss when hosts move to another network, resulting in insecure multicast data transmissions. Thus, this paper presents a new reliable and efficient multicast routing protocol for mobile IP networks. The proposed protocol provides a reliable multicast transmission by compensating the data loss from the previous mobile agent when a MH moves to another network. In addition, an additional function allows for direct connection to the multicast tree according to the status of agents, thereby providing a more efficient and optimal multicast path. The performance of the proposed protocol is confirmed based on simulations under various conditions. Copyright © 2008 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The communications environment is currently well organized. Still, it is not easy to handle requirements for urgent communications in a disaster. In a large-scale disaster, it is highly probable that communications functions will be hampered, making access to communication links itself difficult. There is a need for studies directed at assuring robustness and reliability in the emergency communications system. This paper proposes an access protocol for wireless networks in which the centralized control hierarchical network and the horizontal connection ad hoc network are combined. The routing method in which a terminal that cannot directly communicate with the base station (BS) sends urgent data to the BS through neighboring terminals, and an access control protocol for multihopping, are described. In the proposed scheme, the terminal monitors communications in neighboring nodes and dynamically generates a route based on the number of hops to the BS. Evaluations show that the percentage of terminals that can reach the BS by multihopping involving a few hops is significantly improved. It is also shown that the terminal knows the number of hops to the BS in the proposed method, which makes it possible to predict the throughput and the delay time, which is a property suited to urgent communications. © 2005 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 88(7): 52–64, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.20141 [ABSTRACT FROM AUTHOR]

In this paper, the various protocols used to achieve node mobility on the Internet are compared and evaluated. Node mobility can be defined as hiding from the application or user changes in the connection point to the Internet of the terminal. Node mobility can be broken down into two forms of mobility: wide area mobility and local mobility. Wide area mobility can be achieved by satisfying two factors: mobile node reachability and communication continuity. Local mobility can be achieved by satisfying two factors: packet loss avoidance and control traffic suppression. In this paper, the various proposed protocols for achieving node mobility are analyzed, and the methods used to satisfy the above factors are classified. Each classified method is then analyzed and evaluated from the standpoint of communication efficiency, scalability, security, fault tolerance, and ease of implementation. In addition, specific examples are given for the representative protocols. © 2005 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 88(6): 39–59, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20173 [ABSTRACT FROM AUTHOR]

IP traceback is a technique to combat distributed denial of service attacks. This technique can specify the routers in the path of the attack flow with forged source addresses. Although several techniques have been proposed to solve this problem, a variety of problems arise when operating on the actual Internet. We proposed a hierarchical architecture for IP traceback as a solution to these problems. In this paper, we define each type of protocol, design architecture for a prototype implementation, and verify its operation. Based on the results, we found that a large-scale simulation was needed. © 2004 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 87(11): 49–56, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.10202 [ABSTRACT FROM AUTHOR]

In order to realize high-speed Internet access on PTMP access networks such as bidirectional CATV, the Synchronous CSMA/CD method has been developed. The main points are that, when multiple packets collide, the collision state always starts from the head of the colliding packets by synchronizing the arrival of the packets at the hub device with the predetermined timing, and that the hub device always monitors the access status of the uplink and broadcasts the status through the downlink. As a result, the CSMA/CD method can be applied to PTMP networks, and the maximum network length can be arbitrarily set without dependence on the minimum packet length. © 2004 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 87(6): 43–51, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.10074 [ABSTRACT FROM AUTHOR]

Most of Internet intra-domain routing protocols (OSPF, RIP, and IS–IS) are based on shortest path routing. The path length is defined as the sum of metrics associated with the path links. These metrics are often managed by the network administrator. In this context, the design of an Internet backbone network consists in dimensioning the network (routers and transmission links) and establishing the metric. Many requirements have to be satisfied. First, Internet traffic is not static as significant variations can be observed during the day. Second, many failures can occur (cable cuts, hardware failures, software failures, etc.). In this paper, we present algorithms (meta-heuristics and greedy heuristic) to design Internet backbone networks, taking into account the multi-hour behaviour of traffic and some survivability requirements. Many multi-hour and protection strategies are studied and numerically compared in this paper. Our algorithms can be extended to integrate other quality of service constraints. Copyright © 2002 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Summary: In this, we propose a generalized partial relay selection (PRS) protocol to enhance the secrecy performance for cooperative cognitive radio networks (CRNs) in terms of the secrecy outage probability (SOP) and the probability of non‐zero secrecy capacity (NSC). In the proposed scheme, a secondary source communicates with a secondary destination via the assistance of multiple secondary relays, in the presence of multiple secondary eavesdroppers and multiple primary users (PUs). With a reliance on the source‐relay channel state information (CSI), the source selects a group of the potential relays, and one is then chosen to forward the source data to the secondary destination using the randomize‐and‐forward (RF) technique. We consider the relay selection methods in two practical cases, where the CSIs of the eavesdropping links are available or not available. For the performance evaluation and comparison, we derived exact and asymptotic SOP and NSC closed‐form expressions for the proposed protocols and the corresponding full relay selection (FRS) protocol over Rayleigh‐fading channels. Finally, Monte Carlo simulations are presented to confirm the theoretical‐derivation correction. The results confirmed that the proposed protocols can outperform the conventional PRS protocols by designing the number of the potential relays appropriately. We propose a generalized partial relay selection (PRS) protocol to enhance the secrecy performance for cooperative cognitive radio networks (CRNs) in terms of the secrecy outage probability (SOP) and the probability of non‐zero secrecy capacity (NSC). [ABSTRACT FROM AUTHOR]

The IEEE 802.15.6 standard for wireless body area network (WBAN) includes a slotted Aloha based protocol as an option for contention based medium access control. This protocol is different from the long studied classical version in that it has inherent considerations for certain priorities of users. An analytical model is presented for saturation throughput with this protocol in a network that is heterogeneous in user priorities. The model is validated against simulation. [ABSTRACT FROM AUTHOR]