Home  About us  Contact
 

Exchange Protocol (exchange + protocol)

Distribution by Scientific Domains
Information Science and Computing50%

Kinds of Exchange Protocol

  • key exchange protocol
    		•

    Selected Abstracts

    A new mutual authentication and key exchange protocol with balanced computational power for wireless settings

    EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 2 2004
    Chou-Chen Yang
    Mutual authentication and key exchange protocols (MAKEP) provide two parties in communication with guarantee of true identity. And then the two parties end up sharing a common session key for privacy and data integrity during the session. In MAKEP, public-key-based schemes and symmetric-key-based schemes are often used. However, the former requires high computation complexity and hence, it is not suitable for applications in wireless settings. The latter has to maintain many distinct keys for different parties. Wong et al. proposed the Linear MAKEP to solve these problems. But in term of storage space, it is not optimal. In this paper, we propose a scheme that uses the geometric properties of line to achieve mutual authentication and key exchange. Compared with Wong et al.'s scheme, our scheme is efficient and requires less storage space. It can withstand the replay attack and the unknown key-share attack, and the server does not bear much more computation cost than the client in each session, hence we call it a protocal with balanced computational power. Copyright © 2004 AEI [source]

    Architecture for dynamic and fair distribution of bandwidth

    INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 5 2006
    Vasil Hnatyshin
    The problem of fair distribution of available bandwidth among traffic flows or aggregates remains an essential issue in computer networks. This paper introduces a novel approach, called the Exact Bandwidth Distribution Scheme (X-BDS), for dynamic and fair distribution of available bandwidth among individual flows. In this approach, the edge routers keep per-flow information, while the core routers maintain the aggregate flow requirements. The X-BDS approach employs a distributed message exchange protocol for providing network feedback and for distributing aggregate flow requirements among the nodes in the network. Based on the obtained feedback, the edge routers employ the X-BDS resource management unit to dynamically distribute available bandwidth among individual flows. The X-BDS admission control and resource management units are responsible for fair resource allocation that supports minimum bandwidth guarantees of individual flows. This paper evaluates the Bandwidth Distribution Scheme through simulation and shows that the X-BDS is capable of supporting per-flow bandwidth guarantees in a dynamically changing network environment. Copyright © 2006 John Wiley & Sons, Ltd. [source]

    Scalable and fault-tolerant key agreement protocol for dynamic groups

    INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 3 2006
    A. Abdel-Hafez
    With the widespread use of the Internet, the popularity of group communication-based applications has grown considerably. Since most communications over the Internet involve the traversal of insecure networks, basic security services are necessary for these collaborative applications. These security services can be facilitated if the authorized group members share a common secret. In such distributed applications, key agreement protocols are preferred to key distribution protocols. In the past two decades, there have been many proposals for key agreement protocols. Most of these protocols are not efficient and limit the size of the underlying group. In this paper, we consider the scalability problem in group key agreement protocols. We propose a novel framework based on extension of the Diffie,Hellman key exchange protocol. The efficiency of our protocol comes from the clustering of the group members, where the common session key is established collaboratively by all participants. We present the auxiliary protocols needed when the membership changes. We show that our protocol is superior in complexity in both communication and computation overheads required to generate the session key. Copyright © 2006 John Wiley & Sons, Ltd. [source]

    CDMA 1x Ev-DO security

    BELL LABS TECHNICAL JOURNAL, Issue 4 2007
    Semyon Mizikovsky
    CDMA 1x evolution,data optimized (1x EV-DO) is defined in the TIA/EIA IS-856 and IS-835 standards. The security of 1x EV-DO offers authentication, integrity, and encryption capabilities. 1x EV-DO supports authentication of the access terminal (AT) to authorize access to the wireless network, as well as authentication of a subscription to authorize access to the Internet Protocol (IP) network. The system also provides session security via re-authenticating the AT during a session to prevent 1x EV-DO session hijacking and to protect integrity of the user packets. This paper will outline security threats to the 1x EV-DO system, security algorithms, authentication and authorization procedures, and ciphering procedures. The 1x EV-DO security will be detailed here for key exchange, authentication, and encryption functions by supporting the following protocols: security protocol, key exchange protocol, authentication protocol, and encryption protocol. Finally, a summary of 1x EV-DO security evolution will be presented © 2007 Alcatel-Lucent. [source]

    A new mutual authentication and key exchange protocol with balanced computational power for wireless settings

    EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 2 2004
    Chou-Chen Yang
    Mutual authentication and key exchange protocols (MAKEP) provide two parties in communication with guarantee of true identity. And then the two parties end up sharing a common session key for privacy and data integrity during the session. In MAKEP, public-key-based schemes and symmetric-key-based schemes are often used. However, the former requires high computation complexity and hence, it is not suitable for applications in wireless settings. The latter has to maintain many distinct keys for different parties. Wong et al. proposed the Linear MAKEP to solve these problems. But in term of storage space, it is not optimal. In this paper, we propose a scheme that uses the geometric properties of line to achieve mutual authentication and key exchange. Compared with Wong et al.'s scheme, our scheme is efficient and requires less storage space. It can withstand the replay attack and the unknown key-share attack, and the server does not bear much more computation cost than the client in each session, hence we call it a protocal with balanced computational power. Copyright © 2004 AEI [source]

    The kinetics of competitive antagonism of nicotinic acetylcholine receptors at physiological temperature

    THE JOURNAL OF PHYSIOLOGY, Issue 4 2008
    Deeptankar Demazumder
    Detailed information about the ligand-binding site of nicotinic acetylcholine receptors has emerged from structural and mutagenesis experiments. However, these approaches provide only static images of ligand,receptor interactions. Kinetic measurements of changes in protein function are needed to develop a more dynamic picture. Previously, we measured association and dissociation rate constants for competitive inhibition of current through embryonic muscle acetylcholine receptor channels at 25°C. Little is known about competitive antagonism at physiological temperatures. Here, we performed measurements at 37°C and used thermodynamics to estimate the energetics of antagonism. We used rapid solution exchange protocols to determine equilibrium and kinetics of inhibition of acetylcholine-activated currents in outside-out patches by (+)-tubocurarine, pancuronium and cisatracurium. Kinetic rates as high as 600 s,1 were resolved by this technique. Binding was primarily enthalpy driven. The 12°C increase in temperature decreased equilibrium antagonist binding by 1.7- to 1.9-fold. In contrast, association and dissociation rate constants increased 1.9- to 6.0-fold. Activation energies for dissociation were 90 ± 6, 106 ± 8 and 116 ± 10 kJ mol,1 for cisatracurium, (+)-tubocurarine and pancuronium, respectively. The corresponding apparent activation energies for association were 38 ± 6, 85 ± 6 and 107 ± 13 kJ mol,1. The higher activation energy for association of (+)-tubocurarine and pancuronium compared with cisatracurium is notable. This may arise from either a more superficial binding site for the large antagonist cisatracurium compared to the other ligands, or from a change in receptor conformation upon binding of (+)-tubocurarine and pancuronium but not cisatracurium. Differences in ligand desolvation and ligand conformation are not likely to be important. [source]