International Journal of Computer Science and Information Security

Vol. 11 No. 11 NOV 2013

Vol. 11 No. 11 NOVEMBER 2013 International Journal of Computer Science and Information Security

Publication NOVEMBER 2013, Volume 11 No. 11 (Download Full Journal) (Archive) (Download 2)

Copyright © IJCSIS. This is an open access journal distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

1. Paper 31101326: An Integrated Public Key Infrastructure Model Based on Certificateless Cryptography (pp. 1-10)

Full Text: PDF

Mohammed Hassouna(1), Bazara Barri (2), Nashwa Mohamed (2), Eihab Bashier (2)(3)

(1) National Ribat University, Burri, Khartoum, Sudan

(2) Faculty of Mathematical Sciences, University of Khartoum, Sudan

(3) Faculty of Sciences and Arts, Albaha University, Saudi Arabia

Abstract — In this paper an integrated Certificateless Public Key Infrastructure (CLPKI) that focuses on key management issues is proposed. The proposed scheme provides two-factor private key authentication to protect the private key in case of device theft or compromise. The private key in the proposed scheme is not stored in the device, but rather it is calculated every time the user needs it. It depends also on a user’s chosen password and then even if the device is stolen, the attacker cannot get the private key because he/she does not know the user’s secret password. The proposed model provides many other key management features like private key recovery, private key portability and private key archiving.

2. Paper 31101324: An Attribute-Based Public Key Infrastructure (pp. 11-18)

Full Text: PDF

Hendri Nogueira, Jean Everson Martina and Ricardo Felipe Custódio

Federal University of Santa Catarina – Florianópolis - SC, Brazil

Abstract — While X.509 Public Key Infrastructures (PKIs) and X.509 Attribute Certificates (ACs) enforce strong authentication and authorization procedures (respectively), they do not give the user management over his/her own attributes. This is especially important in regards to the users’ personal information when a service provider requests more than necessary, sensitive information such as medical data, and the users need control over the attributes they are sharing. We present an Attribute-Based Public Key Infrastructure that addresses the management of users’ attributes and giving more control to the users’ concerns in identity and access management system and in documents signatures. Our user-centric scheme also simplify the confidence of the attributes validity and the verification procedures.

Index Terms — Attribute-Based, Public Key Infrastructure, Identity Management, Attributes, User-Centric.

3. Paper 31101325: Map Visualization of Shortest Path Searching of Government Agency Location Using Ant Colony Algorithm (pp. 19-23)

Full Text: PDF

Candra Dewi and Devi Andriati,

Program of Information Technology and Computer Science, Brawijaya University

Abstract — The case of the shortest path searching is an issue to get the destination with the efficient time and the shortest path. Therefore, some shortest path searching system has been developed as a tool to get the destination without spent a lot of time. This paper implements the visualization of searching result for shortest path of the government agency location on the map using ant colony algorithm. Ant colony algorithm is an algorithm which has a probabilistic technique that is affected by ant pheromone. The shortest path searching considers some factors such as traffic jam, road direction, departures time and vehicle type. The testing is done to obtain the ant tracking intensity controlling constant (α) for calculation probability of route that is selected by ant and visibility controlling constant (β), therefore the optimal route would be obtained. The testing result shows that the worst accuracy value was reach when α = 0 and β = 0. On the other hand, the accuracy value close to 100% on some combination of the parameter such as (α = 0, β = 1), (α = 2, β = 1), (α=0, β=2), (α=1, β= 2) to (α=2, β = 5). It shows that the accuracy value is close to the best result. The change of parameter α and β are the main priority on the shortest path searching because the values have been produced will be used as probability value of pheromone.

Keywords - shortest path; map visualization; Ant Colony algorithm; government agency location

4. Paper 31101328: Determination of Multipath Security Using Efficient Pattern Matching (pp. 24-33)

Full Text: PDF

James Obert, Cyber R&D Solutions, Sandia National Labs, Albuquerque, NM, USA

Huiping Cao, Computer Science Department, New Mexico State University, Las Cruces, NM, USA

Abstract — Multipath routing is the use of multiple potential paths through a network in order to enhance fault tolerance, optimize bandwidth use, and improve security. Selecting data flow paths based on cost addresses performance issues but ignores security threats. Attackers can disrupt the data flows by attacking the links along the paths. Denial-of-service, remote exploitation, and other such attacks launched on any single link can severely limit throughput. Networks can be secured using a secure quality of service approach in which a sender disperses data along multiple secure paths. In this secure multi-path approach, a portion of the data from the sender is transmitted over each path and the re-ceiver assembles the data fragments that arrive. One of the larg-est challenges in secure multipath routing is determining the se-curity threat level along each path and providing a commensu-rate level of encryption along that path. The research presented explores the effects of real-world attack scenarios in systems, and gauges the threat levels along each path. Optimal sampling and compression of network data is provided via compressed sensing. The probability of the presence of specific attack signatures along a network path is determined using machine learning techniques. Using these probabilities, information assurance levels are de-rived such that security measures along vulnerable paths are increased.

Keywords-component; Mutli-path Security; Information Assurance; Anomaly Detection.

5. Paper 31101338: On the Information Hiding Technique Using Least Significant Bits Steganography (pp. 34-45)

Full Text: PDF

Samir El-Seoud, Faculty of Informatics and Computer Science, The British University in Egypt, Cairo, Egypt

Islam Taj-Eddin, Faculty of Informatics and Computer Science, The British University in Egypt, Cairo, Egypt

Abstract — Steganography is the art and science of hiding data or the practice of concealing a message, image, or file within another message, image, or file. Steganography is often combined with cryptography so that even if the message is discovered it cannot be read. It is mainly used to maintain private data and/or secure confidential data from misused through unauthorized person. In contemporary terms, Steganography has evolved into a digital strategy of hiding a file in some form of multimedia, such as an image, an audio file or even a video file. This paper presents a simple Steganography method for encoding extra information in an image by making small modifications to its pixels. The proposed method focuses on one particular popular technique, Least Significant Bit (LSB) Embedding. The paper uses the (LSB) to embed a message into an image with 24-bit (i.e. 3 bytes) color pixels. The paper uses the (LSB) of every pixel’s bytes. The paper show that using three bits from every pixel is robust and the amount of change in the image will be minimal and indiscernible to the human eye. For more protection to the message bits a Stego-Key has been used to permute the message bits before embedding it. A software tool that employ steganography to hide data inside of other files (encoding) as well as software to detect such hidden files (decoding) has been developed and presented.

Key Words—Steganography, Hidden-Data, Embedding-Stego-Medium, Cover-Medium, Data, Stego-Key, Stego-Image, Least Significant Bit (LSB), 24-bit color pixel, Histogram Error (HE), Peak Signal Noise Ratio (PSNR), Mean Square Error (MSE).

6. Paper 30091320: Color and Shape Content Based Image Classification using RBF Network and PSO Technique: A Survey (pp. 46-50)

Full Text: PDF

Abhishek Pandey, Dept. of CSE, UIT-RGPV Bhopal (M.P)

Prof. Anjna Jayant Deen, Dept. of CSE,UIT-RGPV Bhopal (M.P)

Dr. Rajeev Pandey, Dept. of CSE,UIT-RGPV Bhopal(M.P)

Abstract - The improvement of the accuracy of image query retrieval used image classification technique. Image classification is well known technique of supervised learning. The improved method of image classification increases the working efficiency of image query retrieval. For the improvements of classification technique we used RBF neural network function for better prediction of feature used in image retrieval.Colour content is represented by pixel values in image classification using radial base function(RBF) technique. This approach provides better result compare to SVM technique in image representation.Image is represented by matrix though RBF using pixel values of colour intensity of image. Firstly we using RGB colour model. In this colour model we use red, green and blue colour intensity values in matrix.SVM with partical swarm optimization for image classification is implemented in content of images which provide better Results based on the proposed approach are found encouraging in terms of color image classification accuracy.

Keywords: RBF network, PSO technique, image classification.

7. Paper 30091321: A Survey: Various Techniques of Image Compression (pp. 51-55)

Full Text: PDF

Gaurav Vijayvargiya, Dr. Rajeev Pandey, Dr. Sanjay Silakari

UIT-RGPV, Bhopal

Abstract — This paper addresses about various image compression techniques. On the basis of analyzing the various image compression techniques this paper presents a survey of existing research papers. In this paper we analyze different types of existing method of image compression. Compression of an image is significantly different then compression of binary raw data. To solve these use different types of techniques for image compression. Now there is question may be arise that how to image compress and which types of technique is used. For this purpose there are basically two types are method are introduced namely lossless and lossy image compression techniques. In present time some other techniques are added with basic method. In some area neural network genetic algorithms are used for image compression.

Keywords-Image Compression; Lossless; Lossy; Redundancy; Benefits of Compression.

8. Paper 30091325: Optimization of Real-Time Application Network Using RSVP (pp. 56-62)

Full Text: PDF

Vikas Gupta (1), Baldev Raj (2)

(1) Assistant Professor, Adesh Institute of Engineering and Technology, Faridkot, Punjab, India

(2) Research Scholar, Adesh Institute of Engineering and Technology, Faridkot, Punjab, India

Abstract — In this research work Resource Reservation Protocol (RSVP) – which works on receiver – oriented approach is used. Two different networks have been designed and implemented using OPNET. In the first scenario the client are available with and without the use of RSVP. In this scenario, the parameters that have been selected, simulated and analyzed are reservation status message, reservation and path states in all value mode, traffic delay experienced in the form of end-to-end delay parameter with and without the use of RSVP, packet delay variation with and without RSVP. The analysis reveal that the attempted reservation status was successful, the number of reservation and path states were one, the end-to-end delay with the use of RSVP was comparatively lower than with the use of RSVP and also the packet delay variation for node with RSVP was lower than that of the node not using RSVP. In another scenario the network was duplicated but the link used for connecting the subnets was changed from DS1 (1.544 Mbps) to DS3 (44.736 Mbps). The parametric analysis indicated that end-to-end delay, Packet delay variation for the network with DS3 as the link, was lower than the network with DS1.

Keywords: RSVP, OPNET

9. Paper 30111149: A New Scalable and Efficient Image Encryption Scheme Using Poly substitution Method and Genetic Algorithm (pp. 63-65)

Full Text: PDF

G. Lokeshwari, Associate professor CSE, Aurora’s Engineering College, Bhongir

Dr. S. Udaya Kumar, Principal, MVSR Engineering college, Nadergul.

G. Aparna, Associate Professor ECE, Aurora’s Engineering College, Bhongir

Abstract - In today’s world of information technology image encryption can be used for providing privacy and for protecting intellectual properties. During the transmission of images the threat of unauthorized access may increase significantly. Image encryption can be used to minimize these problems. In the proposed scheme of image encryption using poly substitution method we propose the possibility of taking the advantages of genetic algorithm features. In poly alphabetic substitution ciphers the plaintext letters are enciphered differently depending upon their placement in the text. As the name poly alphabetic suggests this is achieved by using several two, three keys and random keys combinations.

Keywords: Image Encryption, Decryption, Genetic algorithm, poly substitution.

10. Paper 31071319: Local Intrusion Detection by Bluff Probe Packet (LIDBPP) in A mobile Ad Hoc Network (MANET) (pp. 66-69)

Full Text: PDF

Imad I. Saada and Majdi Z. Rashad

Department of Computer Science, Faculty of Computer and Information Sciences, Mansoura University, Egypt

Abstract - Mobile ad hoc network (MANET) is a collection of wireless nodes that are distributed without dependency on any permanent infrastructure. MANET security has been studied in recent years For example the black hole threats which make the source believes that the path to the destination being through it. Researchers have proposed their secure routing idea in order to encounter these threats, the problem is that the security threats still exists because it is not prevented or avoided completely in addition, some of the solutions adversely affected network performance, such as adding additional network overhead and time delay. The main objectives of this paper is to discuss some recent solutions that work to detect a black hole node by using different strategies, one of these solutions is S-ZRP, it will be developed in this paper to generate a new proposed solution called local intrusion detection by bluff probe packet (LIDBPP), it will locally begin detection by the previous node and not by the source node as in S-ZRP, this will decrease the negative impact n the performance of MANET such as network overhead and time delay in AODV based MANET.

Keywords: LIDBPP, MANET, Black hole, AODV, Network security.

11. Paper 31101322: Design and Analysis of (M/G/1):(GD/∞/ ∞) and (Mi /Gi /1):(NPRP/∞/∞) Queueing Systems (pp. 70-75)

Full Text: PDF

G. T. Shakila Devi, Research Scholar, Department of Statistics, Manonmaniam Sundaranar University, Tirunelveli, India.

Dr. C. Vijayalakshmi, Professor, School of Advance Sciences, Department of Mathematics Division, VIT University, Chennai, India.

Abstract - There are many non Poisson queuing models. This paper mainly deals with the analysis of Non-Poisson queues (M/G/1): (GD/∞/ ∞) and (Mi /Gi/1): (NPRP/∞/∞) .The feasibility of the system is analyzed based on the numerical calculations and Graphical representations. When the mean system size and the queue size is high, optimized value is obtained so that the total expected cost is minimized. The outline here an approach that may be used to analyze a non-Poisson model which has job classes of multiple priorities. The priority discipline followed may be either non-preemptive or preemptive in nature. When the priority discipline is non-preemptive in nature, a job in service is allowed to complete its service normally even if a job of higher priority enters the queue while its service is going on. In the preemptive case, the service to the ongoing job will be preempted by the new arrival of higher priority. If the priority discipline is preemptive resume, then service to the interrupted job, when it restarts, continues from the point at which the service was interrupted. For the preemptive non resume case, service already provided to the interrupted job is forgotten and its service is started again from the beginning. Note that there may be loss of work in the preemptive non-resume priority case. Such loss of work will not happen in the case of the other two priorities. Since the service times are assumed to be exponentially distributed, they will satisfy the memory-less property and that, therefore, the results will be the same both for the preemptive resume and preemptive non-resume cases.

Keywords- Pollazek–Khintchine formula; Priority service discipline; Non-Poisson queues

13. Paper 31101317: MAC Address as a Key for Data Encryption (pp. 83-87)

Full Text: PDF

Dr. Mohammed Abbas Fadhil Al-Husainy

Department of Multimedia Systems, Faculty of Science and Information Technology, Al-Zaytoonah University of Jordan, Amman, Jordan

Abstract- In computer networking, the Media Access Control (MAC) address is a unique value associated with a network adapter. MAC addresses are also known as hardware addresses or physical addresses. TCP/IP and other mainstream networking architectures generally adopt the OSI model. MAC addresses function at the data link layer (layer 2 in the OSI model). They allow computers to uniquely identify themselves on a network at this relatively low level. In this paper, suggested data encryption technique is presented by using the MAC address as a key that is used to authenticate the receiver device like PC, mobile phone, laptop or any other devices that is connected to the network. This technique was tested on some data, visual and numerical measurements were used to check the strength and performance of the technique. The experiments showed that the suggested technique can be used easily to encrypt data that is transmitted through networks.

Keywords: Crossover, Mutation, Information Security, Random, Distortion

14. Paper 31101336: Identification of Diabetic Retinopathy using Fuzzy Logic and Back Propagation Neural Network (pp. 88-95)

Full Text: PDF

C. Berin Jones, Research Scholar, Manonmaniam Sundaranar University, India-627012

Dr. S. Suresh Kumar, Principal, Vivekananda College of Technology for Woman, Tiruchencode, India-637205

Dr. Purushothaman S., Professor, PET Engineering College, Vallioor, India-627117

Abstract- Retinal exudates classification and identification of diabetic retinopathy to diagnose the eyes using fundus images requires automation. This research work proposes retinal exudates classification. Representative features are obtained from the fundus images using segmentation method. Fuzzy logic and back propagation algorithm are trained to identify the presence of exudates in fundus image. The presence of exudates is identified more clearly using Fuzzy logic and back propagation algorithm. By knowing the outputs of proposed algorithm during testing, accurate diagnosis and prescription for treatment of the affected eyes can be done. Fifty fundus images are used for testing. The performance of proposed algorithm is 96% (48 images are classified). Simulation results show the effectiveness of proposed algorithm in retinopathy classification. Very large database can be created from the fundus images collected from the diabetic retinopathy patients that can be used for future work.

Keywords: Diabetic retinopathy; fundus image; exudates detection; Fuzzy logic; back propagation algorithm.

Page updated

Google Sites

Report abuse