Search

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]

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]

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]