• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.91-98
• /
• 2012

A group key exchange (GKE) protocol is designed to allow a group of parties communicating over a public network to establish a common secret key. As group-oriented applications gain popularity over the Internet, a number of GKE protocols have been suggested to provide those applications with a secure multicast channel. Among the many protocols is Yi et al.'s password-based GKE protocol in which each participant is assumed to hold their individual password registered with a trusted server. A fundamental requirement for password-based key exchange is security against off-line dictionary attacks. However, Yi et al.'s protocol fails to meet the requirement. In this paper, we report this security problem with Yi et al.'s protocol and show how to solve it.

• Journal of Internet Computing and Services
• /
• v.11 no.6
• /
• pp.87-110
• /
• 2010

Recently competitive Korean companies are suffered from financial loss due to illegal exposure of their own proprietary know-how secrets, since it is difficult to watch hidden illegal channels to leak them due to their digitalization. Today the DRM-based system designed to protect such secrets is insufficient to prevent it, since DRM-based protection system cannot defend the intelligent robbery of secrets, in special, employee's robbery. The MSEC is much appropriate to secure secrets against employee's robbery. Our paper notes that IGMP, MSEC and SNMP can work easily together to realize secure system that satisfy strong security condition for prevention from leaking secrets. Since the previous research was on the architectural design for prevention of illegal exposure, this paper proposes the efficient protocol based on MSEC protocol. Our protocol satisfies the strong security conditions that the principles that the secret should be stored/distributed only in an encrypted shape, and should be separated physically from its encryption key, and should be carried in registered mobile storage separate from its processing device, and should be verified in terms of both user and device. Thus this paper proposes both the protocol for secret document distribution and its group key management.

• Journal of Internet Computing and Services
• /
• v.3 no.4
• /
• pp.11-18
• /
• 2002

The IP multicasting service system based on IGMP(Internet Group Management Protocol) is the receiver initiated multicasting system that all receivers must join to and leave from the server of multicasting service. The IGMP is less effective and reliable to apply the education system that all computers of students ore synchronized a teacher's computer. A proposed middle-ware in this paper provides the reliable data transferring and the server initiated multicasting system that client as student's PC is controled by a multicasting server as teacher's PC, This middle-ware is consisted with two major component, The one is the group manager that handle the status informations of members in each group. Another is the reliable sender/receiver that has The transmission protocol based on NAK message and flow control. As the results of the test that 22khz digital voice data and 1024$\times$768 24bit color image data were tested for 30 PCs connected with 100baseT, the voice data was completely without error transferred and the image data was successfully transferred with 0.004% retransmit rate under 2 frames/sec load.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.500-500
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of Internet Computing and Services
• /
• v.3 no.1
• /
• pp.81-90
• /
• 2002

Large-scale distributed applications based on Internet and client/server applications have to deal with series of problems. Load balancing, unpredictable communication delays, and networking failures can be the example of the series of problems. Therefore. sophisticated applications such as teleconferencing, video-on-demand, and concurrent software engineering require an abstracted group communication, CORBA does not address these paradigms adequately. It mainly deals with point-to-point communication and does not support the development of reliable applications that include predictable behavior in distributed systems. In this paper, we present our design, implementation and performance analysis of the group communication using the CORBA-ORB. JAVA-RML and Socket based on distributed computing Performance analysis will be estimated latency-lime according to object increment, in case of group communication using ORB of CORBA the average is 14.5172msec, in case of group communication using RMI of Java the average is 21.4085msec, in case of group communication using socket the average is becoming 18.0714msec. Each group communication using multicast and UDP can be estimated 0.2735msec and 0.2157msec. The performance of the CORBA-ORB group communication is increased because of the increased object by the result of this research. This study can be applied to the fault-tolerant client/server system, group-ware. text retrieval system, and financial information systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1222-1228
• /
• 2006

In this paper, I propose a video watermaking method using adaptive threshold value and half-cell motion vector. Conventional method cause a lot of change of motion vectors and bring about a falling-off in invisibility, because it search embedding condition about whole macroblocks and watermarks are embedded in arbitrary motion vectors. Proposed method improve invisibility and decrease in number of change of motion vectors, because it create threshold value by using power of motion vector(PMV), and watermarks are embedded in motion vectors which greater than threshold value. Consequently, proposed method improve invisibility with on an average 5.4 dB ~9.3dB according to video bit-stream.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.22-37
• /
• 2013

Content distribution to a large number of concurrent clients stresses both server and network. While the server limitation can be circumvented by deploying server clusters, the network limitation is far less easy to cope with, due to the difficulty in measuring and balancing network load. In this paper, we use two useful network load metrics, the worst link stress (WLS) and the degree of interference (DOI), and formulate the problem as partitioning the clients into disjoint subsets subject to the server capacity constraint so that the WLS and the DOI are reduced for each session and also well balanced across the sessions. We present a network load-aware partition algorithm, which is practicable and effective in achieving the design goals. Through experiments on PlanetLab, we show that the proposed scheme has the remarkable advantages over existing schemes in reducing and balancing the network load. We expect the algorithm and performance metrics can be easily applied to various Internet applications, such as media streaming, multicast group member selection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.1-19
• /
• 2015

With the recent popularity of smart terminals, the demand for high-data-rate transmission is growing rapidly, which brings a new challenge for the traditional cellular networks. Both device-to-device (D2D) communication and small cells are effective to improve the transmission efficiency of local communication. In this paper, we apply D2D communication into a small cell network system (SNets) and study about the optimization problem of resource allocation for D2D communication. The optimization problem includes system scheduling and resource allocation, which is exponentially complex and the optimal solution is infeasible to achieve. Therefore, in this paper, the optimization problem is decomposed into several smaller problems and a hierarchical scheme is proposed to obtain the solution. The proposed hierarchical scheme consists of three steps: D2D communication groups formation, the estimation of sub-channels needed by each D2D communication group and specific resource allocation. From numerical simulation results, we find that the proposed resource allocation scheme is effective in improving the spectral efficiency and reducing the outage probability of D2D communication.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1208-1215
• /
• 2005

In the case of receiving feedbacks from many receivers in the multimedia application using multicasting, the traffic congestion caused bp heavy traffic results in the problem of transmission rate decrease. In solving of this, the local representative method is adopted. However, the control of transmission rate in consideration of all receivers caused uncongested local transmission rate to get slower. In this paper, there is a local representative in solving of this problem. When the transmission rate of a group is less than minimum support threshold, the local representative recounts the transmission rate without congested receivers. Therefore, The local representative method has improved the problem that the transmission rate of uncongested local decreases. The result of this paper shows that this method provides stable transmission rate rather than those of existing methods.