Session Key Distribution Research Articles

Authenticated Session Key Distribution Protocol with Zero-Knowledge

Authenticated session key distribution protocol is an important cryptographic technique in the secure communication areas. We present a new method for the authenticated exchange of messages in the three-party case, and abandon the idea of authentication which was finished with encryption and decryption in the Bellare-Rogaway model. Instead, the non-interactive zero-knowledge is applied to our protocol. We give an illumination for some important properties of security and depict a feasible idea of provably security with zero-knowledge.

Erratum to: Effective session key distribution for secure fast handover in mobile networks

Erratum to: Effective session key distribution for secure fast handover in mobile networks

Effective session key distribution for secure fast handover in mobile networks

In this paper, we introduce a session key distribution mechanism for fast secure handover in wireless mobile networks. The proposed mechanism is based on the stream control transmission protocol in where a mobile node actively changes its IP address without its connection loss. When a mobile node moves between different access routers, the required session key at a new access router is distributed previously through the tunnel established between the previous access router and the new access router. Due to the reduced key distribution time, the mobile node achieves its secure seamless handover. The provided performance analysis proves that the proposed mechanism provides the reduced signaling cost compared to existing mobility protocols. In addition, the proposed mechanism reduces the handover latency so that the reduced amount of packet loss provides the stable handover performance for real-time applications.

Extensible Authentication Protocol Overview and Its Applications

The Extensible Authentication Protocol (EAP) is an authentication framework that supports multiple authentication mechanisms [38] between a peer and an authentication server in a data communication network. EAP is used as a useful tool for enabling user authentication and distribution of session keys. There are numerous EAP methods that have been developed by global SDOs such as IETF, IEEE, ITU-T, and 3GPP. In this paper, we analyze the most widely deployed EAP methods ranging from the EAP-TLS [27] to the EAP-PSK [25]. In addition, we derive the security requirements of EAP methods meet, evaluate the typical EAP methods in terms of the security requirements, and discuss the features of the existing widely-deployed EAP methods. In addition, we identify two typical use cases for the EAP methods. Finally, recent global standardization activities in this area are reviewed.

Protection of LAN-wide, P2P interactions: a holistic approach

This article advocates the need of a holistic approach to protect LAN interactions and presents a solution for implementing it based on secure LAN (SLAN), a novel security architecture. SLAN uses the 802.1X access control mechanisms and is supported by a key distribution centre (KDC) built upon an 802.1X authentication server. The KDC is used, together with a new host identification policy and modified DHCP servers, to provide proper resource allocation and message authentication in DHCP transactions. The KDC is used to authenticate ARP transactions and to distribute session keys to pairs of LAN hosts, allowing them to set up arbitrary, LAN-wide peer-to-peer security associations using such session keys. We show how PPPoE and IPSec security associations may be instantiated and present a prototype implementation for IPSec.

A PK-SIM card based end-to-end security framework for SMS

Since the first SMS (Short Message Services) message was sent in the UK in 1992, the SMS has become a mass communication tool and has been broadly used in mobile business applications. But the security issue of the SMS has often been considered as a crucial barrier to its application in many fields that need strong authentication and confidentiality, such as mobile-commerce. The Subscriber Identity Module (SIM) inside mobile phones is a tamper resistant device which contains strong authentication mechanism and has been used in remote user authentication system, e.g. WIM 1 1 WAP Identity Module (WIM) is the security module implemented in the SIM card for WAP applications. It is based on the WAP 1.2 specification enabling secure transactions and non-repudiation based on a digital signature. card in Wireless Application Protocol (WAP). In this contribution, we design and realize a secure SIM card, named PK-SIM card, which is a standard SIM card with additional PKI functionality; based on the PK-SIM card, we present a security framework offering solutions for the development of secure mobile business applications using SMS as bearer. The security framework consists of a client device, in which a PK-SIM card is used to store security credentials, a Secure Access Gateway (SAG) which is used to receive and send secure SMS messages, a trusted third-party, Certification Authority (CA), which provides a public-key certification service and a Mobile Operator which provides the communication infrastructure for the SMS. Then we propose an authentication and session key distribution protocol which provides end-to-end security between the PK-SIM card and the SAG, and give a formal security analysis to the proposed protocol based on BAN authentication logic 2 2 Burrows-Abadi-Needham logic (also known as the BAN logic) is a set of rules for defining and analyzing information exchange protocols. Specifically, BAN logic helps its users determine whether exchanged information is trustworthy, secured against eavesdropping, or both. . Lastly, we provide a typical application of the security framework in Mobile Police Information System. The evaluations of the system have proved that the security framework is suitable for actual needs both in speed and security.

A Peer-Based Recovery Scheme for Group Rekeying in Secure Multicast

The Logical Key Hierarchy (LKH) provides a scalable and efficient way to distribute session keys to authorized group members in secure group (multicast) communication. However, because multicast is a best-effort service, it requires additional mechanism to ensure that every member receives the rekey information. To solve this problem, several FEC-based schemes have been proposed. Although these schemes significantly enhance the reliability of the rekey transmissions, they require significant additional resources at the key server. In this paper we propose a distributed scheme for recovering lost rekey packets. Our scheme allows each member to contact other members to get the missing packets during rekey events, thus avoiding the extra computation and bandwidth resources at the key server. We compare our scheme with a well-known FEC scheme with respect to latencies experienced by receivers in reasonably large groups. Results show that our scheme yields lower average and 95th-percentile latencies than the FEC-based scheme across several operating regimes.

모바일 단말기 상에서 안전한 인증을 위한 자바 기반의 PKI 시스템 연구

모바일 네트워크 환경은 언제 어디서나 네트워크를 사용하는 모바일 서비스를 편리하게 사용할 수 있도록 해준다. 그러나 언제 어디서나 서비스를 제공받을 수 있다는 것은 언제 어디서든지 정보가 누출되거나 왜곡될 위험성 또한 존재하기 마련이다. 특히, 프라이버시 문제가 해결되지 않고서는 우리 일상생활과 융합되어 편리함을 제공해주는 모바일 네트워크 환경이 오히려 모바일 네트워크 감시 체제를 구축하는 심각한 역기능을 초래하게 될 것이다. 모바일 단말기들은 크기와 모양이 다양하고 컴퓨팅 연산 능력이 적은 저성능 휴대 장치들이 많기 때문에, 컴퓨팅 연산이 많이 요구되는 공개키 암호 기술을 저성능 모바일 단말기에 적용하기는 힘든 상황이다. 이에 본 논문에서는 프라이버시 문제를 해결하면서, 컴퓨팅 연산 능력이 적은 저성능 모바일 단말기에 적용할 수 있는 자바 기반의 암호 모듈 및 PKI 기반의 사용자 인증을 제안하고자 한다. 국내 표준 암호 알고리즘(SEED, KCDSA, HAS160)과 인증서를 기반으로 세션키와 공개키를 조합함으로서 최소한의 암복호화 연산을 통해 인증 및 전자 서명을 제공하며, 이를 대표적인 모바일 단말기인 PDA 환경에서 세션키 분배 및 사용자 인증이 안전하게 이루어짐을 확인할 수 있었다. Mobile network environments are the environments where mobile devices are distributed invisible in our daily lives so that we can conventionally use mobile services at my time and place. The fact that we can work with mobile devices regardless of time and place, however, means that we are also in security threat of leaking or forging the information. In particular, without solving privacy concern, the mobile network environments which serve convenience to use, harmonized without daily lives, on the contrary, will cause a serious malfunction of establishing mobile network surveillance infrastructure. On the other hand, as the mobile devices with various sizes and figures, public key cryptography techniques requiring heavy computation are difficult to be applied to the computational constrained mobile devices. In this paper, we propose efficient PKI-based user authentication and java-based cryptography module for the privacy-preserving in mobile network environments. Proposed system is support a authentication and digital signature to minimize encrypting and decrypting operation by compounding session key and public key based on Korean standard cryptography algorithm(SEED, KCDSA, HAS160) and certificate in mobile network environment. Also, it has been found that session key distribution and user authentication is safety done on PDA.

Modular approach to the design and analysis of password-based security protocols

In this paper, a general framework for designing and analyzing password-based security protocols is presented. First we introduce the concept of "weak computa- tional indistinguishability" based on current progress of password-based security protocols. Then, we focus on cryptographic foundations for password-based se- curity protocols, i.e., the theory of "weak pseudorandomness". Furthermore, based on the theory of weak pseudorandomness, we present a modular approach to de- sign and analysis of password-based security protocols. Finally, applying the modular approach, we design two kinds of password-based security protocols, i.e., password-based session key distribution (PSKD) protocol and protected password change (PPC) protocol. In addition to having forward secrecy and improved effi- ciency, new protocols are proved secure.

The average transmission overhead for broadcast encryption

We consider broadcast encryption schemes wherein a center needs to broadcast a secret message to a privileged set of receivers. We prescribe a probability distribution P on the privileged set. In this setting, the transmission overhead can be viewed as a random variable over P and we define its expected value as the average transmission overhead (or ATO). Given P , the Shannon's entropy function H (.) provides a lower bound on the average number of bits required to identify every privileged set. This implies a natural lower bound for the ATO in terms of H ( P ). For session key distribution, we consider the subset cover framework and bound the ATO in terms of the size of the cover. We further specialize our bound to accommodate storage constraints at receivers. We consider two families of distributions for P that occur naturally in broadcast networks. 1. Each receiver independently joins the privileged set with probability p . 2. The privileged set is selected uniformly from a collection of subsets of receivers. We evaluate the ATO of some practical schemes such as the subset difference method, the LSD scheme and the Partition-and-Power scheme under these distributions. Our investigations lead us to conclude that each scheme is inherently tailored to perform optimally for specific distributions.

Research on Theory and Approach of Provable Security

This paper presents a survey on the theory of provable security and its applications to the design and analysis of security protocols. It clarifies what the provable security is, explains some basic notions involved in the theory of provable security and illustrates the basic idea of random oracle model. It also reviews the development and advances of provably secure public-key encryption and digital signature schemes, in the random oracle model or the standard model, as well as the applications of provable security to the design and analysis of session-key distribution protocols and their advances.

End-to-End Security Protocol for Mobile Communications with End-User Identification/Authentication

As great progress has been made in mobile communications, many related researches on this topic have been proposed. In most of the proposed protocols so far, it has been assumed that the person using the mobile station is the registrar of the SIM card; as a matter of, the previous protocols for authentication and session key distribution are built upon this assumption. This way, the mobile user can only verify the identity of the owner of the SIM card. This means that the mobile user can only know that who registers the SIM card with which he communicates. Note that the human voice can be forged. To make sure that the speaker at the other end is the right owner of the SIM card, concept of the password is involved to construct the end-to-end security authentication protocol. In the proposed protocol, each mobile user can choose a password. When two mobile users want to communicate with each other, either user can request to perform a end-user identification process. Only when both of the end users input the correct passwords can the correct common session key be established.

A password authentication scheme with secure password updating

Recently, Hwang and Yeh proposed an improvement on the Peyravian-Zunic password scheme. The Hwang-Yeh scheme comprises a password authentication protocol, a password change protocol, and can also provide key distribution. Though the Hwang-Yeh scheme repaired several security problems of the Peyravian-Zunic scheme, it has several security problems: the password change protocol in the Hwang-Yeh scheme is vulnerable to a denial of service attack; and it does not provide the forward secrecy property in session key distribution. Furthermore, we shall fix the Hwang-Yeh scheme to avoid these problems.

Participant registration, validation, and key distribution for large-scale conferencing systems

DiRK (Distributed Registration and Key distribution) is a technique that can be used in large-scale conferencing systems to handle participant registration, validation, and key distribution in a decentralized and distributed way. The basic idea is to distinguish active and passive participants in a conference session, and to have the active participants assist the session holder to register participants and distribute session keys accordingly. This article introduces the basic principles of DiRK and overviews a prototype implementation for the Internet Multicast Backbone (MBone). As an exemplary application, the article also addresses the use of DiRK in distance education and teleteaching.

Integrating authentication in public key distribution system

We propose a way to integrate the authentication into the key distribution scheme to obtain an authenticated secure session key distribution system. In our scheme, only one randomizer is used and the weaknesses pointed out by Nyberg and Rueppel can be avoided.

Session key distribution protocol based on linear algebra for mobile communication network

Based on linear algebra, a new session key distribution protocol suitable for mobile communication networks is proposed together with a user authentication protocol. The computational complexity of the proposed protocol is determined by just the multiplication of a matrix by a vector in a finite field.

A protocol for establishing secure communication channels in a large network

Knowledge exchange and information access in a truly distributed network often require transmitting of data through open media. Consequently, data presented through such an environment are vulnerable to attacks. To minimize such vulnerability, data transformation or encryption/decryption techniques are often utilized among senders and receivers to achieve secure communication. Since data encryption/decryption requires sharing of a secret session key, finding an efficient way to distribute the session key in a large-scale, truly distributed network has been a nontrivial task. This paper presents a protocol for efficiently distributing session keys in such an environment to establish a secure channel. We assume the target network consists of many locally trusted centers, and each center has many users attached to it. The scheme incorporates the public-key distribution concept and the RSA encryption scheme as the basic mathematical tools, but eliminates the storage problem associated with huge public-key files. In addition, the proposed scheme has the added feature of providing the authenticate session key to the two parties in a secure communication. >

Design of a physical layer security mechanism for CSMA/CD networks

CSMA/CD networks (or Ethernets) have become the standard of networking in many medium- to large-scale establishments such as universities, research laboratories and hospitals. However, many departments of these establishments are reluctant to transmit into these networks sensitive information such as examination papers and student records in universities, technical data in research laboratories, or patient records in hospitals. This is due to the fact that all data transmitted into a CSMA/CD network can be received by any station with its network access controller programmed into the promiscuous mode. The paper presents a hardware-oriented security scheme for the physical layer of CSMA/CD networks. In the scheme, connection and data confidentiality in CSMA/CD networks are achieved while the broadcast nature of the networks is preserved. The basic security mechanism is the encipherment of CSMA/CD frames transmitted from CSMA/CD controllers. This mechanism is implemented in a security controller inserted between a CSMA/CD controller and its transceiver. In developing the security key management mechanism in the security controller, a key number (or key reference) concept was introduced. With this new key number concept, the distribution of session keys, either by a key exchange or a key distribution centre, becomes unnecessary. The security scheme allows communications in either normal or security,mode; however, stations without the security controller can only receive frames transitted in the normal mode. Apart from the additional security controller, hardware and software alterations are not required to implement the security scheme in any existing CSMA/CD networks.

A scheme for providing security services in ISO-OSI computer network architecture

In a draft addendum of the Open Systems Interconnection Computer Network Reference Model Architecture, the Transport Layer provides a set of security services for user authentication and data confidentiality. This requires the generation and distribution of a new session key between source and destination host systems. But for geographically distributed end-user host systems, communication with a centralized Key Distribution Center for session key generation and distribution takes a considerable amount of time. Therefore, to reduce this time, a scheme is proposed in this paper to minimize the communication tasks involved between the KDC and end-user systems. In this scheme, the development of an independent Security Service Module at end-user host systems is proposed for providing the session key generation and distribution and other security-related services. Also, a three-sublayer structure of the Security Service Module is presented to perform user authentication and data confidentiality services within the OSI Transport Layer.