• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5862-5887
• /
• 2019

In this paper, we propose a two-way relaying scheme using non-orthogonal multiple access (NOMA) technology. In this scheme, two sources transmit packets with each other under the assistance of the decode-and-forward (DF) relays, called as a TWDFNOMA protocol. The cooperative relays exploit successive interference cancellation (SIC) technique to decode sequentially the data packets from received summation signals, and then use the digital network coding (DNC) technique to encrypt received data from two sources. A max-min criterion of end-to-end signal-to-interference-plus-noise ratios (SINRs) is used to select a best relay in the proposed TWDFNOMA protocol. Outage probabilities are analyzed to achieve exact closed-form expressions and then, the system performance of the proposed TWDFNOMA protocol is evaluated by these probabilities. Simulation and analysis results discover that the system performance of the proposed TWDFNOMA protocol is improved when compared with a conventional three-timeslot two-way relaying scheme using DNC (denoted as a TWDNC protocol), a four-timeslot two-way relaying scheme without using DNC (denoted as a TWNDNC protocol) and a two-timeslot two-way relaying scheme with amplify-and-forward operations (denoted as a TWANC protocol). Particularly, the proposed TWDFNOMA protocol achieves best performances at two optimal locations of the best relay whereas the midpoint one is the optimal location of the TWDNC and TWNDNC protocols. Finally, the probability analyses are justified by executing Monte Carlo simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.883-891
• /
• 2008

In 2006, Lee and Ahn proposed a matrix-based RFID authentication protocol which eliminates the security problems in HB and $HB^+$ RFID authentication protocols. Their proposed protocol provides the following three merits: (1) it reduces the computational costs of the RFID tag. (2) it reduces the communication overhead between the reader and the tag. (3) it protects the user privacy. However, this paper points out that Lee and Ahn's proposed protocol is insecure to various attacks because it does not provide mutual authentication which the RFID tag does not authenticate the legality of the RFID reader unlike their claims. In addition, this paper proposes an improved matrix-based RFID mutual authentication protocol that can provide the mutual authentication. As a result, the proposed protocol not only can provide strong security and but also guarantee high efficiency because it reduces the communication rounds compare with Lee-Ahn's protocol.

• Journal of Venture Innovation
• /
• v.2 no.1
• /
• pp.13-21
• /
• 2019

In LTE environment, which is 4th generation mobile communication systems, there is concern about private information exposure by transmitting initial identifier in plain text. This paper suggest mutual authentication protocol, which uses one-time password utilizing challenge-response and AES-based Milenage key generation algorithm, as solution for safe initial identification communication, preventing unique identification information leaking. Milenage key generation algorithm has been used in LTE Security protocol for generating Cipher key, Integrity key, Message Authentication Code. Performance analysis evaluates the suitability of LTE Security protocol and LTE network by comparing LTE Security protocol with proposed protocol about algorithm operation count and Latency.Thus, this paper figures out initial identification communication's weak points of currently used LTE security protocol and complements in accordance with traditional protocol. So, it can be applied for traditional LTE communication on account of providing additional confidentiality to initial identifier.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.3
• /
• pp.41-52
• /
• 1997

In this paper, we analyze two claws of Zhou-Gollmann's protocol. The protocol divide the message into a key K and a ciphertext C. The ciphertext C is delivered to the recipient, but the key K is submitted to the TTP, after the message originator receive the recipient's receipt for the ciphertext. TTP puts the key in the directory which is accesaible to the public. So, the recipient's obtaining the message dependson whether the originator submits the key or not. We will show that the originator. which is in such an advantageous position, could make the protocol be unfair and present how to improve the protocol. On the other hand, Zhou-Gollmann's protocol doesn't provide the secrecy of the message, since the key K is published. This means that, to send a secret message, additional mechanism is required. In this paper, we will present an improvement of Zhou-Gollmann's protocol to keep the message secret. The key distribution of the proposed protocol is based on the Diffie-Hellman's one.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.473-483
• /
• 2012

To achieve an entire end-to-end security, the classical authentication setting such that all participants have a same password is not practical since a password is not a common secret but a personal secret depending on an individual. Thus, an efficient client to client different password-based authenticated key agreement protocol (for short, EC2C-PAKA) has been suggested in the cross-realm setting. Very recently, however, a security weakness of the EC2C-PAKA protocol has been analyzed by Feng and Xu. They have claimed that the EC2C-PAKA protocol is insecure against a password impersonation attack. They also have presented an improved version of the EC2C-PAKA protocol. In this paper, we demonstrate that their claim on the insecurity of EC2C-PAKA protocol against a password impersonation attack is not valid. We show that the EC2C-PAKA protocol is still secure against the password impersonation attack. In addition, ironically, we show that the improved protocol by Feng and Xu is insecure against an impersonation attack such that a server holding password of Alice in realm A can impersonate Bob in realm B. We also discuss a countermeasure to prevent the attack.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.11 no.2
• /
• pp.46-51
• /
• 2012

In this paper deperm performance on deperm protocol cycle has been analyzed. As deperm protocol increases cycle, deperm performance improves and duration time will increase. Thus, it's essential that proper deperm cycle that is fit on vessel should be applied. To compare deperm performance according to cycle changes, small deperm system has been made and small vessel had been made with SM45C materials. As Anhysteretic deperm protocol applied, the result on the increase of deperm performance according to the increase of cycle has been gotten.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.5
• /
• pp.526-532
• /
• 2014

In this paper, we present and analyze a LQ (Linear Quadratic) inverse optimal state-consensus protocol for continuous-time multi-agent systems with undirected graph topology. By Lyapunov analysis of the state-consensus error dynamics, we show the sufficient conditions on the algebraic connectivity of the graph to guarantee LQ inverse optimality and closed-loop stability. A more relaxed stability condition is also provided in terms of the algebraic connectivity. Finally, a formation control protocol for multiple mobile robots is proposed based on the target LQ inverse optimal consensus protocol, and the simulation results are provided to verify the performance of the proposed LQ inverse formation control method.

• ETRI Journal
• /
• v.40 no.3
• /
• pp.291-302
• /
• 2018

The deployment of an incremental hybrid decode-amplify and forward relaying scheme is a promising and superior solution for cellular networks to meet ever-growing network traffic demands. However, the selection of a suitable relaying protocol based on the signal-to-noise ratio threshold is important in realizing an improved quality of service. In this paper, an incremental hybrid relaying protocol is proposed using polar codes. The proposed protocol achieves a better performance than existing turbo codes in terms of capacity. Simulation results show that the polar codes through an incremental hybrid decode-amplify-and-forward relay can provide a 38% gain when ${\gamma}_{th(1)}$ and ${\gamma}_{th(2)}$ are optimal. Further, the channel capacity is improved to 17.5 b/s/Hz and 23 b/s/Hz for $2{\times}2$ MIMO and $4{\times}4$ MIMO systems, respectively. Monte Carlo simulations are carried out to achieve the optimal solution.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2135-2148
• /
• 2000

Developing network software in embedded systems, such as digital set-top boxes, requires coding under limited computing resources. This paper presents the porting of Point-to-point Protocol (PPP) software, PPPD, to an embedded system. The PPP is the most popular link layer protocol for the information appliance, to an embedded system. In order to achieve this, problems to be solved for the porting were identified and methods to solve the problems were described. First, PPP source codes were divided into modules. Next, functions of each module were analyzed and interfaces between the modules were delineated. With the analysis results, porting to the embedded system was described. The normal operation of the ported software was verified with the help of a network packet analyzer. Finally, experiences during the porting were presented. The method developed in th paper can be applied to the porting of software to an embedded system as well as the porting of network software.

• Journal of Internet Computing and Services
• /
• v.2 no.5
• /
• pp.71-79
• /
• 2001

Replication in distributed databases is to improve efficiency, availability, and autonomy, But applying the strict consistency in real systems is very difficult. In this paper, I introduce a hybrid protocol permitting group update through eager update propagation and weakening consistency through lazy update, This protocol manages replica version number for the group update consistency and generates partially ordered replica spanning tree for the serializability of lazy update transactions. It preserves weak consistency by combining synchronous and asynchronous update mechanism. Study of performance analysis for the efficiency of the protocol be included in next paper.