• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.156-164
• /
• 2002

IPSec is a protocol which provides data encryption, message authentication and data integrity on public and open network transmission. In IPSec, ESP protocol is used when it needs to provide data encryption, authentication and Integrity In real transmission packets. ESP protocol uses DES-CBC encryption mode when sender encrypts packets and receiver decrypts data through this mode IV is used at that time. This value has many tasks of attack during transmission by attacker because it is transferred clean and opened. If IV value is modified, then decryption of ESP data is impossible and higher level information is changed. In this paper we propose a new algorithm that it encrypts IV values using DES-ECB mode for preventing IV attack and checks integrity of whole ESP data using message authentication function. Therefore, we will protect attacks of IV and data, and guarantee core safe transmission on the public network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1384-1390
• /
• 2008

The TCP protocol is originally designed for wired network, however it performs very poor in wireless network due to different nature of wireless network from wired networks. In terms of TCP performance improvement in wireless Ad-hoc network, many researches show that small congestion window size of TCP connection can improve TCP performance. We propose a new TCP algorithm to improve TCP performance in wireless Ad-hoc network. The basic idea of our approach is that TCP receiver estimates the optimum window size and then sets congestion window limit of TCP sender to an optimum value by using the advertised window field in TCP ACK packet. From extensive computer simulation, the proposed algorithm shows superior performance than traditional TCP protocols in terms of packet delivery ratio and packet loss.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1427-1433
• /
• 2008

There is SARLM scheme for dynamic adaptation to network congestion status which arises from multicast applications. However, in this scheme, when congestion occurs in a local, the waste of available bandwidth occurs in non-congestion local because of reducing of transmission rate in congestion local. In this paper, we propose a hierarchical multicast for dynamic adaptation to network congestion. In proposed scheme, we select a representative in each local. while congestion status. It receives packet from multicast sender and hierarchically transmits packet to the representative in congestion status by unicast for preventing decrease of transmission rate and the representative in congestion local transmits packet to the receivers in local by multicast. In experimental results, it was known that the proposed scheme could improve transmission rate of receivers in congestion status and more efficiently used available bandwidth.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.94-99
• /
• 2001

Recently a lot of informations is interchanged among many users through the network such as Internet. In this situation. multimedia data transfer has some problems. that are jitter, the difference of delay in arriving packets, and loss of data due to the various delay between sender and receiver. The arriving data packets are not synchronized because of those problems. Especially, an efficient method is needed to revise the sudden large changes of the delay, called spike-like delay. which is occured in explosive growth of networking. We propose efficient synchronization algorithm which controls synchronization interval and adjusts to sudden changes in networks. The algorithm, a receiver-driven adaptive synchronization method, is to synchronize the arriving data packets against spike-like delay and decrease the loss of them. In addition, another method is proposed in this paper. The method uses the probabilistic features of delay distribution appearing in general network. It is evaluated for the loss of data packets and the delay times.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.179-186
• /
• 2008

In proportion as the growth of the wireless sensor network applications, we need for more accuracy wireless channel information. In the case of indoor or outdoor wireless sensor networks, multipath propagation causes severe problems in terms of fading. Therefore, a path-loss model for multipath environment is required to optimize communication systems. This paper deals with log-normal path loss modeling of the indoor 2.4 GHz channel. We measured variation of the received signal strength between the sender and receiver of which separation was increased from 1 to 30m. The path-loss exponent and the standard deviation of wireless channel were determined by fitting of the measured data. By using the PRR(Packet Reception Rate) of this model. Wireless sensor channel is defined CR(Connect Region), DR(Disconnected Region). In order to verify the characteristics of wireless channel, we performed simulations and experiments. We demonstrated that connection ranges are 24m in indoor, and 14m in outdoor.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.9-17
• /
• 2019

In this paper, we propose an attribute-based broadcast encryption algorithm that can be applied to satellite broadcasting network. The encryption algorithm is a cryptographic method by which a carrier(sender) can transmit contents efficiently and securely to a plurality of legitimate users through satellites. An attribute-based encryption algorithm encrypts contents according to property of contents or a user, In this paper, we combine effectively two algorithms to improve the safety and operability of satellite broadcasting network. That is, it can efficiently transmit ciphertexts to a large number of users, and has an advantage in that decoding can be controlled by combining various attributes. The proposed algorithm reduces the network load by greatly reducing the size of the public key, the private key and the cipher text in terms of efficiency, and the decryption operation amount is reduced by half to enable fast decryption, thereby enhancing the operability of the user.

• (The) Korean Journal of Advertising
• /
• v.28 no.3
• /
• pp.53-81
• /
• 2017

As online video advertising market grows, viral advertising is drawing attention. This study investigated factors influencing consumer's sharing intent of viral advertising each from four dimensions which are content, sender, consumer, and network. As a result, factors of persuasive intent, brand-ad image fit, perceived self-presentation, and bridging social capital were found to affect consumer's sharing intent of viral advertising. And persuasive intent of content was found to be negatively affect consumer's sharing intent. Social value and bonding social capital were not found to have significant influence on consumer's sharing intent of viral advertising. From the analysis of this result, this study suggested future research topic and academic/practical implications.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.2
• /
• pp.83-92
• /
• 2007

In connectionless packet network, if a sender encrypts packets by block chaining mode and send it to receiver, the receiver should decrypt packets in encrypted order that is not received order. Therefore, the performance and efficiency are lowered for crypto communication system. To solve this problem, we propose packet encryption scheme for connectionless packet network that can decrypt the packets independently, even if the received order of packets are changed or packets are missed. The scheme makes new IV(Initial Vector) using IV that created by key exchange process and salt that made by random number. We propose extended Cryptoki API that added packet encryption/decryption functions and mechanism for improving convenience and performance. We implement the scheme and get result that the performance increased about $1.5{\sim}l5.6$ times compare with in case of implementing using Cryptoki API in the test environment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.2
• /
• pp.31-38
• /
• 2009

To provide the privacy of a keyword, a public key encryption with keyword search(PEKS) firstly was propsed by Boneh et al. The PEKS scheme enables that an email sender sends an encrypted email with receiver's public key to an email server and a server can obtain the relation between the given encrypted email and an encrypted query generated by a receiver. In this email system, we easily consider the situation that a user sends the one identical encrypted email to multi-receiver like as group e-mail. Hwang and Lee proposed a searchable public key encryption considering multi-receivers. To reduce the size of transmission data and the server's computation is important issue in multi-receiver setting. In this paper, we propose an efficient searchable public key encryption for multi-receiver (mPEKS) which is more efficient and reduces the server's pairing computation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.6
• /
• pp.47-58
• /
• 2002

The access control techniques, which can control unauthorized members to access to multicast service, have not been studied very often while there are a lot of on-going study on secure multicast architecture, multicast key distribution and sender authentication scheme have been studied. Multi level access control scheme in multicast can be used in a remote secure conference or to provide graduated multimedia services to each customers. In fact, multicast network has its own virtual networks according to different security levels. However, Early schemes are not effective when it protects unauthorized access in multi-access network environment. Furthermore this scheme does not provide us with hierarchical access control mechanism. This paper, therefore, proposes hierarchical access control scheme to provide the effectiveness in network layer by security level comparison. And we also suggests hierarchical key distribution scheme for multi level access control in application layer and effective hierarchical key renewal scheme in dynamic multicast environment which is easy to join and leaving the multicast group.