Статьи журнала - International Journal of Computer Network and Information Security

Все статьи: 690

(N, N) Secret Color Image Sharing Scheme with Dynamic Group

(N, N) Secret Color Image Sharing Scheme with Dynamic Group

Mohamed Fathimal. P, Arockia Jansi Rani .P

Статья научная

In recent years, secure information sharing has become a top requirement for many applications such as banking and military. Secret Sharing is an effective method to improve security of data. Secret Sharing helps to avoid storing data at a single point through dividing and distributing "shares" of secrets and recovering it later with no loss of original quality. This paper proposes a new Secret Sharing scheme for secure transmission of color images. The key features of this scheme are better visual quality of the recovered image with no pixel expansion, eliminating half toning of color images, eliminating the need for code book to decrypt images since reconstruction is done through XOR ing of all images and non-requirement of regeneration of shares for addition or deletion of users leading to less computational complexity. Besides these advantages, this scheme also helps to renew shares periodically and is highly beneficial in applications where data has to be stored securely in a database.

Бесплатно

3-Level DWT Image Watermarking Against Frequency and Geometrical Attacks

3-Level DWT Image Watermarking Against Frequency and Geometrical Attacks

Asma Ahmad, G.R.Sinha, Nikita Kashyap

Статья научная

This paper introduces a robust image watermarking technique for the copyright protection. The proposed method is based on 3-level discrete wavelet transform (DWT). Encoded secret image using spiral scanning is hidden by alpha blending technique in LL sub bands. During embedding process, secret image is dispersed within LL band depending upon alpha value. Encoded secret images are extracted and decoded to recover the original secret image. The experimental results demonstrate that the watermarks generated with the proposed algorithm are invisible and the quality of watermarked image and the recovered image are improved. The scheme is found robust to various image processing attacks such as JPEG compression, Gaussian noise, blurring, median filtering and rotation.

Бесплатно

3-Level Heterogeneity Model for Wireless Sensor Networks

3-Level Heterogeneity Model for Wireless Sensor Networks

Satish Chand, Samayveer Singh, Bijendra Kumar

Статья научная

In this paper, we propose a network model with energy heterogeneity. This model is general enough in the sense that it can describe 1-level, 2-level, and 3-level heterogeneity. The proposed model is characterized by a parameter whose lower and upper bounds are determined. For 1-level heterogeneity, the value of parameter is zero and, for 2-level heterogeneity, its value is (√5-1)/2. For 3-level of heterogeneity, the value of parameter varies between its lower bound and upper bound. The lower bound is determined from the energy levels of different node types, whereas the upper bound is given by (√5-1)/2. As value of parameter decreases from upper bound towards the lower bound, the network lifetime increases. Furthermore, as the level of heterogeneity increases, the network lifetime increases.

Бесплатно

A 3-D Geometry based Remote Login 2-Way Authentication Scheme using Smart Card

A 3-D Geometry based Remote Login 2-Way Authentication Scheme using Smart Card

Hari Om, Vishavdeep Goyal, Kunal Gupta

Статья научная

The computer networks have made possible to access data remotely and they have made possible to login into a system located at far distance; it may be in a different city or in a different country other than the user's native place. The main issue in such an environment is related to the authenticity of the user's identity by the system. This requires to have some mechanism to authenticate a remote user for his legitimacy. In this paper, we propose a method, which is based on a 3-D Geometric approach, to authenticate the login request sent by a user, who is located at far distance. In this method, we provide two-way mutual authentication in which a legitimate user is authenticated by the server and the server is authenticated by the user. This method first performs initialization in which the required parameters are set to create an environment with the central authority. It then allows a user to register with the system/server. Once a user is registered, he is allowed to login to the system for accessing the required information. Our scheme provides a facility to a legitimate user for changing his password of his choice. This scheme withstands with several attacks without requiring much computational overhead.

Бесплатно

A Benchmark for Performance Evaluation and Security Assessment of Image Encryption Schemes

A Benchmark for Performance Evaluation and Security Assessment of Image Encryption Schemes

Nisar Ahmed, Hafiz Muhammad Shahzad Asif, Gulshan Saleem

Статья научная

Digital images have become part of everyday life by demonstrating its usability in a variety of fields from education to space research. Confidentiality and security of digital images have grown significantly with increasing trend of information interchange over the public channel. Cryptography can be used as a successful technique to prevent image data from unauthorized access. Keeping the nature of image data in mind, several encryption techniques are presented specifically for digital images, in literature during past few years. These cryptographic algorithms lack a benchmark for evaluation of their performance, cryptographic security and quality analysis of recovered images. In this study, we have designed and developed a benchmark based on all the parameters necessary for a good image encryption scheme. Extensive studies have been made to categories all the parameters used by different researchers to evaluate their algorithms and an optimum benchmark for evaluation is formulated. This benchmark is used to evaluate three image encryption schemes. The results of evaluation have highlighted the specific application areas for these image encryption schemes.a

Бесплатно

A Bespoke Technique for Secret Messaging

A Bespoke Technique for Secret Messaging

Mahimn Pandya, Hiren Joshi, Ashish Jani

Статья научная

The communication of digital assets on the internet infrastructure is increasing in its volume with threats on its security with regard to active and passive attacks of eavesdroppers. This concern has opened up the research channel to improve the techniques of secure and reliable communication protecting intellectual property rights and message security. Constant efforts of researchers in this area to achieve communication at faster rate maintaining security of digital assets, is giving improved techniques to achieve the goal. The efforts made here in this work are in the direction to enhance level of security in making faster reliable and secure communication. In spite of continued efforts, still as on today, it is challenging to hide the communication from eavesdropper. The disciplines of Cryptography, Steganography and Digital Watermarking are still popular areas of research. They are continuously digging to find robust and effective algorithms to protect digital communications and digital assets. It is very true that if the complexity in algorithm is increased, higher security level can be achieved. In the reviewed work, Researchers have developed algorithms for text encryption and embedment in digital watermarking using LSB at cost of time. The proposed work is targeted to maintain the tradeoff between the complexity level of algorithm and security level of message considering the time factor. The proposed work has evolved with two algorithms: AMEADT (ASCII Message Encryption and Decryption Technique) to protect secret message and AMEAET (ASCII Message Embedment and Extraction Technique) to embed encrypted text to digital image. The implementation of these algorithms has resulted in justifying higher level of security with comparatively lower level of complexity of algorithm.

Бесплатно

A Centralized Key Table based Communication Efficient Group Key Management Protocol

A Centralized Key Table based Communication Efficient Group Key Management Protocol

Manisha Y. Joshi, Rajankumar S. Bichkar

Статья научная

Group key management is an integral part of secure multicast. Minimizing the number of rekeying messages, maintaining the forward and backward secrecy has always been a challenging task. Though there are many solutions which reduce the rekeying messages from Ο(n) to Ο(log_2?〖n),〗 they increase with the increase in group size. In this paper, we present a centralized key table based communication efficient group key management protocol in which number of rekeying messages is independent of the group size. In this protocol key management server (KMS) divides a group of n members into n subgroups of size n-1 and maintains a table of n subkeys along with member ID and one group key. Each member has n-1 subkeys, which is a subset of n subkeys of KMS and one group key. The proposed protocol requires only one multicast rekeying message per joining of a new member as well as per eviction of any existing member. As the number of rekeying messages is not dependent on group size, it requires less computation.

Бесплатно

A Chaos-based Image Encryption Scheme Using 3D Skew Tent Map and Coupled Map Lattice

A Chaos-based Image Encryption Scheme Using 3D Skew Tent Map and Coupled Map Lattice

Ruisong Ye, Wei Zhou

Статья научная

This paper proposes a chaos-based image encryption scheme where one 3D skew tent map with three control parameters is utilized to generate chaotic orbits applied to scramble the pixel positions while one coupled map lattice is employed to yield random gray value sequences to change the gray values so as to enhance the security. Experimental results have been carried out with detailed analysis to demonstrate that the proposed image encryption scheme possesses large key space to resist brute-force attack and possesses good statistical properties to frustrate statistical analysis attacks. Experiments are also performed to illustrate the robustness against malicious attacks like cropping, noising, JPEG compression.

Бесплатно

A Cluster based Key Management Scheme for Underwater Wireless Sensor Networks

A Cluster based Key Management Scheme for Underwater Wireless Sensor Networks

Seema Verma, Prachi

Статья научная

Underwater Wireless Sensor Networks (UWSNs) explore aquatic environment to facilitate various underwater surveillance applications. However, UWSN unique features also impose new challenges such as limited bandwidth, huge propagation delay, mobile nature of nodes and high error rates. UWSNs deployment in unattended environment further exacerbates their vulnerabilities to the attacks. These challenges make security solutions proposed for Wireless Sensor Network (WSN) impractical to be applicable for UWSN. This paper analyzes the problem of security and mobility in UWSN and proposes Cluster based Key management Protocol (CKP), a new key management protocol for hierarchical networks where sensor nodes form cluster around more capable nodes. CKP also proposes a new communication architecture that handles mobility efficiently and minimizes the impact of a node compromisation to itself. CKP provides confidentiality, authentication, integrity and freshness. The performance evaluation demonstrates that the CKP is energy and storage-efficient. Further, we investigate the survivability and the security of the CKP against various security threats in order to evaluate its effectiveness.

Бесплатно

A Comparative Performance Analysis of Routing Protocols in MANET using NS3 Simulator

A Comparative Performance Analysis of Routing Protocols in MANET using NS3 Simulator

Rakesh Kumar Jha, Pooja Kharga

Статья научная

Due to frequent topology changes and routing overhead, selection of routing protocol in Mobile Ad-hoc Network (MANET) is a great challenge. A design issue for an efficient and effective routing protocol is to achieve optimum values of performance parameters under network scenarios. There are various routing protocols available for MANET. This paper involves study of four routing protocols (Ad-hoc On Demand Distance Vector Routing, Optimized Link State Routing, Dynamic Source Routing and Distance Sequenced Distance Vector), and performance comparisons between these routing protocols on the basis of performance metrics (throughput, packet delivery ratio, Packet dropped, jitter and end to end delay measured after simulation of network) with the help of NS3 Simulator.

Бесплатно

A Comparative Study of Key Management Protocols for WSN

A Comparative Study of Key Management Protocols for WSN

Seema Verma, Prachi

Статья научная

Increased employment of WSN (Wireless Sensor Network) in real life applications and their hostile and remote locations accelerate demand of security in WSN. Publicly accessible wireless communication channel also makes WSN vulnerable to numerous security attacks. Scarcity of resources acquaints new sort of challenges and difficulties during implementation of effective security mechanisms. In this paper, we evaluate and compare performance of three different security mechanisms (ECRKS, CKP and AP scheme). ECRKS (Energy-efficient, Connected, Resilient Key pre-distribution Scheme) is based upon multi hop communication architecture specifically designed for homogeneous WSN. Clustering based protocols, AP (Asymmetric pre-distribution) scheme and CKP (Clustering based Key management Protocol) are proposed for heterogeneous WSN. All the above mentioned schemes are simulated in MATLAB to evaluate their effectiveness and suitability for WSN. Simulation result shows that CKP outperforms other two schemes in terms of transmission distance, memory burden, energy dissipation and resilience.

Бесплатно

A Comparative Study of Power Consumption Models for CPA Attack

A Comparative Study of Power Consumption Models for CPA Attack

Hassen Mestiri, Noura Benhadjyoussef, Mohsen Machhout, Rached Tourki

Статья научная

Power analysis attacks are types of side channel attacks that are based on analyzing the power consumption of the cryptographic devices. Correlation power analysis is a powerful and efficient cryptanalytic technique. It exploits the linear relation between the predicted power consumption and the real power consumption of cryptographic devices in order to recover the correct key. The predicted power consumption is determined by using the appropriate consumption model. Until now, only a few models have been proposed and used. In this paper, we describe the process to conduct the CPA attack against AES on SASEBO-GII board. We present a comparison between the Hamming Distance model and the Switching Distance model, in terms of number of power traces needed to recover the correct key using these models. The global successful rate achieves 100% at 11100 power traces. The power traces needed to recover the correct key have been decreased by 12.6% using a CPA attack with Switching Distance model.

Бесплатно

A Comparative Survey on Optical Burst Switched Network Simulators

A Comparative Survey on Optical Burst Switched Network Simulators

Terrance Frederick Fernandez, T. Megala, N.Sreenath

Статья научная

Optical Burst Switching (OBS) is the future of optical internet which provides a promising architecture to efficiently utilize WDM and to fulfill today’s Internet traffic demands. Since this area is yet to mature there is a darn need to study its various protocols. Network simulator is an important tool for researchers and academicians to simulate and model the actual network at a reduced cost compared to the real test-bed experimentation. In this paper various OBS simulators are comparatively surveyed, while highlighting their merits and demerits.

Бесплатно

A Comprehensive Analysis of Android Security and Proposed Solutions

A Comprehensive Analysis of Android Security and Proposed Solutions

Asim S. Yuksel, Abdul H. Zaim, Muhammed A. Aydin

Статья научная

The increasing popularity of smart devices have led users to complete all of their daily work with these devices. Users are now able to shop online, share information with the applications that they install on their smart devices. Installed applications gain access to various sensitive information, such as the user's contact list, phone number, location. However, there is no control mechanism in place that can check whether these applications are safe to install. Therefore, applications are installed according to the users' decisions, without any limitations or warnings. As a result, users become the target of malicious applications, and the personal security and privacy are compromised. In this study, we investigate the security solutions that aim to protect the privacy and security of Android users. We reveal the shortcomings of mobile security solutions and shed light on the research community. Additionally, we present the taxonomy of Android-based mobile security solutions.

Бесплатно

A Content based Image Retrieval Framework Using Color Descriptor

A Content based Image Retrieval Framework Using Color Descriptor

Abdelkhalak Bahri, Hamid Zouaki

Статья научная

In this work, we propose an image search method by visual content (CBIR), which is based on the color descriptor. The proposed method take account the spatial distribution of colors and make the signature partially invariant under rotation. The basic idea of our method is to use circular shift (clockwise or anti-clockwise direction) and mirror (horizontal direction and vertical direction respectively) matching scheme to measure the distance between signatures. Through some experiments, we show that this approach leads to a significant improvement in the quality of results.

Бесплатно

A Cross Layer for Detection and Ignoring Black Hole Attack in MANET

A Cross Layer for Detection and Ignoring Black Hole Attack in MANET

Azza Mohammed, Boukli Hacene Sofiane, Faraoun kamel Mohamed

Статья научная

MANET Mobile Ad hoc Network are evolved through various characteristics such as shared media, this property make a routing protocols vulnerable. AODV is a reactive routing where each intermediate node cooperates in the process of route discovery. In this case, the node that behaves as malicious exploit the malfunction of specified service. The black hole attack uses the sequence number that is used to select the freshest route and attract all exchanged data packets to destroy them. Many researchers have dealt with this attack and many solutions have been proposed. These solutions target the network layer only. In this paper, we present our approach to counter black hole attack. This approach is entitled CrossAODV and it is based on verification and validation process. The key point of our approach is the use of the inter layer interaction between networks layer and medium access within the distributed coordination function (DCF) to efficiently detect and isolate malicious nodes. During the route discovery, the verification process uses the RTS / CTS frame that contains information about the requested path. The validation process consists of comparing the routing information with the result of verification phase. Our Approach have been implemented, simulated and compared to two related studies using the well know NS2 Simulator. The obtained results show the efficacy our proposal in term of packet delivery with a neglected additional delay.

Бесплатно

A Detailed Analysis of Grain family of Stream Ciphers

A Detailed Analysis of Grain family of Stream Ciphers

Mohammad Ubaidullah Bokhar, Shadab Alam, Syed Hamid Hasan

Статья научная

Hardware based ciphers are most suitable for resource constrained environments to provide information security and confidentiality. Grain is one such hardware based synchronous stream cipher. The motive of this study is to present a comprehensive survey and review of Grain family of stream ciphers that is one of the portfolio candidates in the hardware based category of eSTREAM. Security features and different attacks on these ciphers have been studied in this paper to analyze the strengths and weaknesses of these designs.

Бесплатно

A Dynamic Topology Management in a Hybrid Wireless Superstore Network

A Dynamic Topology Management in a Hybrid Wireless Superstore Network

Shankaraiah, Pallapa Venkataram

Статья научная

With the development of large scale wireless networks, there has been short comings and limitations in traditional network topology management systems. In this paper, an adaptive algorithm is proposed to maintain topology of hybrid wireless superstore network by considering the transactions and individual network load. The adaptations include to choose the best network connection for the response, and to perform network Connection switching when network situation changes. At the same time, in terms of the design for topology management systems, aiming at intelligence, real-time, the study makes a step-by-step argument and research on the overall topology management scheme. Architecture for the adaptive topology management of hybrid wireless networking resources is available to user’s mobile device. Simulation results describes that the new scheme has outperformed the original topology management and it is simpler than the original rate borrowing scheme.

Бесплатно

A Fair Downlink Scheduling Algorithm for 3GPP LTE Networks

A Fair Downlink Scheduling Algorithm for 3GPP LTE Networks

S. M. Chadchan, C. B. Akki

Статья научная

Long Term Evolution (LTE), the standard specified by 3GPP on the way towards the fourth generation mobile networks, is intended to deliver high speed data and multimedia services to next generation mobile users. The Radio Resource Management (RRM) plays a very crucial role in managing limited radio resources to enhance system's data rate and to ensure quality of service (QoS) provisioning in both uplink and downlink. LTE downlink scheduling is a RRM entity that is responsible for the allocation of shared radio resources among mobile user equipment (UEs). One of the challenges that need to be addressed in downlink scheduling algorithms is to provide higher spectral efficiency with fairness ensured to all its users. This paper proposes a novel downlink scheduling algorithm which balances its performance between efficiency (in terms of throughput) and fairness to users. The algorithm makes use of Assignment Model for resource allocation to all the selected users during each Transmission Time Interval (TTI). The proposed algorithm is simulated and the simulation results are compared with three techniques proposed in literature. The simulator results show that the new algorithm balances well between throughput and fairness.

Бесплатно

A Fair-Priority MAC design in Networked Control System

A Fair-Priority MAC design in Networked Control System

Hongjun Li,Xun Li,Hongxu Ma

Статья научная

Media Access Control (MAC) protocols in Wireless Networked Control System (WNCS) must minimize the radio energy costs in sensor nodes. Latency and throughput are also important design features for MAC protocols in the applications. But most of them cannot guarantee quality for real-time traffic. This paper studies the state of the art of current real-time MAC protocols, and then introduces a medium access control protocol and a improved protocol that provide multiple priority levels and hard real-time transmission. The channel is accessed by sensors according to their priorities. Sensors send frames in a round manner with same priority. The fairness between different priorities is provided. The channel access procedure is divided into two stages: broadcast period and transmission period. Simulation and experiment results indicate that our protocol provides high channel utilization and bounded delays for real-time communication and can be well applied in the many fields especially the dynamic wireless sensor networks.

Бесплатно

Журнал