Jung-Yoon Kim

An efficient and versatile key management protocol for secure smart grid communications

Numerous entities in a smart grid network communicate with each other via unicast, multicast, and broadcast communications in order to enhance the efficiency, reliability, and intelligence of the power supply chain. This paper proposes an efficient and scalable key management protocol for secure unicast, multicast, and broadcast communications in a smart grid network. The proposed protocol is based on a binary tree approach, and supports all these three types of secure communications by using only one binary tree. The analysis and discussion show that the proposed protocol is versatile, and hence suitable for secure smart grid communications.

Improvements on Sun 's Conditional Access System in Pay-TV Broadcasting Systems

A conditional access system (CAS) proposed by Sun has a critical security weakness in its inability to preserve backward secrecy; a former subscriber can still access programs despite his or her change in status. This weakness in Sun s CAS originates because 1) no change is made to a group key after a new member arrives, and 2) updates of group keys are done in an insecure manner. We show how simple protocol changes can fix these weaknesses and thus render Sun s CAS capable of preserving backward secrecy.

A secure and lightweight approach for routing optimization in mobile IPv6

Mobility support is an essential part of IPv6 because we have recently seen sharp increases in the number of mobile users. A security weakness in mobility support has a direct consequence on the security of users because it obscures the distinction between devices and users. Unfortunately, a malicious and unauthenticated message in mobility support may open a security hole for intruders by supplying an easy mean to launch an attack that hijacks an ongoing session to a location chosen by the intruder. In this paper, we show how to thwart such a session hijacking attack by authenticating a suspicious message. Although much research has been directed toward addressing similar problems, we contend that our proposed protocol would outperform other proposals that have been advanced. This claim is based on observations that the proposed protocol has strengths such as light computational load, backward compatibility, and dependable operation. The results of in-depth performance evaluation show that our protocol achieves strong security and at the same time requires minimal computational overhead.

An Efficient Authentication Scheme for Security and Privacy Preservation in V2I Communications

In this paper, we propose a mutual authentication and key agreement scheme for V2I communications. Our scheme improves security and privacy protection compared with the existing protocols. We consider common drivers tendency to design a more efficient scheme. The results of the security and performance analysis show that our scheme is suitable for practical use in terms of security, privacy, and performance.

Clue for Secure Route Optimization in Mobile IPv6

Mobile IPv6 is one of method can keep Mobile node`s session. To solve legacy Mobile IPv4`s triangular routing problem, in Mobile IPv6, Mobile Node could directly communicate with Correspond node by Binding Update. But, attacker could interfere Return Routability Procedure that is Correspond node check Home address and Care of address reachable. At this result, Attacker is able to hijack Session to correspond node from Mobile node. In This paper, We propose new Binding Update scheme for solving that problem. Our approach is that MN gives association both home token and care of token using onewayness of keyed hash fuction. From security and performance analysis, we can see that proposed binding Update Scheme can achieve stronger security than legacy scheme and at the same time requires minimal computational overhead.

An Efficient and Secure Group Key Distribution Protocol for IP-based Pay-TV Systems

ABSTRACT Recently,IP-based broadcasting systems,such as Mobile-TV and IP-TV, have been widely deployed. These systems require a security system to allow only authorized subscribers access to broadcasting services. We analyzed the Conditional Access System, which is a security system used in the IP-based Pay-TV systems. A weakness of the system is that it does not scale well when the system experiences frequent membership changes. In this paper, we propose a group key distribution protocol which overcomes the scalability problem by reducing communication and computation overheads without loss of security strength. Our experimental results show that computation delay of the proposed protocol is smaller than one of the Conditional Access System. This is attributed to the fact that the proposed protocol replaces expensive encryption and decryption with relatively inexpensive arithmetic operations. In addition, the proposed protocol can help to set up a secure channel between a server and a client with the minimum additional overhead.Keywords:Key Distribution, Group Key, Pay-TV, Conditional Access System