Vol. 9, No. 2, Jun. 2013
Alex Crowell, Beng Heng Ng, Earlence Fern, es, Atul Prakash
Vol. 9, No. 2, pp. 189-204, Jun. 2013
Keywords: Confinement Problem, Covert Channels, Virtualization, Isolation, Taint Tracking
Show / Hide AbstractThe confinement problem was first noted four decades ago. Since then, a huge amount of efforts have been spent on defining and mitigating the problem. The evolution of technologies from traditional operating systems to mobile and cloud computing brings about new security challenges. It is perhaps timely that we review the work that has been done. We discuss the foundational principles from classical works, as well as the efforts towards solving the confinement problem in three domains: operating systems, mobile computing, and cloud computing. While common issues exist across all three domains, unique challenges arise for each of them, which we discuss.
Sehoon Park, Im Y. Jung, Heonsang Eom, Heon Y. Yeom
Vol. 9, No. 2, pp. 205-216, Jun. 2013
Keywords: High-Availability Cluster, Replication Enhancement, SRM, DRBD
Show / Hide AbstractIn this paper, we analyze a technique for building a high-availability (HA) cluster system. We propose what we have termed the ‘Selective Replication Manager (SRM),’ which improves the throughput performance and reduces the latency of disk devices by means of a Distributed Replicated Block Device (DRBD), which is integrated in the recent Linux Kernel (version 2.6.33 or higher) and that still provides HA and failover capabilities. The proposed technique can be applied to any disk replication and database system with little customization and with a reasonably low performance overhead. We demonstrate that this approach using SRM increases the disk replication speed and reduces latency by 17% and 7%, respectively, as compared to the existing DRBD solution. This approach represents a good effort to increase HA with a minimum amount of risk and cost in terms of commodity hardware
Pooja Gupta, S, eep K. Singh, Divakar Yadav, A. K. Sharma
Vol. 9, No. 2, pp. 217-236, Jun. 2013
Keywords: ranking, Ordering, WWW, Information Retrieval, Contextual Relevance, Contextual Sense, Web Documents
Show / Hide AbstractRanking thousands of web documents so that they are matched in response to a user query is really a challenging task. For this purpose, search engines use different ranking mechanisms on apparently related resultant web documents to decide the order in which documents should be displayed. Existing ranking mechanisms decide on the order of a web page based on the amount and popularity of the links pointed to and emerging from it. Sometime search engines result in placing less relevant documents in the top positions in response to a user query. There is a strong need to improve the ranking strategy. In this paper, a novel ranking mechanism is being proposed to rank the web documents that consider both the HTML structure of a page and the contextual senses of keywords that are present within it and its back-links. The approach has been tested on data sets of URLs and on their back-links in relation to different topics. The experimental result shows that the overall search results, in response to user queries, are improved. The ordering of the links that have been obtained is compared with the ordering that has been done by using the page rank score. The results obtained thereafter shows that the proposed mechanism contextually puts more related web pages in the top order, as compared to the page rank score.
A Study of Wireless Sensor Network Routing Protocols for Maintenance Access Hatch Condition SurveillanceHoo-Rock Lee, Kyung-Yul Chung, Kyoung-Son Jhang
Vol. 9, No. 2, pp. 237-246, Jun. 2013
Keywords: Maintenance Hatch, Underground Facilities, WSN, Routing Protocol, NS-2
Show / Hide AbstractMaintenance Access Hatches are used to ensure urban safety and aesthetics while facilitating the management of power lines, telecommunication lines, and gas pipes. Such facilities necessitate affordable and effective surveillance. In this paper, we propose a FiCHS (Fixed Cluster head centralized Hierarchical Static clustering) routing protocol that is suitable for underground maintenance hatches using WSN (Wireless Sensor Network) technology. FiCHS is compared with three other protocols, LEACH, LEACH-C, and a simplified LEACH, based on an ns-2 simulation. FiCHS was observed to exhibit the highest levels of power and data transfer efficiency.
Vol. 9, No. 2, pp. 247-258, Jun. 2013
Keywords: Mobile Wireless Network, Security
Show / Hide AbstractA new secure network communication technique that has been designed for mobile wireless services, is presented in this paper. Its network services are mobile, distributed, seamless, and secure. We focus on the security of the scheme and achieve anonymity and reliability by using cryptographic techniques like blind signature and the electronic coin. The question we address in this paper is, “What is the best way to protect the privacy and anonymity of users of mobile wireless networks, especially in practical applications like e-commerce?” The new scheme is a flexible solution that answers this question. It efficiently protects user"'"s privacy and anonymity in mobile wireless networks and supports various applications. It is employed to implement a secure e-auction as an example, in order to show its advantages in practical network applications.
Hyunjung Lee, Harksoo Kim, Jungyun Seo
Vol. 9, No. 2, pp. 259-270, Jun. 2013
Keywords: Domain Action, Speech Act, Concept Sequence, Neural Network
Show / Hide AbstractA speaker’s intentions can be represented by domain actions (domain- independent speech act and domain-dependent concept sequence pairs). Therefore, it is essential that domain actions be determined when implementing dialogue systems because a dialogue system should determine users’ intentions from their utterances and should create counterpart intentions to the users’ intentions. In this paper, a neural network model is proposed for classifying a user’s domain actions and planning a system’s domain actions. An integrated neural network model is proposed for simultaneously determining user and system domain actions using the same framework. The proposed model performed better than previous non-integrated models in an experiment using a goal-oriented dialogue corpus. This result shows that the proposed integration method contributes to improving domain action determination performance.
Om Prakash Verma, Munazza Nizam, Musheer Ahmad
Vol. 9, No. 2, pp. 271-286, Jun. 2013
Keywords: Chaotic systems, Number of Pixel Change Rate, Unified Average Changed Intensity, Correlation Coefficient, Entropy
Show / Hide AbstractRecently, a pixel-chaotic-shuffling (PCS) method has been proposed by Huang et al. for encrypting color images using multiple chaotic systems like the Henon, the Lorenz, the Chua, and the Rossler systems. All of which have great encryption performance. The authors claimed that their pixel-chaotic-shuffle (PCS) encryption method has high confidential security. However, the security analysis of the PCS method against the chosen-plaintext attack (CPA) and known-plaintext attack (KPA) performed by Solak et al. successfully breaks the PCS encryption scheme without knowing the secret key. In this paper we present an improved shuffling pattern for the plaintext image bits to make the cryptosystem proposed by Huang et al. resistant to chosen-plaintext attack and known-plaintext attack. The modifications in the existing PCS encryption method are proposed to improve its security performance against the potential attacks described above. The Number of Pixel Change Rate (NPCR), Unified Average Changed Intensity (UACI), information entropy, and correlation coefficient analysis are performed to evaluate the statistical performance of the modified PCS method. The simulation analysis reveals that the modified PCS method has better statistical features and is more resistant to attacks than Huang et al.’s PCS method.
Sun-Ho Lee, Im-Yeong Lee
Vol. 9, No. 2, pp. 287-300, Jun. 2013
Keywords: Searchable encryption, Proxy Re-Encryption, Index Management, Cloud Computing, Cloud Storage
Show / Hide AbstractCloud storage is provided as a service in order to keep pace with the increasing use of digital information. It can be used to store data via networks and various devices and is easy to access. Unlike existing removable storage, many users can use cloud storage because it has no storage capacity limit and does not require a storage medium. Cloud storage reliability has become a topic of importance, as many users employ it for saving great volumes of data. For protection against unethical administrators and attackers, a variety of cryptography systems, such as searchable encryption and proxy re-encryption, are being applied to cloud storage systems. However, the existing searchable encryption technology is inconvenient to use in a cloud storage environment where users upload their data. This is because this data is shared with others, as necessary, and the users with whom the data is shared change frequently. In this paper, we propose a searchable re-encryption scheme in which a user can safely share data with others by generating a searchable encryption index and then re-encrypt it.
Ved Prakash Bhardwaj, Nitin
Vol. 9, No. 2, pp. 301-314, Jun. 2013
Keywords: Optical Multistage Interconnection Network, crosstalk, Time Domain Approach, Omega Network, Destination Based Modified Omega Network, Crosstalk Free Modified Omega Network
Show / Hide AbstractIn a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network.
Samuel Sangkon Lee, Masami Shishibori, Chia Y. Han
Vol. 9, No. 2, pp. 315-332, Jun. 2013
Keywords: Vantage Point; VP-Tree; Trigonometric Inequality; Search Algorithm; Range Search; Nearest Neighbor Search; AESA algorithm; Multimedia Database
Show / Hide AbstractThis paper presents an approach for improving the use of VP-tree in video indexing and searching. A vantage-point tree or VP-tree is one of the metric space-based indexing methods used in multimedia database searches and data retrieval. Instead of relying on the Euclidean distance as a measure of search space, the proposed approach focuses on the trigonometric inequality for compressing the search range, which thus, improves the search performance. A test result of using 10,000 video files shows that this method reduced the search time by 5-12%, as compared to the existing method that uses the AESA algorithm.
Thang Hoang, Thuc Nguyen, Chuyen Luong, Son Do, Deokjai Choi
Vol. 9, No. 2, pp. 333-348, Jun. 2013
Keywords: gait recognition, Mobile Security, Accelerometer, Pattern Recognition, Authentication, identification, Signal Processing
Show / Hide AbstractMobile authentication/identification has grown into a priority issue nowadays because of its existing outdated mechanisms, such as PINs or passwords. In this paper, we introduce gait recognition by using a mobile accelerometer as not only effective but also as an implicit identification model. Unlike previous works, the gait recognition only performs well with a particular mobile specification (e.g., a fixed sampling rate). Our work focuses on constructing a unique adaptive mechanism that could be independently deployed with the specification of mobile devices. To do this, the impact of the sampling rate on the preprocessing steps, such as noise elimination, data segmentation, and feature extraction, is examined in depth. Moreover, the degrees of agreement between the gait features that were extracted from two different mobiles, including both the Average Error Rate (AER) and Intra-class Correlation Coefficients (ICC), are assessed to evaluate the possibility of constructing a device-independent mechanism. We achieved the classification accuracy approximately 91.33 ± 0.67 % for both devices, which showed that it is feasible and reliable to construct adaptive cross-device gait recognition on a mobile phone.