• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4153-4169
• /
• 2014

To recognize F5-like (such as F5 and nsF5) steganographic algorithm from multi-class stego images, a recognition algorithm based on the identifiable statistical feature (IDSF) of F5-like steganography is proposed in this paper. First, this paper analyzes the special modification ways of F5-like steganography to image data, as well as the special changes of statistical properties of image data caused by the modifications. And then, by constructing appropriate feature extraction sources, the IDSF of F5-like steganography distinguished from others is extracted. Lastly, based on the extracted IDSFs and combined with the training of SVM (Support Vector Machine) classifier, a recognition algorithm is presented to recognize F5-like stego images from images set consisting of a large number of multi-class stego images. A series of experimental results based on the detection of five types of typical JPEG steganography (namely F5, nsF5, JSteg, Steghide and Outguess) indicate that, the proposed algorithm can distinguish F5-like stego images reliably from multi-class stego images generated by the steganography mentioned above. Furthermore, even if the types of some detected stego images are unknown, the proposed algorithm can still recognize F5-like stego images correctly with high accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1989-2009
• /
• 2013

How to discover router vulnerabilities effectively and automatically is a critical problem to ensure network and information security. Previous research on router security is mostly about the technology of exploiting known flaws of routers. Fuzzing is a famous automated vulnerability finding technology; however, traditional Fuzzing tools are designed for testing network applications or other software. These tools are not or partly not suitable for testing routers. This paper designs a framework of discovering router protocol vulnerabilities, and proposes a mathematical model Two-stage Fuzzing Test Cases Generator(TFTCG) that improves previous methods to generate test cases. We have developed a tool called RPFuzzer based on TFTCG. RPFuzzer monitors routers by sending normal packets, keeping watch on CPU utilization and checking system logs, which can detect DoS, router reboot and so on. RPFuzzer' debugger based on modified Dynamips, which can record register values when an exception occurs. Finally, we experiment on the SNMP protocol, find 8 vulnerabilities, of which there are five unreleased vulnerabilities. The experiment has proved the effectiveness of RPFuzzer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5392-5418
• /
• 2017

The primary aim of this paper is to propose a non-linear regression based technique for mapping different network Quality of Service (QoS) factors to an integrated end-user Quality of Experience (QoE) or Mean Opinion Score (MOS) value for an online video streaming service on a mobile phone. We use six network QoS factors for finding out the user QoE. The contribution of this paper is threefold. First, we investigate the impact of the network QoS factors on the perceived video quality. Next, we perform an individual mapping of the significant network QoS parameters obtained in stage 1 to the user QoE based upon a non-linear regression method. The optimal QoS to QoE mapping function is chosen based upon a decision variable. In the final stage, we evaluate the integrated QoE of the system by taking the combined effect of all the QoS factors considered. Extensive subjective tests comprising of over 50 people across a wide variety of video contents encoded with H.265/HEVC and VP9 codec have been conducted in order to gather the actual MOS data for the purpose of QoS to QoE mapping. Our proposed hybrid model has been validated against unseen data and reveals good prediction accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3851-3866
• /
• 2015

The dynamic nature of opportunistic networks results in long delays, low rates of success for deliveries, etc. As such user experience is limited, and the further development of opportunistic networks is constrained. This paper proposes a prediction-based routing method for opportunistic networks (PB-OppNet). Firstly, using an ARIMA model, PB-OppNet describes the historical contact information between a node pair as a time series to predict the average encounter time interval of the node pair. Secondly, using an optimal stopping rule, PB-OppNet obtains a threshold for encounter time intervals as forwarding utility. Based on this threshold, a node can easily make decisions of stopping observing, or delivering messages when potential forwarding nodes enter its communication range. It can also report different encounter time intervals to the destination node. With the threshold, PB-OppNet can achieve a better compromise of forwarding utility and waiting delay, so that delivery delay is minimized. The simulation experiment result presented here shows that PB-OppNet is better than existing methods in prediction accuracy for links, delivery delays, delivery success rates, etc.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.9
• /
• pp.1632-1652
• /
• 2011

This paper considers the object tracking problem in three dimensional (3-D) space when the azimuth and elevation of the object are available from the passive acoustic sensor. The particle filtering technique can be directly applied to estimate the 3-D object location, but we propose to decompose the 3-D particle filter into the three planes' particle filters, which are individually designed for the 2-D bearings-only tracking problems. 2-D bearing information is derived from the azimuth and elevation of the object to be used for the 2-D particle filter. Two estimates of three planes' particle filters are selected based on the characterization of the acoustic sensor operation in a noisy environment. The Cramer-Rao Lower Bound of the proposed 2-D particle filter-based algorithm is derived and compared against the algorithm that is based on the direct 3-D particle filter.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2879-2899
• /
• 2021

The tone reservation (TR) scheme is an attractive method to reduce peak-to-average power ratio (PAPR) in the filter bank multicarrier with offset quadrature amplitude modulation (FBMC-OQAM) systems. However, the high PAPR of FBMC signal will severely degrades system performance. To address this issue, a cyclic shift based TR (CS-TR) scheme with embedding side information (SI) is proposed to reduce the PAPR of FBMC signals. At the transmitter, four candidate signals are first generated based on cyclic shift of the output of inverse discrete Fourier transform (IDFT), and the SI of the selected signal with minimum peak power among the four candidate signals is embedded in sparse symbols with quadrature phase-shift keying constellation. Then, the TR weighted by optimal scaling factor is employed to further reduce PAPR of the selected signal. At the receiver, a reliable SI detector is presented by determining the phase rotation of SI embedding symbols, and the transmitted data blocks can be correctly demodulated according to the detected SI. Simulation results show that the proposed scheme significantly outperforms the existing TR schemes in both PAPR reduction and bit error rate (BER) performances. In addition, the proposed scheme with detected SI can achieve the same BER performance compared to the one with perfect SI.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.32-42
• /
• 2023

There are serious problems worldwide, such as a pandemic due to an unprecedented infection caused by COVID-19. On previous approaches, they invented medical vaccines and preemptive testing tools for medical engineering. However, it is difficult to access poor medical systems and medical institutions due to disparities between countries and regions. In advanced nations, the damage was even greater due to high medical and examination costs because they did not go to the hospital. Therefore, from a software engineering-based perspective, we propose a learning model for determining coronavirus infection through symptom data-based software prediction models and tools. After a comparative analysis of various models (decision tree, Naive Bayes, KNN, multi-perceptron neural network), we decide to choose an appropriate decision tree model. Due to a lack of data, additional survey data and overseas symptom data are applied and built into the judgment model. To protect from thiswe also adapt human normalization approach with traditional Korean medicin approach. We expect to be possible to determine coronavirus, flu, allergy, and cold without medical examination and diagnosis tools through data collection and analysis by applying decision trees.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.524-539
• /
• 2014

To investigate schemes of secret key generation from Ultra-wideband (UWB) channel, we study a statistical characterization of UWB outdoor channel for a campus playground scenario based on extensive measurements. Moreover, an efficient secret key generation mechanism exploiting multipath relative delay is developed, and verification of this algorithm is conducted in UWB Line-of-sight (LOS) outdoor channels. For the first time, we compare key-mismatch probability of UWB indoor and outdoor environments. Simulation results demonstrate that the number of multipath proportionally affects key generation rate and key-mismatch probability. In comparison to the conventional method using received signal strength (RSS) as a common random source, our mechanism achieves better performance in terms of common secret bit generation. Simultaneously, security analysis indicates that the proposed scheme can still guarantee security even in the sparse outdoor physical environment free of many reflectors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2567-2582
• /
• 2016

This paper investigates the impact of outdated channel state information (CSI) on the performance of the incremental amplify-and-forward (AF) opportunistic relaying (OR) over dual-hop Rayleigh fading channels. According to the definition of distribution function, we obtain the cumulative distribution function (CDF) of the actual combined signal-to-noise ratio (SNR) received at the destination. Based on this CDF, the closed-form expressions of the average spectral efficiency and outage probability are derived for the incremental AF OR under outdated CSI. Numerical results show that in the low region of the average SNR of the direct link, outdated CSI deteriorates the system performance, whereas in the high region, outdated CSI has almost no impact on the system performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5717-5730
• /
• 2019

LBlock-s is the core block cipher of authentication encryption algorithm LAC, which uses the same structure of LBlock and an improved key schedule algorithm with better diffusion property. Using the differential properties of the key schedule algorithm and the cryptanalytic technique which combines impossible boomerang attacks with related-key attacks, a 15-round related-key impossible boomerang distinguisher is constructed for the first time. Based on the distinguisher, an attack on 22-round LBlock-s is proposed by adding 4 rounds on the top and 3 rounds at the bottom. The time complexity is about only 2^68.76 22-round encryptions and the data complexity is about 2⁵⁸ chosen plaintexts. Compared with published cryptanalysis results on LBlock-s, there has been a sharp decrease in time complexity and an ideal data complexity.