10 research outputs found

    RFDA: Reliable framework for data administration based on split-merge policy

    Get PDF
    Emerging technologies in cloud environment have not only increased its use but also posed some severe issues. These issues can cause considerable harm not only to data storage but also to the large amount of data in distributed file structure which are being used in collaborative sharing. The data sharing technique in the cloud is prone to many flaws and is easily attacked. The conventional cryptographic mechanism is not robust enough to provide a secure authentication. In this paper, we overcome this issue with our proposed Reliable Framework for Data Administration (RFDA) using split-merge policy, developed to enhance data security. The proposed RFDA performs splitting of data in a unique manner using 128 AES encryption key. Different slots of the encrypted key are placed in different places of rack servers of different cloud zones. The effectiveness and efficiency of the proposed system are analyzed using comparative analysis from which it is seen that the proposed system has outperformed the existing and conventional security standard

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

    No full text
    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, STTMRAMs 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 compendious study of online payment systems:Past developments, present impact, and future considerations

    No full text
    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

    DFAM: A distributed feedback analysis mechanism for knowledge based educational big data

    No full text
    There is almost digitization of the entire educational system, as there is an abundant of digital materials available. The educational system is not left out from the global standardization as well as authorities are imposing certain standard at local and global level. As a result, these data which are getting generated in the context of educational also complies all the basic characteristics of the Big Data such as volume in terms of size, and others velocity, variety etc. In order to store, search and process an open source project, Apache Hadoop has been conceptualized, whereas it lags the application specific needs especially in the field of education to enhance the teaching and learning processes. In this paper, an architectural model is illustrated to demonstrate the existing eco-system and a proposed model for provisioning the enhanced teaching -learning mechanism, so that it can be adopted to enhance the intelligence into mechanism of educational framework

    DTASR: Dual Threshold-based authentication for secure routing in mobile adhoc network

    No full text
    The Mobile Adhoc Network ( MANET) is not only limited to the temporary rescue operations rather it has been conceptualized to be adopted into many civil society comfort and safety applications including a specific domain called Vehicular adhoc network( VANET). The self-configurability of MANETโ€™s node is the root cause of vulnerability and security threats, thus there is a need of light weight protocols which can ensure optimal Quality of Service (QoS) in secure way of routing. This paper illustrates a model of such secure routing in MANET called DTASR i.e. Dual Threshold-based Authentication for Secure Routing. It uses resource-based threshold scheme as well as trust-based authentication scheme to ensure higher degree of resiliency against adversaries as well as enhanced ability of communication performance when compared to conventional secure routing schemes

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

    No full text
    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

    DTASR: Dual Threshold-based authentication for secure routing in mobile adhoc network

    No full text
    The Mobile Adhoc Network ( MANET) is not only limited to the temporary rescue operations rather it has been conceptualized to be adopted into many civil society comfort and safety applications. The self-configurability of MANETโ€™s node is the root cause of vulnerability and security threats, thus there is a need of light weight protocols which can ensure optimal Quality of Service (QoS) in secure way of routing. This paper projects a model of such secure routing in MANET called DTASR i.e. Dual Threshold-based Authentication for Secure Routing accentuating upon a resource-based threshold scheme as well as trust-based authentication scheme to ensure higher degree of resiliency against adversaries. The proposed illustrates an enhanced ability of communication performance when compared to conventional secure routing schemes

    RAED: Response Analysis of Educational Data for leveraging knowledge dissemination system

    No full text
    The present and future educational system will have 360-degree dependencies on its digitized materials. There has been tremendous approach from every corner of the society including government agencies in every country to implement certain global standards of the educational system, which is going to be completely online. The characteristics of generated data act in agreement with all the parameters of big data such as volume, velocity, veracity, etc. The existing frameworks mainly Hadoop and its ecosystem provide a basic structure to store process and analyze, but it lags the insight to meet the provisioned or conceptualized applications towards enhancing the teaching-learning philosophy. This paper illustrates architecture to handle which latches into the existing framework and its eco-systems. The proposed architecture provides future researchers to validate their algorithm and get the provisioned output for the teaching-learning added for intelligent applications Keywords; Educational Data, Big Data, Data Analytics, Data Mining, Knowledge Discover

    STCM: secured trust-based communication method in vulnerable mobile adhoc network

    No full text
    t Mobile Adhoc network is shrouded with various issues where majority of the problems encircle around routing and security issues. The root cause of such unsolved issues is dynamic topology and decentralized architecture. A closer look into the existing literatures shows that cryptography is the frequently used technique to ensure security in communication of mobile Adhoc network; however, there are associated issues with cryptographic implementation in security. Hence,this paper introduces a scheme based on trust factor which is less recursive and less computationally complex scheme as compared to conventional cryptographic based approaches. The proposed system applies a novel design of control message that uses simple tree to maintain certificates and performs authentication of nodes based on trust factor of node with respect to identity and behavioral pattern of the mobile nodes. The outcome of the study shows better security and communication performance in comparison to frequently used routing approaches

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

    No full text
    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
    corecore