IOSR Journal of Computer Engineering (IOSR-JCE)

Jan - Feb 2014Volume 16 ~ Issue 1

Version 1 Version 2 Version 3 Version 4 Version 5 6 7 8 9

Paper Type : Research Paper
Title : Detecting Masquerade in Face Recognition System – A Literature survey
Country : India
Authors : Lina S. || Dr. R. Latha
: 10.9790/0661-16140105    logo

Abstract: A masquerader is an (often external) attacker is one who, after succeeding in obtaining a legitimateuser's credentials, attempts to use the stolen identity to carry out malicious actions.Automatic detection of masquerading attacks is generally undertaken by approaching theproblem from an anomaly detection perspective: a model of normal behaviour for eachuser is constructed and significant departures from it are identified as potentialmasquerading attempts.The most common techniqueto masquerade a face recognition system is to use a photo print or a video of a valid user to gain illegitimate access. There exist methods in literature addressing this issue. This paper presents an analysis of masquerade detection algorithms in face recognition system.

[1] A. Anjos and S. Marcel. Counter-measures to photo attacksin face recognition: a public database and a baseline. InProceedings of
IAPR IEEE International Joint Conferenceon Biometrics (IJCB), Washington DC, USA, 2011.
[2] A. Anjos, L. E. Shafey, R. Wallace, M. G¨unther, C. McCool,and S. Marcel. Bob: a free signal processing and machinelearning
toolbox for researchers. In 20th ACM Conference onMultimedia Systems (ACMMM), Nara, Japan. ACM Press,Oct. 2012.
[3] J. Bai, T.-T. Ng, X. Gao, and Y.-Q. Shi. Is physics-based livenessdetection truly possible with a single image? In IEEEInternational
Symposium on Circuits and Systems (ISCAS),pages 3425–3428, 2010.
[4] W. Bao, H. Li, N. Li, and W. Jiang. A liveness detectionmethod for face recognition based on optical flow field. In2009
International Conference on Image Analysis and SignalProcessing, pages 233–236. IEEE, 2009.
[5] M. M. Chakka, A. Anjos, S. Marcel, R. Tronci, D. Muntoni,G. Fadda, M. Pili, N. Sirena, G. Murgia, M. Ristori, F. Roli,J. Yan, D.
Yi, Z. Lei, Z. Zhang, S. Z.Li, W. R. Schwartz,A. Rocha, H. Pedrini, J. Lorenzo-Navarro, M. Castrill´on-Santana, J. M¨a¨att¨a, A.
Hadid, and M. Pietik¨ainen. Competitionon counter measures to 2-d facial spoofing attacks. InProceedings of IAPR IEEE
International Joint Conferenceon Biometrics (IJCB), Washington DC, USA, 2011.

Paper Type : Research Paper
Title : Combined Cluster Based Ranking for Web Document Using Semantic Similarity
Country : India
Authors : V. Anthoni sahaya balan || S. Singaravelan || D. Murugan
: 10.9790/0661-16140611    logo

Abstract: Multidocument summarization is a set of documents on the same topic, the output is a paragraph length summary. Since documents often cover a number of topic themes with each theme represented by a cluster of highly related sentences, sentence clustering has been explored in the literature in order to provide more informative summaries. An existing cluster-based summarization approach that directly generates clusters first and with ranking next. Ranking distribution of sentences in each cluster should be quite different from each other, which may serve as features of cluster, we propose an integrated approach that overcomes the drawback that we provide ranking for same meaning of different words. As a clustering result to improve or refine the sentence ranking results. The effectiveness of the proposed approach is demonstrated by both the cluster quality analysis and the summarization evaluation conducted on our simulated datasets.
Keywords: Documentation Summarization, Sentence Clustering, Sentence Ranking.

[1] L.Antiqueris, O. N. Oliveira, L. F. Costa, and M. G. Nunes, "A complexnetwork approach to text summarization," Inf. Sci., vol. 175, no.5, pp. 297–327, Feb. 2009.
[2] R.Barzilay and K. R. Mckeown, "Sentence fusion for multi-document news summarization," Comput Linguist., vol. 31, no. 3, pp. 297–327, 2005.
[3] R. Barzilay and L. Lee, "Catching the drift: Probabilistic contentmodels, with applications to generation and summarization," in Proc.HLT-NAACL ‟04, 2004, pp. 113–120.
[4] J. Bilmes, "A Gentle tutorial on the EM algorithm and its applicationto parameter estimation for Gaussian mixture and hiddenMarkov models," Univ. of Berkeley, Berkeley, CA, USA, Tech. Rep.ICSI-TR-97-02, 1997.
[5] Xiaoyan Cai and Wenjie Li, "Ranking Through Clustering: An Integrated Approach to Multi-Document Summarization," IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 21, NO. 7, JULY 2013

Paper Type : Research Paper
Title : Performance Analysis of Routing Protocols in Mobile AD-HOC Networks (MANETs)
Country : India
Authors : Konduri Sucharitha || Dr. R. Latha
: 10.9790/0661-16141217    logo

Abstract: A mobile ad-hoc network (MANET) is a self starting dynamic network comprising of mobile nodes, where each and every participation node voluntarily transmit the packets destined to some remote node using wireless (radio signal) transmission. The main aim behind the developing of ad hoc networking is multi-hop relaying. Wireless Ad hoc networks or infrastructure less networks are very easy to establish by using radio waves as transmitting medium without the requirements of any other equipment or infrastructure. An ad hoc network doesn't have any centralized arbitrator or server. In MANET, all networking functions such as routing and packet forwarding, are performed by nodes themselves in a self-organizing manner. For these reasons, securing a mobile ad-hoc network is very challenging in many areas such as routing, bandwidth, security, power consumption, collisions, simulations, and topology control due to moving nodes. This paper provides an overview of AODV, DSR, and TORA. The comparisons among three routing protocols are based on the various protocol property parameters such as Route Discovery, Network Overhead, Periodic Broadcast, Node overhead etc. different routing protocols proposed in literature and also provide a comparison between them.
Keywords: Mobile Adhoc Network, Protocol property, AODV, DSR, TORA , Route Discovery

[1] Charles E.Perkins and Elizabeth M. Royer, "Ad hoc on demand distance vector (AODV) routing (Internet-Draft)", Aug-1998.
[2] C. E. Perkins and E. M. Royer; "Ad-Hoc On Demand Distance Vector Routing", Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), PP: 90-100, 1999.
[3] V. Park and S. Corson, "Temporally Ordered Routing Algorithm (TORA) Version 1, Functional specification",IETF Internet draft,, 1998.
[5] Padmini Misra, "Routing Protocols for ad hoc mobile wireless Networks", /~jain/cis788-99/ftp/adhoc_routing/#TDRP, Nov-1999.

Paper Type : Research Paper
Title : Data Quality in Data warehouse: problems and solution
Country : India
Authors : Rahul Kumar Pandey
: 10.9790/0661-16141824    logo

Abstract: In recent years, corporate scandals, regulatory changes, and the collapse of major financial institutions have brought much warranted attention to the quality of enterprise data if we can better understand the problems of quality issues, then we can develop a plan of action to address the problem that is both proactive and strategic. Each instance of a quality issue presents challenges in both identifying where problems exist and in quantifying the extent of the problems. Quantifying the issues is important in order to determine where our efforts should be focused. It is reported that more than $2 billion of U.S. federal loan money had been lost because of poor data quality at a single agency. It also reported that manufacturing companies spent over 25% of their sales on wasteful practices. Over the period of time many researchers have contributed to the data quality issues, but no research has collectively gathered all the causes of data quality problems at all the phases of data warehousing along with their possible solution. problems in different phase of data warehouse i.e.; data sources, data integration & data profiling, Data staging and ETL, data warehouse modeling & schema design are discussed in this paper.

Keywords: Data Quality (DQ), Statistical Process Control (SPC),ETL, Data Staging, Data Warehouse.

[1] A Descriptive Classification of Causes of Data Quality Problems in Data Warehousing ,R Singh ,Dr k Singh.
[3] "TDWI Data Cleansing: Delivering High-Quality Warehouse Data."
[4] Thibodeau, Patrick. "Data Problems Thwart Effort to Count
[5] AmolShrivastav,MohitBhaduria, Harsha Rajwanshi (2008), " Data Warehouse and Quality Issues", Warehouse-and-Quality-Issues.

Paper Type : Research Paper
Title : The Native Java Programming Language has suffered a Continuing Series of Vulnerabilities during the Past Two or More Years that Threaten to Destabilize Our Internet Technology
Country : Nigeria
Authors : Audu Jonathan Adoga || Lilian Nwanyanwu || Garba M. Rabiu
: 10.9790/0661-16142539    logo

Abstract: The native Java Programming Language whose importance to the internet cannot be over emphasised, has suffered series of vulnerabilities that threaten to destabilize the Internet Technology. Most of the vulnerabilities are introduced into the internet when the functionalities of a language are increased or when new version of a language is released but the discovery of these security holes and the provision of patches to these holes are usually done by either relevant professional organization such as OWASP and CVE or the inventor (s) of the language. This review tries to explain the concept of vulnerabilities, the native Java flaws and practical solutions to the vulnerabilities as proffered by relevant computer security organization(s).This will serve as a guide to software developers considering the devastating effects of the ignorance of secure coding methods.
Keywords: Flaws, Holes, Obfuscation, Patches, Vulnerability.

[1] Oxford, oxfordenglish dictionary. 7thed(Oxford: Oxford University Press,2012).
[2] Watson, D.,The Evolution Web Applications Attacks. Network Security [e-journal] 2007(11) Available through : Anglia Ruskin University Library website [Accessed 4 March 2013]
[3] Kuzma, J., European Digital Libraries: Web Security Vulnerabilities. Library Hi Tech [e-journal] 28(3),2010 Available through : Anglia Ruskin University Library website [Accessed 4 March 2013]
[4] Prunet,M.,Hashing Java, Open Web Application Security Project, 2008 [online] Available at<> [Accessed 6 March, 2013]
[5] Williams, J., How to Add Validation Logic to HttpServletRequest, Open Web Application Security Project, 2008

Paper Type : Research Paper
Title : Study of Cloud Computing
Country : India
Authors : Drashti Hirani || Darshan Thoria
: 10.9790/0661-16144651    logo

Abstract: Cloud computing is rising as the next generation platform for computation. May be in future Cloud computing will be the main platform to save the world; this makes people can have everything they need on it. Main advantages of the Cloud computing is used for on-demand gathering of information, technology services and products. The name Cloud has come from the Internet, based on how it is depicted in computer network diagrams, and is an abstraction for the complex infrastructure it conceals. In general we can define cloud com-puting is style of computing in which IT-related capabilities are provided "as a service", allowing users to access technology-enabled services from the Internet without knowledge of, expertise with, or control over the technology infrastructure that supports them. Email application was probably the first service on the "cloud".

KeyWords: Cloud Computing, Virtulization, Utility Computing.

[1] J. Geelan, "Twenty-one experts define cloud computing,"Cloud Computing Journal,vol.4, pp. 1-5, 2009.
[2] "Cloud Computing – Issues, Research and Implementations" Mladen A. Vouk Department of Computer Science, North Carolina State University, Raleigh, NC 27695, USA Proceedings of the ITI 2008 30th Int. Conf. on Information Technology Interfaces, June 23-26, 2008, Cavtat, Croatia
[3] "Cloud computing for small lresearch groups in computational science and engineering: current status and outlook "Computing(2011) ©Springer-Verlag2010.

Paper Type : Research Paper
Title : Survey on Security Issues and Secure Protocols for Manet
Country : India
Authors : Indu Singh
: 10.9790/0661-16145260    logo

Abstract: A mobile ad-hoc network (MANET) is a self-configuring network of mobile routers (and associated hosts) connected by wireless links the union of which form an arbitrary topology. The routers are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably. Many of the ad hoc routing protocols that address security issues rely on implicit trust relationships to route packets among participating nodes. Besides the general security objectives like authentication, confidentiality, integrity, availability and non-repudiation, the ad hoc routing protocols should also address location confidentiality, cooperation fairness and absence of traffic diversion. In MANET , any node may compromise the routing protocol functionality by disrupting the route discovery process .We present a route discovery protocol that mitigates the detrimental effects of such malicious behavior as to provide correct connectivity information . Here scheme guarantees that node initiating a route discovery will be able to identify and discard replies providing false topological information, or, avoid receiving them. For this basic route query broadcast that provides. Secure Routing we propose the Secure Routing Protocol (SRP) that is to be applied on extension of ZRP, DSR and IERP.
Index Terms: Ad hoc networks, security attacks, secure routing.

[1]. J.-P. Hubaux, L. Buttyan, and S. Capkun, The quest for security in mobile ad hoc networks," in The 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing, October 2001.
[2]. L. Zhou and Z. Haas, Securing ad hoc networks," IEEE Network Magazine, vol. 13, November/December 1999.
[3]. Manel Guerrero Zapata. Secure Ad hoc On-Demand Distance Vector (SAODV) Routing INTERNET-DRAFT draft-guerrero-manet-saodv-00.txt, August 2002. First published in the IETF MANET Mailing List (October 8th 2001).
[4]. Bridget Dahill, Brian Neil Levine, Elizabeth Royer, Clay Shields. A Secure Routing Protocol for Ad Hoc Networks In Proceedings of the 10 Conference on Network Protocols (ICNP), November 2002.
[5]. S. Yi, P. Naldurg, and R. Kravets Security-Aware Ad hoc Routing for Wireless Networks The Second ACM Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc'01), 2001.(another version Security-Aware Ad Hoc Routing Protocol for Wireless Networks, Report, August, 2001).

Paper Type : Research Paper
Title : Survey on Various Security Issues and prevention method in Vehicular Ad hoc Networks
Country : India
Authors : P. Dharani || Pravin R. Patil || C. Mahesh
: 10.9790/0661-16146166    logo

Abstract: Vehicular adhoc networks are a subset of mobile adhoc networks. This forms wireless network between vehicles for better communications and to break away from the hindrance caused by attackers. Various security architectures and methods are proposed. In this paper, we focused on the survey for various security issues and preventive methods from works for vanets.

[1] Globecom 2012 - Communication and Information System Security Symposium A Security Metric for VANET Content DeliveryIkecukwu K. Azogu, Michael T. Ferreira, Hong Liu, Department of Electrical and Computer Engineering University of Massachusetts Dartmouth 285 Old Westport Road. N. Dartmouth, USA Email: U_Iazogu, MFerreira,
[2] A Smart City Framework for Intelligent Traffic System Using VANET Ganesh S. Khekare Department of Computer Science and Engineering G. H. RaisoniCollege of Engineering Nagpur, India., Apeksha V. Sakhare Department of Computer Science and Engineering G. H. RaisoniCollege of Engineering Nagpur, India.
[3] 2011 International Conference on Advanced Information Networking and Applications A Survey on Trust Management for VANETs Jie Zhang School of Computer Engineering, Nanyang Technological University, Singapore,
[4] 2007 International Conference on Convergence Information Technology Anonymous and Traceable Communication Using Tamper-Proof Device for Vehicular Ad Hoc Networks Bum Han Kim_1, Kyu Young Choi1, Jun Ho Lee1, and Dong Hoon Lee2Center for Information Security Technologies Korea University, Seoul, Korea{anewholic, young, jhlee},
[5] First International Conference on Intelligent Networks and Intelligent Systems Capacity, collision and interference of VANET with IEEE 802.11 MAC Wu Ming1), Yang Lin-tao2), Li Cheng-yi2), Jiang Hao2)1) (Wuhan Maritime Communication Research Institute, Wuhan 430079, China)2) (Department of Electronic Information, Wuhan University, Wuhan 430079, China)

Paper Type : Research Paper
Title : WLAN Security Issues and Solutions
Country : India
Authors : Deepika Dhiman
: 10.9790/0661-16146775    logo

Abstract: Wireless network is widely used in many sectors due to ease of installation, flexibility, mobility, reduced cost-of-ownership, and scalability. Wi- Fi network can be accessed with laptops, mobile phones, cameras, game consoles and many other increasing numbers of consumer electronic gadgets. Wireless Local Area Network (WLAN) technology has changed the way people communicate and share information by eliminating the boundaries of distance and location. However, WLAN have some security threats- Denial of Service, Spoofing, Eavesdropping, Man-In-The-Middle etc. In this report, we will discuss about the various WLAN (IEEE 802.11) security standards – WEP, WPA, WPA2 (IEEE 802.11i – 802.1x, PPP and EAP). The solutions /products to prevent wireless networks from the described threats have also been brought to limelight for current and future WLAN security.
Keywords: IEEE 802.11, IEEE 802.1x, Wireless LAN, WEP,WPA, SSID, MAC.

[1] Al Naamany, A. M., Shidhani, A., &H. Bourdoucen, IEEE 802.11 wireless LAN security overview. International Journal of Computer Science and Network Security, 6(5B), 2006,138-186.
[2] S. K. Asagodu, Wireless LAN Security and IEEE 802.11 Department of Computer Science Engineering: Vishveshwaraiah Technological University- S.D.M College of Engineering and Technology, 2009-10.
[3] H. Boland&H. Mousavi, Security issues of the IEEE 802.11b wireless LAN.Canadian Conference on Electrical and Computer Engineering, 2004.
[4] V. Chandramouli, A detailed study on wireless LAN technologies, "http://crystal. uta. edu/~ kumar/cse6392/termpapers/Vijay_paper.pdf#search='A%20Detailed%20Study%20on%20Wireless% 20LAN% 20Technologies," 2002.
[5] R. T. Chinta, T.F. Wong &J.M. Shea, Energy-efficient jamming attack in IEEE 802.11 MAC,Military Communications Conference (MILCOM), 2009.

Paper Type : Research Paper
Title : Edge Adaptive Image Steganography Based on Adaptive Pixel Pair Matching
Country : India
Authors : Akhil P. V. || Akbersha K. E. || Mohammed Sidheeque
: 10.9790/0661-16147680    logo

Abstract: This paper proposes a new improved steganographic technique based on pixel pair matching which is driven by edge adaptive technique. The cover image is scanned first to explore the edges of the image and is used as the candidate region to perform data hiding using pixel pair matching. The basic idea of pixel pair matching (PPM) is to use the value of a pixel pair as a reference coordinate, and search a coordinate in the neighborhood set of this pixel pair according to a given message digit. The pixel pair is then replaced by the searched coordinate to conceal the digit. The method uses only sharper edge regions while keeping the other smoother regions as they are. In contrast to the existing methods based on PPM, the masking driven approach has lower distortion for various payloads. The proposed method is expected to provide better performance than the existing techniques based on LSB and also secure against well-known steganalysis techniques.
Keywords: Image steganography, LSB encoding, payload, cover image, stego image.

[1] T. Filler, J. Judas, and J. Fridrich, "Minimizing embedding impact in steganography using trellis-coded quantization," in Proc. SPIE, Media Forensics and Security, 2010, vol. 7541, DOI: 10.1117/12.838002.

[2] S. Lyu and H. Farid, "Steganalysis using higher-order image statistics,"IEEE Trans. Inf. Forensics Security, vol. 1, no. 1, pp. 111–119, Mar.2006.

[3] E Lin and E Delp, "A Review of Data Hiding in Digital Images" CERIAS Tech Report 2001-139.

[4] J. Mielikainen, "LSB matching revisited," IEEE Signal Process. Lett., vol. 13, no. 5, pp. 285–287, May 2006.

[5] C. K. Chan and L. M. Cheng, "Hiding data in images by simple LSB substitution," Pattern Recognit., vol. 37, no. 3, pp. 469–474, 2004.

Paper Type : Research Paper
Title : Design and Development of Web-based Expert System to Detect Network Intrusion
Country : Indonesia
Authors : Asghaiyer Mohamed Asghaiyer || Purnomo Budi Santoso || Harry Soekotjo Dachlan
: 10.9790/0661-16148190    logo

Abstract: It is very important that the security mechanisms of a system are designed so as to prevent unauthorized access to system resources and data. However, completely preventing breaches of security appear, at present, unrealistic. We can, however, try to detect these intrusion attempts so that action may be taken to repair the damage later. Expert system (ES) has been proposed to be the beter solution of reasoning on the existing problems on the basis of expert knowledge. Experts 'brain' are stored in a database called a knowledge base and then made the rules to give decisions in accordance with the knowledge base.In this research, knowledge base taken from the expert and journal. Expert system will be used to determine or predict the occurrence of intrusion detection systems based on the feature above. By simple means, any data packet is going to be examined by ES, which initially stores knowledge about intrusion characteristics from database as variables. The result of this research is anomaly packet already detected by the application according to the rule based on the expert and the journal.
Keywords: anomaly packet, expert system, intrusion, knowledge base, network packet.

[1]. Abraham, Ajith. 2005. Rule-based Expert System. Oklahoma State University, OK, USA.
[2]. Donald, W.A. 1986. A Guide to Expert Systems, Addison- Wesley, Boston, MA.
[3]. Faloutsos, M; Faloutsos, P; and Faloutsos, C. On power-law relationships of the internet topology. In Proceedings of ACM SIGCOMM, 1999.
[4]. Goodson, James. 1990. The Development of An Expert System for Software Cost Estimation. Air Force Institute of Technology, USA.
[5]. Kelly, James. 2006. Master Thesis : An Examination of Pattern Matching Algorithms for Intrusion Detection System. Carleton University, Canada.

Paper Type : Research Paper
Title : Comparative Analysis of Smart Card Authentication Schemes
Country : India
Authors : Toshi jain
: 10.9790/0661-16149197    logo

Abstract: Various kinds of authentication schemes have been deployed to secure the information or resources from unauthorized access. In these schemes, server maintains a verification table which is vulnerable to a variety of attacks. To withstand the possible attacks for verification table, smart card based authentication scheme has been proposed as an alternative solution. Smart card is a small, tamper-resistant device providing users with a convenient storage and processing capability, it is widely used for a range of applications such as remote user login, online banking, ID verification, access control and e-commerce etc. This article gives comparative analysis of major smart card authentication schemes for single server as well as multi-server environment.
Keywords: Denial-of-Service attack, denning-sacco attack, insider attack, perfect forward secrecy, user anonymity.

[1] L. Lamport, "Password authentication with insecure communication", Communications of the ACM, vol. 24, no.11, 1981, pp. 770-772.
[2] M.S. Hwang and L.H. Li, "A new remote user authentication scheme using smart cards", IEEE Transactions on Consumer Electronics, vol. 46, no. 1, 2000, pp. 28-30.
[3] C. K. Chan and L. M. Cheng, "Cryptanalysis of a remote user authentication scheme using smart cards," IEEE Transactions on Consumer Electronics, vol. 46, no. 4, 2000, pp. 992-993.
[4] J. J. Shen, C. W. Lin and M. S. Hwang, "A modified remote user authentication scheme using smart cards", IEEE Transactions on Consumer Electronics, vol. 49, no. 2, 2003, pp. 414-416.
[5] Kai-Chi Leung, L.M. Cheng, Anthony S. Fong, and Chi-Kwong Chan, "Cryptanalysis of a modified remote user authentication scheme using smart cards", IEEE Transactions on Consumer Electronics, vol. 49, no. 4, 2003, pp. 1243-1245.

Paper Type : Research Paper
Title : Holistic and Procedural Features for Authenticating Users
Country : India
Authors : D. Lakshmipriya || Prof. J. R. Balakrishnan
: 10.9790/0661-161498101    logo

Abstract: Security systems help to protect machines or sensitive data from unauthorized users. The need for better and cheap security systems is growing with the growth in technologies and hacking skills of the people. Various techniques are available that can provide some level of security. The problem of unintended side-effects of inconsistent experimental condition and environmental variables by restricting user's mouse operation to a tightly-controlled environment has been addressed with the solution of mouse operations as dynamics. Mouse dynamics measures and assesses a user's mouse-behavior characteristic for use as a biometric. For Each mouse operation task both holistic and procedural features are extracted. This type of authentication is very simple and efficient for the users. Then a Nearest Neighbor algorithm is employed for extracting the feature and anytime algorithm for the accuracy and speed. This approach achieves to improve the number of users with a false acceptance rate of 8.75% and a false rejection rate of 7.70%.This approach could lead to a performance boost both in authentication accuracy and authentication time.

[1]. A.A.E.Ahmed and I.TraroeCompur (2007), 'A new biometric technology based on mouse dynamics,' IEEE Trans. Depend. Secure.
[2]. P.Bours and C.J.Fullu (2009),'A login system using mouse dynamics,' Proc.5th Int. Conf. Intelligent Information Hiding and Mulimedia Signal Processing.
[3]. R. Brooks, T. Arbel, and D. Precup(2008), 'Anytime similarity measures forfaster alignment,' J. Comput. Vis. Image Understand.
[4]. R. Everitt and P. W. McOwa(2003),'Java-based internet biometric authentication system,'IEEE Trans. Pattern Anal. Mach. Intell.
[5]. S. Hashia, C. Pollett, and M. Stamp(2005), 'On using mouse movements as a biometric,' Proc. Int. Conf. Computer Science and Its Applications, Singapore.

Paper Type : Research Paper
Title : Privacy Preserving and Load Balancing For Secure Cloud Storage
Country : India
Authors : S. Sasikala || T. Karthick
: 10.9790/0661-1614102106    logo

Abstract: Using Cloud Storage, users can remotely store their data and enjoy the on-demand high quality applications and services from a shared pool of configurable computing resources, without the burden of local data storage and maintenance. However, the fact that users no longer have physical possession of the outsourced data makes the data integrity protection in Cloud Computing a formidable task. Unfortunately, sharing data in a multi-owner manner while preserving data and identity privacy from an untrusted cloud is still a challenging issue, due to the frequent change of the membership. In proposed a secure cloud storage for multi-owner data sharing authentication system supporting privacy-preserving by enabling public auditability for cloud storage with critical importance so that users can resort to a third party auditor (TPA) to check the integrity of outsourced data and be worry-free. And also by encryption and hashing techniques, such as Advanced Encryption Standard (AES), Merkle Hash Tree, any cloud user can anonymously share data with others.

[1] G. Ateniese, K. Fu, M. Green, and S. Hohenberger (2005), "Improved Proxy Re- Encryption Schemes with Applications to Secure Distributed Storage", Proc. Network and Distributed Systems Security Symp. (NDSS), pp. 29-43.
[2] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, "Provable Data Possession at Untrusted Stores", proc. 14th ACM Conf. Computer and Comm. Security (CSS ‟07), pp. 598-609.
[3] K.D. Bowers, A. Juels, and A. Oprea (2009), "HAIL: A High-Availability and Integrity Layer for Cloud Storage", Proc. ACM Conf. Computer and Comm. Security (CCS ‟09), pp. 187-198.
[4] A. Fiat and M. Naor (1993), "Broadcast Encryption", proc. Int‟l Cryptology Conf. Advances in Cryptology(CRYPTO), pp. 480-491.
[5] E. Goh, H. Shacham, N. Modadugu, and D. Boneh (2003), "Sirius: Securing Remote Untrusted Storage", Proc. Network and Distributed Systems Security Symp. (NDSS), pp. 131-145.

Paper Type : Research Paper
Title : TAB-PRRA: Improved Link Repair Decision Mechanism for On-demand Routing in MANET
Country : India
Authors : Ms. Deepika Patil || Mrs. Nitika Vats Doohan
: 10.9790/0661-1614107112    logo

Abstract: The traditional AODV protocol uses a fixed hop count based threshold as a basis for deciding when to invoke Local Repair or Source Repair in case of a link break. The problem arises with this type of repairing mechanism is that the network is not clear that at which time what algorithms needs to be applied. So some condition has to be identified on the basis of which the decision can be taken. Also the decision must be pre-emptive so that the loss of data can be avoided before occurrence. In this paper, a Threshold Alarm Based Pre-emptive Route Repair Algorithm (TAB-PRRA) for Multi-Hop Local repair in ADOV is presented and simulated. It focuses on measuring those parameters which provides an prior information of link failure before its occurrence and also if the link break occurs that the network must know the time to start the route discovery. The approach offers efficient utilization of network resources such as energy and bandwidth.
Index Terms: MANET, AODV, TAB (Threshold Alarm Based), PRRA (Pre-emptive Route Repair Algorithm), RREQ, RREP, Local Repair;

[1] Saaidal R. Azzuhri, Marius Portmann & Wee Lum Tan , "Evaluation of Parameterised Route Repair in AODV" in IEEE Transaction 2011.
[2] Zeki Bilgin & Bilal Khan "A Dynamic Route Optimization Mechanism for AODV in MANETs " in IEEE Transaction 2010.
[3] S. Revathi & T. R. Rangaswamy , "Secured Optimal Adaptable Ad-Hoc Routing Protocol in MANET S". in European Journal of Scientific Research Issn 1450-216, Vol.73 No.1, 2012.
[4] Jyoti Jain, Roopam Gupta in T.K. Bandhopadhyay, "On Demand Local Link Repair Algorithm for AODV Protocol " in IJCA Volume 35– No.5, December 2011.
[5] Rachid Haboub & Mohammed Ouzzif, "Secure & reliable routing in MANET" in IJCSES Vol.3, No.1, February 2012.

IOSR Journals are published both in online and print versions.