Home About us Contact
|
Home About us Contact | ||
|
|
||
Session Key (session + key)
Selected AbstractsA new mutual authentication and key exchange protocol with balanced computational power for wireless settingsEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 2 2004Chou-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] A novel key management scheme for dynamic multicast communicationsINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 1 2009Chin-Chen Chang Abstract Secure multicasting allows the sender to deliver an identical secret to an arbitrary set of recipients through an insecure broadcasting channel, whereas the unintended recipients cannot obtain the secret. A practical approach for securing multicast communications is to apply a session key to encrypt the transmitted data. However, the challenges of secure multicast are to manage the session keys possessed by a dynamic group of recipients and to reduce the overhead of computation and transmission when the membership is changed. In this paper, we propose a new key management scheme for dynamic multicast communication, which is based on privacy homomorphism and Chinese remainder theorem. Our scheme can efficiently and securely deliver an identical message to multiple recipients. In particular, the complexity of the key update process in our scheme is O(1). Copyright © 2008 John Wiley & Sons, Ltd. [source] A new privacy and authentication protocol for end-to-end mobile usersINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 9 2003Cheng-Chi Lee Abstract In this papecr, we propose a new privacy and authentication scheme for end-to-end mobile users. There are three goals in our scheme. The first allows two end-to-end mobile users to communicate privately each other. The second allows two end-to-end mobile users to distribute a session key simply. The third allows two end-to-end mobile users to mutually authenticate. Copyright © 2003 John Wiley & Sons, Ltd. [source] Scalable and fault-tolerant key agreement protocol for dynamic groupsINTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 3 2006A. 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] A public-key based authentication and key establishment protocol coupled with a client puzzleJOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, Issue 9 2003M.C. Lee Network Denial-of-Service (DoS) attacks, which exhaust server resources and network bandwidth, can cause the target servers to be unable to provide proper services to the legitimate users and in some cases render the target systems inoperable and/or the target networks inaccessible. DoS attacks have now become a serious and common security threat to the Internet community. Public Key Infrastructure (PKI) has long been incorporated in various authentication protocols to facilitate verifying the identities of the communicating parties. The use of PKI has, however, an inherent problem as it involves expensive computational operations such as modular exponentiation. An improper deployment of the public-key operations in a protocol could create an opportunity for DoS attackers to exhaust the server's resources. This paper presents a public-key based authentication and key establishment protocol coupled with a sophisticated client puzzle, which together provide a versatile solution for possible DoS attacks and various other common attacks during an authentication process. Besides authentication, the protocol also supports a joint establishment of a session key by both the client and the server, which protects the session communications after the mutual authentication. The proposed protocol has been validated using a formal logic theory and has been shown, through security analysis, to be able to resist, besides DoS attacks, various other common attacks. [source] | |||||||||||||