• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3608-3628
• /
• 2017

Several block cipher modes of operation have been proposed in the literature to protect sensitive information. However, different security analysis models have been presented for attacking them. The analysis indicated that most of the current modes of operation are vulnerable to several attacks such as known plaintext and chosen plaintext/cipher-text attacks. Therefore, this paper proposes a secure block cipher mode of operation to thwart such attacks. In general, the proposed mode combines one-time chain keys with each plaintext before its encryption. The challenge of the proposed mode is the generation of the chain keys. The proposed mode employs the logistic map together with a nonce to dynamically generate a unique set of chain keys for every plaintext. Utilizing the logistic map assures the dynamic behavior while employing the nonce guarantees the uniqueness of the chain keys even if the same message is encrypted again. In this way, the proposed mode called SPCBC can resist the most powerful attacks including the known plaintext and chosen plaintext/cipher-text attacks. In addition, the SPCBC mode improves encryption time performance through supporting parallelized implementation. Finally, the security analysis and experimental results demonstrate that the proposed mode is robust compared to the current modes of operation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.670-686
• /
• 2017

MapReduce (MRV1), a popular programming model, proposed by Google, has been well used to process large datasets in Hadoop, an open source cloud platform. Its new version MapReduce 2.0 (MRV2) developed along with the emerging of Yarn has achieved obvious improvement over MRV1. However, MRV2 suffers from long finishing time on certain types of jobs. Speculative Execution (SE) has been presented as an approach to the problem above by backing up those delayed jobs from low-performance machines to higher ones. In this paper, an adaptive SE strategy (ASE) is presented in Hadoop-2.6.0. Experiment results have depicted that the ASE duplicates tasks according to real-time resources usage among work nodes in a cloud. In addition, the performance of MRV2 is largely improved using the ASE strategy on job execution time and resource consumption, whether in a multi-job environment.

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

For small-scale vector data, restrictions on watermark scheme capacity and robustness limit the use of copyright protection. A watermarking scheme based on robust geometric features and capacity maximization strategy that simultaneously improves capacity and robustness is presented in this paper. The distance ratio and angle of adjacent vertices are chosen as the watermark domain due to their resistance to vertex and geometric attacks. Regarding watermark embedding and extraction, a capacity-improved strategy based on quantization index modulation, which divides more intervals to carry sufficient watermark bits, is proposed. By considering the error tolerance of the vector map and the numerical accuracy, the optimization of the capacity-improved strategy is studied to maximize the embedded watermark bits for each vertex. The experimental results demonstrated that the map distortion caused by watermarks is small and much lower than the map tolerance. Additionally, the proposed scheme can embed a copyright image of 1024 bits into vector data of 150 vertices, which reaches capacity at approximately 14 bits/vertex, and shows prominent robustness against vertex and geometric attacks for small-scale vector data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5572-5595
• /
• 2016

Multi-server authentication enables the subscribers to enjoy an assortment of services from various service providers based on a single registration from any registration centre. Previously, a subscriber had to register from each service provider individually to avail respective services relying on single server authentication. In the past, a number of multi-server authentication techniques can be witnessed that employed lightweight and even computationally intensive cryptographic operations. In line with this, Zhu has presented a chaotic map based multi-server authentication scheme recently, which is not only vulnerable to denial-of-service attack, stolen-verifier attack, but also lacks anonymity. This research aims at improving the Zhu's protocol in terms of cost and efficiency. Moreover, the comparative study is presented for the performance of improved model against the existing scheme, and the security of proposed model is formally proved using BAN Logic.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.201-208
• /
• 2015

3D image must have depth image for depth information in order for 3D realistic media broadcasting. We used generally belief propagation algorithm to solve probability model. Belief propagation algorithm is operated by message passing between nodes corresponding to each pixel. The high resolution image will be able to precisely represent but that required much computational complexity for 3D representation. We proposed fast stereo matching algorithm using belief propagation with multi-resolution based wavelet or lifting. This method can be shown efficiently computational time at much iterations for accurate disparity map.

• Journal of Internet Computing and Services
• /
• v.3 no.2
• /
• pp.87-95
• /
• 2002

Due to rapid development of high speed wire/wireless internet technologies, at the current age, it cares into being one phenomenon that the internet business is able to work on anyplace and anytime. In this environment, a technology of mobile agent provides very useful mechanism for personal handheld devices because of supporting migration as autonomously executable software object Instead of users. Therefore, this paper focuses on Implementing a mobile agent platform for personal handheld devices, which supports mobile agents in wire/wireless internet environment. To do this, we construct the system with modified JAMAS, based on Java, in our previous research. Based on our proposed system, we implement the browsing application in personal handheld devices to access the MIB(Management Information Base) on SNMP(Simple Network Management Protocol), which supervises network environment on wire/wireless internet. This proposed application system is easily to access the MIB managed by SNMP agent. then provides network map viewer and updates the MIB through the browser to network administrator. As a result, we can support application area of mobile agents such as hare network management. M-Commerce, integration of remote database systems, active message and active network with personal handheld devices.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1155-1172
• /
• 2015

In this paper, we propose a novel saliency detection framework based on illumination invariant features to improve the accuracy of the saliency detection under the different light conditions. The proposed algorithm is divided into three steps. First, we extract the illuminant invariant features to reduce the effect of the illumination based on the local sensitive histograms. Second, a preliminary saliency map is obtained in the CIE Lab color space. Last, we use the region growing method to fuse the illuminant invariant features and the preliminary saliency map into a new framework. In addition, we integrate the information of spatial distinctness since the saliency objects are usually compact. The experiments on the benchmark dataset show that the proposed saliency detection framework outperforms the state-of-the-art algorithms in terms of different illuminants in the images.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2006.04a
• /
• pp.111-118
• /
• 2006

The LBS (Location Based Service) location information is the element which is important decides the application of form service, Recently the location accuracy with the method which applies the wireless Internet DGPS improved inside 1 meter Like this. application of the LBS which corresponds In the location accuracy which Improves accurate the Location Information output system development which is accurate stands is essential. In this study which it sees it used 1:5000 digital map MS visual 6.0 Active X controls of the country geography intelligence Personnel and it developed the location information output module of web browser base. The location information output system which is developed it will be able to secure the convenient characteristic of precision and visual program of the digital map simultaneously and the maximum anger of LBS application is expected.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.171-177
• /
• 2012

Network mobility support has been taken into consideration for users who have multiple terminals to enjoy the seamless connectivity. This paper proposes a network mobility support scheme in the LISP architecture. During the mobile router attachment, the EID-to-RLOC mapping database is refreshed in the map server. Furthermore, map update is developed to support smooth handoff for the mobile network. An analysis of performance is given by comparing the proposed scheme with NEMO.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.67-73
• /
• 2008

In the Markov network which models disparity map with the Markov Random Field(MRF), the belief propagation algorithm is operated by message passing between nodes corresponding to each pixels. Belief propagation algorithm required much iteration for accurate result. In this paper, we propose the stereo matching algorithm using belief propagation in multi-resolution domain. Multi-resolution method based on wavelet or lifting can reduce the search area, therefore this algorithm can generate disparity map with fast speed.