• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2534-2553
• /
• 2018

Source routing is the routing scheme that arranges the whole path from source to target at the origin node that may suit the requirements from the upper layer applications' perspective. The centralized control in SDN (Software-Defined Networking) networks enables the awareness of the global topology at the controller. Therefore, augmented source routing schemes can be designed to achieve various purposes. This paper proposes a source routing scheme that conducts the top-K QoS-aware paths discovery in SDN. First, the novel non-invasive QoS over LLDP scheme is designed to collect QoS information based on LLDP in a piggyback fashion. Then, variations of the KSP (K Shortest Paths) algorithm are derived to find the unconstrained/constrained top-K ranked paths with regard to individual/overall path costs, reflecting the Quality of Service. The experiment results show that the proposed scheme can efficiently collect the QoS information and find the top-K paths. Also, the performance of our scheme is applicable in QoS-sensitive application scenarios compared with previous works.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.3
• /
• pp.109-114
• /
• 2005

On the research for constructing secure group-oriented proxy signature schemes, there are several proposals of threshold proxy signature schemes which combine the notions of proxy signature with threshold signature. Recently, Hsu and Wu proposed a threshold proxy signature scheme which uses a self-certified public key based on discrete logarithm problem. In this paper, we show that this scheme is vulnerable to original signer's forgery attack. So our attack provides the evidence that this scheme does not satisfy nonrepudiation property.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.322-332
• /
• 2017

Wireless Body Area Networks is an environment that provides an appropriate service remotely by collecting user's biometric information. With the growing importance of sensor, WBAN also attracts extensive attention. Since WBAN is representatively used in the medical field, it can be directly related to the patient's life. Hence security is very important in WBAN. Mutual authentication between the client and the application provider is essential. And efficiency is also important because a used device is limited to computation cost. In this reason, ID-based anonymous authentication scheme in WBAN has been intensively studied. We show that the recent research result of Wu et al. which is about the ID-based anonymous authentication scheme is vulnerable to impersonation attack. And we propose a new ID-based anonymous authentication scheme that is secure against the attacks discovered in the existing schemes. Compared to the existing schemes, the computation cost of our scheme is improved by 30.6% and 7.3%.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.8
• /
• pp.694-701
• /
• 2013

This paper deals with the problem of accurately tracking a single target moving through UWSNs (Underwater Wireless Sensor Networks) by employing underwater acoustic sensors. This paper addresses the issues of estimating the states of the target, and improving energy efficiency by applying a Kalman filter in a distributed architecture. Each underwater wireless sensor nodes composing the UWSNs is battery-powered, so the energy conservation problem is a critical issue. This paper provides an algorithm which increases the energy efficiency of each sensor node through WuS (Waked-up/Sleeping) and VM (Valid Measurement) selecting schemes. Simulation results illustrate the performance of the distributed tracking filter.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.69-77
• /
• 2010

Authentication and key establishment are fundamental procedures to establish secure communications over public insecure network. A password-based scheme is common method to provide authentication. In 2008, Khan proposed an efficient password-based authentication scheme using smart cards to solve the problems inherent in Wu-Chieu's authentication scheme. As for security, Khan claimed that his scheme is secure and provides mutual authentication between legal users and a remote server. In this paper, we demonstrate Khan's scheme to be vulnerable to various attacks, i. e., password guessing attack, insider attack, reflection attack and forgery attack. Our study shows that Khan's scheme does not provide mutual authentication and is insecure for practical applications. This paper proposes an improved scheme to overcome these problems and to preserve user anonymity that is an issue in e-commerce applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.4025-4042
• /
• 2017

Session initiation protocol (SIP) is a kind of powerful and common protocols applied for the voice over internet protocol. The security and efficiency are two urgent requirements and admired properties of SIP. Recently, Hamed et al. proposed an efficient authentication and key agreement scheme for SIP. However, we demonstrate that Hamed et al.'s scheme is vulnerable to de-synchronization attack and cannot provide anonymity for users. Furthermore, we propose an improved and efficient authentication and key agreement scheme by using elliptic curve cryptosystem. Besides, we prove that the proposed scheme is provably secure by using secure formal proof based on Burrows-Abadi-Needham logic. The comparison with the relevant schemes shows that our proposed scheme has lower computation costs and can provide stronger security.

• ETRI Journal
• /
• v.36 no.2
• /
• pp.329-332
• /
• 2014

In this letter, the problem of estimating the physical layer (PL) scrambling code sequence of DVB-S2 is studied. We present the first ever scheme to estimate the scrambling sequence. The scheme is based on hypothesis testing. By analyzing the PL scrambling process, we construct a new sequence equivalent to the scrambling sequence. We then use hypothesis testing to estimate the new sequence. The threshold for the hypothesis testing is also discussed. The experiment results show that the performance of our estimation scheme can work even under high BER.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4508-4528
• /
• 2016

Widespread use of wireless networks has drawn attention to ascertain confidential communication and proper authentication of an entity before granting access to services over insecure channels. Recently, Truong et al. proposed a modified dynamic ID-based authentication scheme which they claimed to resist smart-card-theft attack. Nevertheless, we find that their scheme is prone to smart-card-theft attack contrary to the author's claim. Besides, anyone can impersonate the user as well as service provider server and can breach the confidentiality of communication by merely eavesdropping the login request and server's reply message from the network. We also notice that the scheme does not impart user anonymity and forward secrecy. Therefore, we present another authentication scheme keeping apart the threats encountered in the design of Truong et al.'s scheme. We also prove the security of the proposed scheme with the help of widespread BAN (Burrows, Abadi and Needham) Logic.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.366-374
• /
• 2010

Coded cooperation is a promising user cooperation scheme. In this paper, we first propose a novel network-coding-based coded cooperation scheme. When a user decodes its partner's information correctly in the first frame, it transmits the combination of the partner's parity bits and its own parity bits through network coding in the second frame. This is distinct from the classical scheme, where the user only transmits the partner's parity bits during cooperation. We analyze the outage probability of the proposed scheme, and show that it achieves a full diversity order. Numerical evaluations reveal that the proposed scheme outperforms the classical scheme when the inter-user channel is poor, yet is worse when the inter-user channel is strong. Also, the results show that the proposed scheme always outperforms that of no cooperation in various channel conditions while the performance of classical scheme is worse than that of no cooperation with the poor inter-user channels. This means that the performance of the proposed scheme is more stable than the classical scheme and the proposed scheme is more tolerant to the poor inter-user channels. To combine the advantages of the proposed scheme and the classical scheme under different inter-user channel conditions, we propose an adaptive solution. This adaptive scheme enhances the system performance considerably in all channel conditions in spite of the inter-user channel quality, at the expense of only one acknowledgement or non-acknowledgement bit.

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.692-702
• /
• 2012

Supporting quality of service (QoS) guarantees for diverse multimedia services are the primary concerns for WiMAX (IEEE 802.16) networks. A scheduling scheme that satisfies QoS requirements has become more important for wireless communications. We propose a downlink scheduling scheme called adaptive priority-based downlink scheduling (APDS) for providing QoS guarantees in IEEE 802.16 networks. APDS comprises two major components: Priority assignment and resource allocation. Different service-type connections primarily depend on their QoS requirements to adjust priority assignments and dispatch bandwidth resources dynamically. We consider both starvation avoidance and resource management. Simulation results show that our APDS methodology outperforms the representative scheduling approaches in QoS satisfaction and maintains fairness in starvation prevention.