Burhan Ul Islam Khan

SSM: Secure-Split-Merge data distribution in cloud infrastructure

With the advancement of cloud storage services the vulnerabilities associated with cloud-related data has increased. It affects the cloud distributed data servers that are not only used for data storage, but also used for managing a huge amount of data with distributed file structures in collaborative sharing. The data sharing processes of cloud computing infrastructure are susceptible to various kinds of attacks where many traditional cryptographic techniques fail to provide a proper and efficient authentication mechanism. In this paper, a novel approach namely Secure-Split-Merge (SSM) is introduced for the security of data. The proposed SSM scheme uses a unique mechanism of performing splitting of data using AES 128 bit encryption key. The chunks of encrypted splits are being maintained on various rack servers of different types of cloud zones. The comparative analysis shows that the proposed system gives effective outcomes as compared to various existing and traditional security standards.

Securely Eradicating Cellular Dependency for E-Banking Applications

Numerous applications are available on the Internet for the exchange of personal information and money. All these applications need to authenticate the users to confirm their legitimacy. Currently, the most commonly employed credentials include static passwords. But people tend to behave carelessly in choosing their passwords to avoid the burden of memorizing complex passwords. Such frail password habits are a severe threat to the various services available online especially electronic banking or e-banking. For eradicating the necessity of creating and managing passwords, a variety of solutions are prevalent, the traditional ones being the usage of One-Time-Password (OTP) that refers to a single session/transaction password. However, the majority of the OTP-based security solutions fail to satisfy the usability or scalability requirements and are quite vulnerable owing to their reliance on multiple communication channels. In this paper, the most reliable and adoptable solution which provides better security in online banking transactions is proposed. This is an initiative to eradicate the dependency on Global System for Mobile communication (GSM) that is the most popular means of sending the One-Time-Passwords to the users availing e-banking facilities.

A Computationally Efficient P-LRU based Optimal Cache Heap Object Replacement Policy

The recent advancement in the field of distributed computing depicts a need of developing highly associative and less expensive cache memories for the state-of-art processors i.e., Intel Core i6, i7, etc. Hence, various conventional studies introduced cache replacement policies which are one of the prominent key factors to determine the effectiveness of a cache memory. Most of the conventional cache replacement algorithms are found to be as not so efficient on memory management and complexity analysis. Therefore, a significant and thorough analysis is required to suggest a new optimal solution for optimizing the state-of-the-art cache replacement issues. The proposed study aims to conceptualize a theoretical model for optimal cache heap object replacement. The proposed model incorporates Tree based and MRU (Most Recently Used) pseudo-LRU (Least Recently Used) mechanism and configures it with JVM’s garbage collector to replace the old referenced objects from the heap cache lines. The performance analysis of the proposed system illustrates that it outperforms the conventional state of art replacement policies with much lower cost and complexity. It also depicts that the percentage of hits on cache heap is relatively higher than the conventional technologies.

A Compendious Study of Online Payment Systems: Past Developments, Present Impact, and Future Considerations

The advent of e-commerce together with the growth of the Internet promoted the digitisation of the payment process with the provision of various online payment methods like electronic cash, debit cards, credit cards, contactless payment, mobile wallets, etc. Besides, the services provided by mobile payment are gaining popularity day-by-day and are showing a transition by advancing towards a propitious future of speculative prospects in conjunction with the technological innovations. This paper is aimed at evaluating the present status and growth of online payment systems in worldwide markets and also takes a look at its future. In this paper, a comprehensive survey on all the aspects of electronic payment has been conducted after analysis of several research studies on online payment systems. Several online payment system services, the associated security issues and the future of such modes of payment have been analysed. This study also analyses the various factors that affect the adoption of online payment systems by consumers. Furthermore, there can be seen a huge growth in mobile payment methods globally beating both debit and credit card payments, all due to the convenience and security offered by them. Nevertheless, various obstacles have been identified in the adoption of online payment methods; thus, some measures have to be taken for granting this industry a hopeful future. Thus, there should be a suitable trade-off between usability and security when designing online payment systems in order to attract customers. Also, technical and organisational issues which arise in the attempt to achieve interoperability must be taken into consideration by the designers. As a matter of fact, the process of developing interoperable and flexible solutions and universal standards is one of the most difficult tasks in the future ahead.

JIR2TA: Joint Invocation of Resource-Based Thresholding and Trust-Oriented Authentication in mobile adhoc network

The demands of a higher degree of security level for the mobile ad-hoc network are yet to meet the best solution. Owing to the dynamic topology and decentralization issue, the mobile node suffers from a consistent security problem during communication stage. This paper has reviewed the existing system towards secure routing in mobile ad-hoc network and explored that there are still a lot of scopes to enhance the security level. This paper presents a non-cryptographic technique called as JIR2TA or Joint Invocation of Resource-based Thresholding and Trust-oriented Authentication using resource and trust factor to intensify the routing policies for strengthening the authentication process of a mobile node. The outcome of the study shows better packet delivery ratio, computational time, throughput, and end-to-end delay in contrast to existing secure routing technique.

Trust and Resource Oriented Communication Scheme in Mobile Ad Hoc Networks

Attaining high security in mobile ad hoc networks (or MANETs) is the utmost concern in the present era of wireless ad-hoc communication and efforts are continuously being made by the researchers, in order to provide a feasible solution for the same. Impervious security has to be ensured in MANETs because of their involvement in transacting highly sensitive information. However, it has been discerned that during the communication process, the decentralized and dynamic nature of MANETs impedes the security of mobile nodes. This study is an attempt to enhance the security in routing techniques of MANETs by overhauling the existing security system after its critical evaluation. It has been observed that the cryptographic techniques in use prove to be inefficient or fail in some of the current scenarios. Therefore, a non-cryptographic method has been put forward that strengthens the process of authenticating nodes in MANETs by taking into account two factors viz. trust and resource, unlike the conventional ones. On analyzing the performance with respect to throughput, packet delivery ratio, end-to-end delay and computational time, the proposed system proves to be better than the previous standard secure routing scheme.

An efficient cache replacement algorithm for minimizing the error rate in L2-STT-MRAM caches

In the recent times, various challenges are being encountered during SRAM cache design and development which lead to a situation of converting the memory cell technologies into on-chip embedded caches. The current research statistics towards cache designing reveals that Spin Torque Transfer Magnetic RAMs, preferably termed as STT-MRAMs has become one of the most promising areas in the field of memory chip design. Hence, it gained a lot of attention from the researchers due to its dynamic direct map and data access policies for reducing the average cost i.e. time and energy optimization. Instead of having efficient main memory access capability, STT-MRAMs suffer due to high error rate caused during stochastic switching in write operations. Cache replacement algorithms play a significant role in minimizing the error rate in write operations. The proposed study aims to offer a theoretical and analytical modeling of an efficient cache replacement scheme to overcome the error as mentioned above in L2-STT-MRAM caches. The performance analysis of the proposed algorithm ensures its effectiveness in reducing the error rate and cost overheads as compared to the conventional LRU technique implemented on SRAM cells.

A study on performance evaluation of conventional cache replacement algorithms: A review

Cache Replacement Policies play a significant and contributory role in the context of determining the effectiveness of cache memory cells. It has also become one of the major key features for efficient memory management from the technological aspect. Hence, owing to the existing critical computing systems, it has become too essential to attain faster processing of executable instructions under any adverse situations. In the current scenario, the state of art processors such as Intel multi-core processors for application specific integrated circuits, usually employ various cache replacement policies such as Least Recently Used (LRU) and Pseudo LRU (pLRU), Round Robin, etc. However, fewer amounts of existing research works are found till date to utter about explicit performance issues associated with the conventional cache replacement algorithms. Therefore, the proposed study intended to carry out a performance evaluation to explore the design space of conventional cache replacement policies under SPEC CPU2000 benchmark suite. It initiates and configures the experimental Simple Scalar toolbox prototype on a wide range of cache sizes. The experimental outcomes obtained from the benchmark suite show that PLRU outperforms the conventional LRU concerning computational complexity and a variety of cache blocks organization.

Contemplation of Effective Security Measures in Access Management from Adoptability Perspective

With the extension in computer networks, there has been a drastic change in the disposition of network security. Security has always been a major concern of any organization as it involves mechanisms to ensure reliable access. In the present era of global electronic connectivity where hackers, eavesdroppers, electronic frauds, viruses are growing in number, security has proved to be indispensable. Although numerous solutions have been put forth in literature to guarantee security, they have botched with related traits like efficiency and scalability. Despite the range of security solutions that have been presented by experts, not a single approach has been wholly agreed upon to provide absolute security or standardized upon unanimously. Furthermore, these approaches lack adoptable user implementation. In this paper, various approaches and techniques that were introduced in the past for the purpose of enhancing the authentication and authorization of the user while performing sensitive and confidential transaction are discussed. Each of works performed by the researchers is taken single-handedly for debate followed by analysis. Finally, the open issues in the current domain of study are formulated from the review conducted.