Volume-5 , Issue-5 , May - 2017 Go Back

Many users store their data in the cloud storage and benefit from high quality applications and services from a common group of configurable computing resources like networks, servers, storage, applications, and services, by these users can avoid the load of local data storage and protection. However, the fact that users no longer have physical control of the large size of data makes data reliability protection in Cloud computing a challenging task, especially for users with constrained computing resources. Cloud computing is used by many software industries nowadays, since security is not provided in cloud, many companies adopt their unique security structure. To avoid this problem, users can route data to a third party auditor (TPA) he can check the integrity of rooted data.TPA can be securely introduced such that the auditing process should not create any problems towards user data privacy, and should not bring in no added load to user. In this paper, we are securing the user data and providing privacy. We further expand the TPA to carry out multiple auditing tasks concurrently and powerfully. Wide-range of security and performance investigation shows the proposed schemes are provably secure and highly efficient.

Data Storage, Privacy-Preserving, Public Review Ability, Cryptographic Protocols, Cloud Computing

[1]. P. Mell, T. Grance, “The NIST Definion of Cloud Computing”, National Institute of Standards and Technology, Vol.53, Issue.6, pp.1-50, 2009.
[2]. M. Armbrust, A. Fox, R. Griffith, AD. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, M. Zaharia, “ A view of cloud computing”, Communications of the ACM, Vol.53, Issue.4, pp.50-58, 2010.
[3]. M. Bellare, P. Rogaway, “Random oracles are practical: A paradigm for designing efficient protocols”, In First Conference on Computer and Communications Security, USA, pp. 62-73, 1993.
[4]. A. Hirne, S. Namdev, H.S. Tomar, "Secure Data Distribution in Cloud Environment Using Key Aggregation Cryptic", International Journal of Scientific Research in Computer Science and Engineering, Vol.4, Issue.2, pp.15-19, 2016.
[5]. G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable data possession at untrusted stores”, Proceedings of the 14th ACM conference on Computer and communications security, Alexandria, pp. 598–609, 2007.
[6]. C Wang, SSM Chow, Q Wang, K Ren, W. Lou, “Privacy-preserving public auditing for secure cloud storage”, IEEE transactions on computers, Vol.62, Issue.2, pp.362-75, 2013.
[7]. Q. Wang, C. Wang, J. Li, K. Ren, W. Lou, “Enabling public verifiability and data dynamics for storage security in cloud computing,” in Proc. of ESORICS’09 (volume 5789 of LNCS Springer-Verlag), Barlin,pp. 355–370, 2009.

MS. Sulthana, T. Samatha, V. Sravani, A. Mahendra , "Multiple Auditing Schemes with Integrity and Reliability in Cloud Computing," International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.1-6, 2017.

There has been various interoperability issues among Building Information Modelling (BIM) and structural engineering design software programmes but there is still minimum researches to understand, test and evaluate the interoperability issues. This paper provides a better understanding of interoperability issues and its importance in providing more efficient interoperability among programmes for building information modelling to act as platform to exchange information among other disciplines. An attempt has been made by using Autodesk Revit as host of building information modelling whereas ESTEEM 9 and Orion 18 as structural engineering design software to identify interoperability issues arise due to information exchange. The interoperability issues were evaluated and causes of interoperability issues was identified. This research also offers an in-depth understanding of interoperability issues and importance of rectifying these interoperability issues in order for Architecture Engineering Construction (AEC) industry to adopt BIM completely for their projects. The ultimate outcome of this research offers the interoperability issues identified, the causes of interoperability issues and some suggestions to overcome these issues.

Building Information Modelling, Interoperability Issues, Structural Engineering, Three-dimensional Model

[1] R Sacks, I Kaner, CM Eastman, YS Jeong, “The Rosewood experiment—Building information modeling and interoperability for architectural precast facades”, Automation in Construction, Vol.19, Issue.4, pp.1-3, 2010.
[2] Azhar. S., Nadeem A., Mok J.Y., Leung B.H., “Building Information Modeling (BIM): A new paradigm for visual interactive modeling and simulation for construction projects”, First International Conference on Construction in Developing Countries, Karachi, pp.435-446, 2008.
[3] D Bryde, M Broquetas, JM Volm, “The project benefits of building information modelling (BIM)”, International journal of project management, Vol.31, Issue.7, pp.971-980, 2013.
[4] H. Zhi, “Risk management for overseas construction projects”, International journal of project management, Vol.13, Issue.4, pp.231-237, 1995.
[5] R Miller, DR Lessard, P Michaud, S Floricel,”The strategic management of large engineering projects: Shaping institutions risks and governance”, MIT press, USA. pp.23-42, 2001.
[6] TC. Tse, ”The interoperability of building information models and document models in the Hong Kong construction industry”, Doctoral dissertation from The Hong Kong Polytechnic University, Hong-Kong, pp.1-184, 2009.
[7] J. Steel, R. Drogemuller, B. Toth, “Model interoperability in building information modelling”, Software and Systems Modeling”, Vol.11, Issue.1, pp.99-109, 2012.
[8] R. Eglash, “The Machine in Me: An Anthropologist Sits among Computer Engineers”, American Ethnologist, Vol.27, Issue.1, pp.182-184, 2000.
[9] A Porwal, KN Hewage, “Building Information Modeling (BIM) partnering framework for public construction projects”, Automation in Construction, Vol.3, Issue.1, pp.204-214, 2013.
[10] AH. Oti, “Building information modelling for sustainability appraisal of conceptual design of steel-framed buildings”, Doctoral dissertation, University of Nottingham, Nottingham, pp.1-220, 2014.
[11] VA. Chavan, S.R. Durugkar, “Information Retrieval System Using Vector Space Model for Document Summarization”, International Journal of Computer Sciences and Engineering, Vol.2, Issue.10, pp.46-50, 2014

R.S. Kartikeayan, S. Salmaliza, Y. Mohd Rashid, "Building Information Modelling: Interoperability Issues," International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.7-19, 2017.

A new Quantum Inspired Evolutionary Computational Technique (QIECT) is reported in this work. It is applied to a set of standard test bench problems and a few structural engineering design problems. The algorithm is a hybrid of quantum inspired evolution and real coded Genetic evolutionary simulated annealing strategies. It generates initial parents randomly and improves them using quantum rotation gate. Subsequently, Simulated Annealing (SA) is utilized in Genetic Algorithm (GA) for the selection process for child generation. The convergence of the successive generations is continuous and progresses towards the global optimum. Efficiency and effectiveness of the algorithm are demonstrated by solving a few unconstrained Benchmark Test functions, which are well-known numerical optimization problems. The algorithm is applied on engineering optimization problems like spring design, pressure vessel design and gear train design. The results compare favorably with other state of art algorithms, reported in the literature. The application of proposed heuristic technique in mechanical engineering design is a step towards agility in design.

Constraint Optimization, Mechanical Engineering Design problems, Quantum Inspired Evolutionary Computational Technique, Unconstrained Optimization

[1] K. Deb, “An efficient constraint handling method for genetic algorithms”, Computer Methods in Applied Mechanics and Engineering, Vol.186, Issue. 2, pp.311, 2000.
[2] C.A.C. Coello, “Self adaptive penalties for GA based optimization”, In the Proceeding of the congress on Evolutionary Computation, IEEE service centre, D C Washington, pp.573-580, 1999.
[3] C.A.C. Coello, E.M. Montes, “Constraint- handling in genetic algorithms through the use of dominance-based tournament selection”, Advanced Enggineering Informatics, Vol. 16, Issue.3, pp.193-197, 2002.
[4] Z. Guo, S. Wang, X. Yue, D. Jiang, K. Li, “Elite opposition-based artificial bee colony algorithm for global optimization”, International Journal of Engineering Transaction C: Aspects, Vol.28, Issue.9, pp.1268-1275, 2015.
[5] A. Alfi, A. Khosravi, “Constrained nonlinear optimal control via a hybrid ba-sd”, International Journal of Engineering, Vol.25, Issue.3, pp.197-204, 2012.
[6] B. Akay, D. Karaboga, “Artificial bee colony algorithm for large scale problems and engineering design optimization”, Journal of Intelligent Manufacturing, Vol.23, Issue.4, pp.1001-1014, 2012.
[7] H. Garg, “Solving structural engineering design optimization problems using an artificial bee colony algorithm”, Journal of Industrial and Management Optimization, Vol.10, Issue.3, pp.777-794, 2014.
[8] H. Garg, “A hybrid PSO-GA algorithm for constrained optimization problems”, Applied Mathematics and Computation, Vol.274, Issue.C, pp.292-305, 2016.
[9] A. Kaveh, S. Talatahari, “An improved ant colony optimization for constrained engineering design problems”, Engineering Computer, Vol.27, Issue.1, pp.155-182, 2010.
[10] A. Askarzadeh, “A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm”, Computers and Structures, Vol.169, Issue.1, pp.1-12, 2016.
[11] K. Hans Raj, R.S. Sharma, G.S. Mishra, A. Dua, C. Patvardhan, “An Evolutionary Computational Technique for constrained optimization in engineering design”, Journal of Institutions of Engineers (India), Vol.86, Issue.2, pp.121-128, 2005.
[12] S. Yang, F. Liu, L. Jiao, “The quantum evolutionary strategies”, Acta Electron Sinica, Vol.29, Issue.12, pp.1873-1877, 2001.
[13] K.H. Han, J.H. Kim, “Quantum-inspired evolutionary algorithms with a new termination criterion H gate and two-phase scheme”, IEEE Transactions on Evolutionary Computation, Vol.8, Issue.2, pp.156-169, 2004.
[14] L.D.S. Coelho, “Gaussian quantum-behaved particle swarm optimization approaches for constrained engineering design problems”, Expert systems with Applications, Vol.37, Issue.2, pp.1676-1683, 2010.
[15] Y. Wang, J. Zhou, L. Mo, S. Ouyang, Y. Zhang, “A clonal real-coded quantum-inspired evolutionary algorithm with cauchy mutation for short-term hydrothermal generation scheduling”, Electrical Power and Energy Systems, Vol. 43, pp.1228-1240, 2012.
[16] K. Hans Raj, R. Setia, “Quantum seeded evolutionary computational technique for constrained optimization in engineering design and manufacturing”, Struct. Multidisc. Optimization, Vol.55, Issue.3, pp. 751-766, 2017.
[17] M. Lundy, A. Mees, “Convergence of an annealing algorithm”, Mathematical Programming, Vol.34, Issue.1, pp.111-124, 1986.
[18] S.E. Moumen, R. Ellaia, R. Aboulaich, “A new hybrid method for solving global optimization problem”, Applied Mathematics and Computation, Vol.218, Issue.7, pp.3265-3276, 2011.
[19] L. Idoumghar, N. Chérin, P. Siarry, R. Roche, A. Miraoui, “Hybrid ICA-PSO algorithm for continuous optimization”, Applied Mathematics and Computation, Vol.219, Issue.24, pp.11149-11170, 2013.
[20] P. Civicioglu, “Backtracking search optimization algorithm for numerical optimization problems”, Applied Mathematics Computation, Vol.219, Issue.15, pp.8121-8144, 2013.
[21] M. Gang, Z. Wei, C. Xiaolin, “A novel particle swarm optimization algorithm based on particle migration”, Applied Mathematics and Computation, Vol. 218, Issue.11, pp.6620-6626, 2012.
[22] G. Xu, “An adaptive parameter tuning of particle swarm optimization algorithm”, Applied Mathematics and Computation, Vol.219, Issue.9, pp.4560-4569, 2013.
[23] Y. Jiang, T. Hu, C.C. Huang, X. Wu, “An improved particle swarm optimization algorithm”, Applied Mathematics and Computation, Vol. 193, Issue.1, pp.231-239, 2007.
[24] M. Xi, J. Sun, W. Xu, “An improved quantum-behaved particle swarm optimization algorithm with weighted mean best position”, Applied Mathematics and Computation, Vol.205, Issue.2, pp.751-759, 2008.
[25] L.Y. Chuang, S.W. Tsai, C.H. Yang, “Chaotic catfish particle swarm optimization for solving global numerical optimization problems”, Applied Mathematics and Computation, Vol.217, Issue.16, pp.6900-6916, 2011.
[26] J. Li, Y. Tang, C. Hua, X. Guan, “An improved krill herd algorithm: Krill herd with linear decreasing step”, Applied Mathematics and Computation, Vol.234, Issue.C, pp.356-367, 2014.
[27] B.H.F. Hasan, I.A. Doush, E.A. Maghayreh, F. Alkhateeb, M. Hamdan, “Hybridizing Harmony Search algorithm with different mutation operators for continuous problems”, Applied Mathematics and Computation, Vol.23, Issue.2, pp.1166-1182, 2014.
[28] F. Zhoug, H. Li, S. Zhoug, “A modified ABC algorithm based on improved-global-best-guided approach and adaptive limit strategy for global optimization”, Applied Soft Computing, Vol.46, Issue.C, pp.469-486, 2016.
[29] X.S. Yang, “Test problems in optimization”, in Engineering Optimization: An Introduction with metaheuristic applications, John Wiley and Sons, USA, pp.1-23, 2010.
[30] J. Arora, “Introduction to optimum design, MGraw-Hill, New York, pp.1-728, 1989.
[31] S. He, E. Prempain, Q.H. Wu, “An improved particle swarm optimizer for mechanical design optimization problems”, Engineering Optimization, Vol.36, Issue.5, pp.585-605, 2004.
[32] L.C. Cagnina, S.C. Esquivel, C.A.C. Coello, “Solving engineering optimization problems with the simple constrained particle swarm optimizer”, Informatica, Vol.32, Issue.3, pp.319-326, 2008.
[33] A.D. Belegundu, “A study of mathematical programming methods for structural optimization”, Internal Report Department of Civil and Environmental Engineering (University of lowa), USA, pp.1-26, 1982.
[34] T. Ray, P. Saini, “Engineering design optimization using a swarm with intelligent information sharing among individuals”, Engineering Optimization, Vol.33, Issue.33, pp.735-748, 2001.
[35] Q. He, L. Wang, “An effective co-evolutionary particle swarm optimization for constrained engineering design problems”, Engineering Application with Artificial intelligence, Vol.20, Issue.1, pp.89-99, 2007.
[36] Y. Wang, Z.X. Cai, Y.R. Zhou, “Accelerating adaptive trade-off model using shrinking space technique for constrained evolutionary optimization”, International Journal for Numerical Methods in Engineering Vol.77, Issue.11, pp.1501-1534, 2009.
[37] H. Eskandar, A. Sadollah, A. Bahreininejad, M. Hamdi, “Water cycle algorithm- a noval metaheuristic optimaization method for solving constrained engineering optimization problems”, Computers and Structures, Vol.110, pp.151-166, 2012.
[38] W. Long, X. Liang, Y. Huang, Y. Chen, 2013. “A hybrid differential evolution augmented lagrangian method for constrained numerical and engineering optimization”, Computer-Aided Design, Vol.45, Issue.12, pp.1562-1574, 2013.
[39] E. Sandgren, “Nonlinear integer and discrete programming in mechanical design”, In the proceedings of the 1988 ASME design technology conference, USA, pp.95-105, 1988.
[40] C. Zhang, H.P. Wang, “Mixed-discrete nonlinear optimization with simulated annealing”, Engineering Optimization, Vol.17, Issue.3, pp.263-280, 1993.
[41] K. Deb, A.S. Gene, “A robust optimal design technique for mechanical component design”, In the proceeding of the D. Dasrupta and Z. Michalewicz (Eds.) Evolutionary algorithms in engineering applications, Berlin, pp. 497-514, 1997.
[42] A. Gandomi, A.H., Yang, X.S., A. Alavi, “Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems”, Engineering with Computers, Vol.29, Issue.1, pp.17-35, 2013.
[43] S.E. He, E. Prempain, Q.H. Wu, “An improved particle swarm optimizer for mechanical design optimization problems”, Engineering Optimization, Vol.36, Issue.5, pp.585-605, 2004.
[44] K.S. Lee, Z.W. Geem, “A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice”, Computer Methods in Applied Mechanics and Engineering, Vol.194, Issue.36-38, pp.3902-3933, 2005.
[45] E.M. Montes, C.A.C. Coello, J.V. Reyes, L.M. Davila, “Multiple trial vectors in differential evolution for engineering design”, Engineering Optimization, Vol.39, pp.567-589, 2007.
[46] E.M. Montes, C.A.C. Coello, “An empirical study about the usefulness of evolution strategies to solve constrained optimization problems”, International Journal of General Systems, Vol. 37, Issue.4, 443-473, 2008.
[47] A. Kaveh, S. Talatahari,. “Engineering optimization with hybrid particle swarm and ant colony optimization”, Asian journal of civil engineering (building and housing), Vol.10, pp.611-628, 2009.
[48] A.O. Youyun, C. Hongqin, “An adaptive differential evolution algorithm to solve constrained optimization problems in engineering design”, Engineering, Vol.2, Issue.C, pp.65-77, 2010.
[49] S.S. Rao, “Engineering optimization”, John Wiley and Sons, Greece, pp.56-82,1996.
[50] H.L. Li, P. Papalambros, “A production system for use of global optimization knowledge”, ASME Jounal of Mechanism, Transmission and Automation in Design, Vol. 107, Issue.2, pp.277-284, 1985.
[51] J.K. Kunag, S.S. Rao, L. Chen, “Taguchi-aided search method for design optimization of engineering systems”, Engineering Optimization, Vol. 30, Issue.1, pp.1-23, 1998.

Astuti. V., K. Hansraj, A. Srivastava, "A Quantum Inspired Evolutionary Computational Technique with Applications to Structural Engineering Design," International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.20-33, 2017.

Transmitting data securely counter to the mischievous attacks is always concern as a severe issue in an infrastructure less dynamic network called mobile-ad-hoc-network (MANET). Trust assertion between MANET (mobility) nodes is the major attribute for highly secure execution under dynamic topology deflection and open wireless environment. But the mischievous behavior of nodes weakens the trust level of MANET that drags to an untrusted data delivery. The expansion in maligning attacks due to dynamic nature of MANET causes the excessive energy consumption that result in reduction of network lifetime. Trust parameters are adequate to handle the secure route finding procedure. In this composition we also used Fuzzy logic as trusted tool for mitigating the Collaborative Blackhole attack in MANET. This composition recommends a trusted-fuzzy-ad-hoc routing protocol to upgrade the trust between the nodes in MANET. The recommended method customizes the conventional AODV routing protocol. Mischievous behavior nodes are predicted on the basis of mobility based constraints. The packet sequence number is compatible to the log reports of nearby resident nodes, confirms the reliability to the network establishes the trust that avoids the malicious node generation. The result analysis between the proposed technique with the pre-existent technique regarding the routing overhead, throughput, packet delivery ratio shows the effectiveness of trusted-fuzzy-ad-hoc routing protocol in the secure MANET environment.

MANET, Routing Protocol, AODV, Collaborative Black-hole Attack, Black-hole Attack

[1] S. Banerjee, R. Nandi, R. Dey, H.N. Saha, “A review on different Intrusion Detection Systems for MANET and its Vulnerabilities”, In the Proceedings of the 2015 IEEE International Conference and Workshop on Computing and Communication (IEMCON), Canada, pp.1-7, 2015.
[2] N.K. Pandey, A.K. Mishra, “An Augmentation in a Readymade Simulators Used for MANET Routing Protocols: Comparison and Analysis”, International Journal of Computer Sciences and Engineering, Vol.2, Issue.3, pp.60-63, 2014.
[3] SL. Mewadal, P. Sharma, SS. Gautam, S. Sharma, P. Agiwal, A. Shrivastava, “Simulation Based Performance Analysis of DSDV OLSR and DSR Routing Algorithm in Wireless Personal Area Network Using NS-2”, Research Journal of Computer and Information Technology Sciences, Vol.4, Issue.1, pp.1-7, Jan 2016
[4] N. Mannan, S. Khurana, “Comparative Analysis of Reactive Protocols in Mobile Ad-Hoc Networks”, International Journal of Computer Sciences and Engineering, Vol.2, Issue.4, pp.233-237, 2014.
[5] I.D. Chakeres, E.M. Belding-Royer, “AODV Routing Protocol Implementation Design”, In the Proceedings of the 2004 IEEE 24th International Conference on Distributed Computing Systems Workshops, Japan, pp. 698-703, 2004.
[6] F.H. Tseng, L.D. Chou, H.C. Chao, “A survey of black hole attacks in wireless Mobile ad-hoc networks”, Human-centric Computing and Information Sciences, Vol.1, Issue.1, pp.1-4, 2011.
[7] UK Singh, J Patidar, KC. Phuleriya, “On Mechanism to Prevent Cooperative Black Hole Attack in Mobile Ad Hoc Networks”, International Journal of Scientific Research in Computer Science and Engineering, Vol.3, Issue.1, pp.11-15, 2015.
[8] S.V.S.G. Devi, “Prediction Of A Class Variable In Classification Problem Using Fuzzy Inference Method”, International Journal of Computer Sciences and Engineering, Vol.2, Issue.1, pp.28-29, 2014.
[9] L.A. Zadeh, “The Role of Fuzzy Logic in the Management of Uncertainty in Expert Systems”, Fuzzy Sets and Systems, Vol.11, Issue.3, pp.199-227, 1983.
[10] J. Thakker, J. Desai, L. Ragha, “Avoidance of Co-operative black hole attack in AODV in MANET”, In the Proceedings of the 2016 IEEE International Conference on Wireless Communications Signal Processing and Networking (WiSPNET), Chennai, pp.1-7, 2016.
[11] Vaishnavi Katkar , Sagar Indore, Tushar Pokharkar, Kajal Inamdar, “Detecting Spam Zombies by Monitoring Outgoing Messages and DoS View”, International Journal of Scientific Research in Network Security and Communication, Vol.4, Issue.1, pp.5-11, 2016.
[12] S. Nath, S. Banik, A. Seal, S.K. Sarkar, “Optimizing MANET routing in AODV : An Hybridization approach of ACO and Firefly Algorithm”, In the Proceedings of the 2016 IEEE Second International conference on Research in Computational Intelligence and Communication Networks, Kolkata India, pp.23-28, 2016.
[13] P.S. Hiremath, T. Anuradha, P. Pattan, “Adaptive Fuzzy Inference System for Detection and Prevention of Cooperative Black Hole Attack in MANETs”, In the Proceedings of the 2016 IEEE International Conference on Information Science, Kochi India, pp.145-151, 2016.
[14] Balachandra, N.P. Shetty, “Interception of Black- Hole Attacks in Mobile AD-HOC Networks”, In the Proceedings of the 2016 IEEE International Conference on Inventive Computation Technologies, Coimbatore India, pp.105, 2016.
[15] PK. Sharma, SL. Mewada, P. Nigam, “Investigation Based Performance of Black and Gray Hole Attack in Mobile Ad-Hoc Network”, International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.4, pp.8-11, 2013.
[16] E.V. Balan, M.K. Priyan, C. Gokulnath, G.U. Devi, “Fuzzy Based Intrusion Detection Systems in MANET”, 2nd International Symposium on Big Data and Cloud Computing, India, pp.109-114, 2015.
[17] V. Thakur, L. Shrivastava, S.S. Bhadauria, “Performance Evaluation of AODV Using Fuzzy Logic to Reduce Congestion in MANET”, Asia-pacific Journal of Multimedia Services Convergent with Art Humanities and Sociology, Vol.5, Issue.5, pp.1-9, 2015.
[18] A. Chaudhary , A. Kumar , V.N. Tiwari, “A reliable solution against Packet dropping attack due to malicious nodes using fuzzy Logic in MANETs”, In the Proceedings of the 2014 IEEE International Conference on Reliability Optimization and Information Technology, Faridabad India, pp.178-181, 2014.
[19] S. Madhurikkha, C.M. Kumari, S. Revathi, P. Nathiya, “Preventing Packet Dropping Attack in Ad hoc Networks Using Malicious node Isolation Model”, International Journal of Computer Sciences and Engineering, Vol.3, Issue.3, pp.72-177, 2015.
[20] Sonal, K. Narang, “Black Hole Attack Detection using Fuzzy Logic”, International Journal of Science and Research (IJSR), Vol.2, Issue.8, pp.222-225, 2013.
[21] Bhagyashree Thakur, Sharda Patel, Ashok Verma, Shivendu Dubey, “Simulation Of Blackhole Nodes And Prevention Using IDS For MANET Reactive Routing Protocol AODV”, International Journal of Computer Sciences and Engineering, Vol.2, Issue.12, pp.114-120, 2014.

A. Sharma, P.K. Johari , "Eliminating Collaborative Black-hole Attack by Using Fuzzy Logic in Mobile Ad-hoc Network," International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.34-41, 2017.

Rapid advancement in RFID systems increase the need of sufficient computing power. Nowadays, more power is required to implement the encryption and decryption for the authentication during transactions. In addition, RFID tags have enough capacity to store the corresponding information. The radio waves are used in RFID technology to read the data from RFID tags. Information about the card and its owner is embedded in a tiny microchip in the e-card. The card can be read by remote machines, therefore this paper proposed double security check by introducing mobile user for the secure transaction. In addition, to provide more security to the credit card holder when his information is processed through RFID. Proposed RFID system is based on Secure Hash Algorithm and mobile communication devices such as cellular phones. It provides a secure certificate mechanism which uses a mobile phone, RFID reader and credit card containing RFID tag. Secure Hash Algorithm is used to obtain a secure and reliable way of transmitting data. The result shows that the proposed method improves the existing RFID security issues under the premise of safety, efficiency, and compatibility with the network.

RFID, RFID Reader, RFID Tag, Secure Hash Algorithm, Credit card, Mobile security

[1] L. Castro, S.F. Wamba, “An Inside Look at RFID technology”, Journal of Technology Management & Innovation, Vol.2, Issue 1, pp.1-14, 2007.
[2] A. Sharma, D. Thomas, “Looking Backwards to Look Ahead: Lessons from Barcode Adoption for RFID Adoption and Implementation”, Journal of Information Systems Applied Research (JISAR), Vol. 7, Issue 4, pp. 1-13, 2014.
[3] K. Ahsan, H. Shah, P. Kingston “RFID Applications: An Introductory and Exploratory Study”, IJCSI International Journal of Computer Science Issues, Vol. 7, Issue 1, pp. 1-7, 2010.
[4] W. Zhang, D. Li, “Research on barcode Image Binarization in Barcode Positioning”, IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 5, pp. 1-5, 2012.
[5] M. Kaur, M. Sandhu, N. Mohan, P.S. Sandhu, “RFID Technology Principles Advantages Limitations & Its Applications”, International Journal of Computer and Electrical Engineering, Vol. 3, No. 1, pp. 1-7, 2011.
[6] S. Jamal, A. Omer, A.S. Qureshi, “Cloud Computing Solution and Services for RFID Based Supply Chain Management”, Advances in Internet of Things, Vol. 3 No. 4, pp. 1-7, 2013.
[7] T.S. Heydt-Benjamin, D.V. Bailey, K. Fu, A. Juels, T.O. Hare. “Financial Cryptography and Data Security”, IFCA/Springer-Verlag Berlin Heidelberg, USA, pp.2-14 2007.
[8] J. Westhues “Hacking the prox card”, Springer, USA, pp.291-300. (2005)
[9] A. Juels, “RFID Security and Privacy: A Research Survey”, IEEE Journal on Selected Areas in Communications, Vol. 24, No. 2, pp. 1-14, 2006.
[10] B. Preneel, “Cryptographic HASH Functions: An Overview”, In the Proceedings of the 6th International Computer Security and Virus Conference (ICSVC), Belgium, pp.1-9, 1993.

M.A.A. Khan, A.A.S. Qureshi, M. Farooqui, "Double Security of RFID Credit Cards," International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.42-46, 2017.

Mutual trust in computer security is known as accepting on the same security architecture by two participating parties. Today, most of the users prefer to keep their data in the cloud with Cloud Storage Providers (CSP), some of the popular cloud storage providers are Drop Box, SkyDrive, and Google Drive and so on. Most of the cloud storage providers operate on secured http layer, therefore they provide underneath security for any data transmission. However, users often do not know in what ways the cloud service providers uses his data. Security of the critical data (for ex. Critical health record) is extremely difficult for the user to trust the service provider completely, and keep the record as it is. Beside this, once the storage link of the cloud is shared user has very little control on the link sharing. In the past several techniques have been proposed to provide security to the data in the cloud, however, not significant work has been carried out, towards offering a solution to address the problem of lack of mutual trust. In this work we develop a unique third party solution for providing mutual trust between the user and the cloud service provider. Our application takes a user key, encrypts every contents that need to be stored in a cloud space and then stores the data. While accessing the same data user needs to provide his key, then the encrypted data is downloaded from the cloud and is decrypted locally. We use symmetric key encryption as middle layer security for the mutual trust. We also analyze the performance of three very popular symmetric key encryption techniques such as AES, 3DES, RC2 and evaluate the performance of the same. The performance of the different algorithms varies according to data loads.

Cloud Storage Provider(CSP), Mutual Trust, Trusted Third Party, Access Control, AES, 3DES, RC2.

[1] Mithilesh Mittal, Pradeep Sharma and Pankaj Kumar Gehlot, “A Comparative Study of Security Issues& Challenges of Cloud Computing”, International Journal of Scientific Research in Computer Science and Engineering, Vol.1, Issue.5, pp.9-15, 2013.
[2] Ayad Barsoum, Anwar Hassan “Enabling Dynamic data and Indirect Mutual Trust for Cloud Computing Storage System”, IEEE Transactions on Parallel and Distributed Systems,Vol.24, Issue.(12, pp.2375-2385, 2013.
[3] Cong Wang, Kui Ren, “Towards Publicly Auditable Secure Cloud Data Storage Services”, IEEE Network, Vol.24, Issue.4, pp.19-84, 2010.
[4] S.D.C. Vimercati, S. Foresti, S. Jajodia, S. Paraboschi, P. Samarati, “Over-encryption: Management of access control evolution on outsourced data”, in Proceedings of the 33rd International Conference on Very Large Data Bases, Austria, pp.123-134, 2007.
[5] Schneier Bruce,”Applied cryptography: Protocols Algorithms and Source code in C (2nd edition)”, John Wiley & Sons, United States, pp.1-784,1996.
[6] AJ. Menezes, VOorschot, PCV. Anstone, A. Scott , “Handbook of Applied Cryptography” , Jaypee publisher, India, pp.34-58, 1996.
[7] A. Sharma, RS Thakur, S. Jaloree, “Investigation of Efficient Cryptic Algorithm for image files Encryption in Cloud”, International Journal of Scientific Research in Computer Science and Engineering, Vol.4, Issue.5, pp.5-11, 2016.
[8] Dong, Russello,Dulay, “Shared and Searchable Encrypted data for Untrusted Servers”, International Journal of Computer Security, Vol.19, Issue.3, pp.367-397, 2011.
[9] SL. Mewada, P. Sharma, SS. Gautam, “Classification of Efficient Symmetric Key Cryptography Algorithms”, International Journal of Computer Science and Information Security (IJCSIS), Vol. 14, No. 2, pp.105-11, 2016
[10] Md.A. Mushtaque, “Comparative Analysis on Different parameters of Encryption Algorithms for Information Security”, International Journal of Computer Sciences and Engineering, Vol.2, Issue.4, pp.76-82, 2014.

Shreeraghav kulkarni, Sujata Terdal, "Ttpse- Trusted Third Party With Symmetric Encryption Towards Secured Cloud Storage," International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.47-51, 2017.

In!this research paper, we desire to blessing a fresh out of the impression new public key Broadcast encryption (BE) for accomplishing versatile security against supreme number of colluders. In particular, our subject is built from composite request multi direct maps and appreciates static message overhead of a proceeding with scope of bunch parts that square measure O(1) bits. In addition, the individual key size and open key size square measure all poly-logarithmic inside the total extent of customers. Thus, we tend to sum up the strategy of Lewko and Waters for acknowledging twin framework mystery keeping in touch with the Composite request multi direct groups, and after that demonstrate the versatile security of our subject underneath static suppositions inside the standard model. Contrasted and the best in class, our subject accomplishes the versatile security in clear and non-intelligent confirmable suppositions with the improved parameter estimate for BE (Broadcast Encryption) .

Broadcast encryption, Adaptive security, Static sized cipher texts

[1] A. Fiat and M. Naor, “Broadcast encryption”, Advances in Cryptology—CRYPTO, Vol.3, Issue.8, pp. 480-491, 1994.
[2] D. Boneh, C. Gentry, and B. Waters, “Collusion resistant broadcast encryption with short ciphertexts and private keys”, in Advances in Cryptology—CRYPTO, Vol. 2, Issue.10, pp. 258-275, 2005.
[3] T. Laarhoven, J. Doumen, P. Roelse, B. Škoric, B. Weger, “Dynamic Tardos traitor tracing schemes”, IEEE Trans. Inf. Theory, Vol. 59, Issue. 7, pp. 4230-4242, 2013.
[4] B. Chor, A. Fiat, M. Naor, B. Pinkas, “Tracing traitors”, IEEE Trans. Inf. Theory, Vol. 46, Issue. 3, pp. 893-910, 2000.
[5] D. Boneh, A. Silverberg, “Applications of multilinear forms tocryptography”, Contemp. Math., Vol. 324, Issue. 1, pp. 71-90, 2003.
[6] S. Park, K. Lee, D. H. Lee, “New constructions of revocable identity based encryption from multi linear maps”, IEEE Trans. Inf. Forensics Security, Vol. 10, Issue. 8, pp. 1564-1577, 2015.
[7] X. Du, Y. Wang, J. Ge, Y. Wang, “An ID-based broadcast encryption scheme for key distribution”, IEEE Trans. Broadcast., Vol. 51, Issue.2, pp. 264-266, 2005.
[8] J. Kim, W. Susilo, M. H. Au, J. Seberry, “Adaptively secure identitybased broadcast encryption with a constant-sized ciphertext”, IEEE Trans. Inf. Forensics Security, Vol. 10, Issue. 3, pp. 679-693, 2015.
[9] C. Gentry, A. Lewko, B. Waters, “Witness encryption from instance independent assumptions”, in Advances in Cryptology—CRYPTO, Vol.8, Issue.9, pp. 426-443, 2014.
[10] M. Naor and O. Reingold, “Number-theoretic constructions of efficientpseudo-random functions”, Journal of ACM, Vol.51, Issue.2, pp. 231-262, 2004.

P. Patidar, Iyapparaja M., "Favorable Secure Broadcast Encryption with Static Cipher texts," International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.52-57, 2017.

Game design using automata tools and game theory analysis has been works from decades but there are a very few works on dynamic input or dynamic state generation. This paper summarizes game design of a traditional Snake and Ladder board game in a modernized way using the study of automata theory and game theory too, for both android and computer platforms with generation of random inputs which are also explained using flowcharts, DFSA and NDFSA.

Automata Theory; Game Theory; Dynamic Game; Android

[1] J. C. Harsanyi, R. Selten, J. W. Weibull, E. V. Damme, J. F. Nash, P. Hammerstein, H. W. Kuhn, “The Work of John Nash in Game Theory”, in journal of economic theory Economic Sciences, Vol.12, Issue.1, pp.161-190, 1994.
[2] M. K. Brunnermeier, J. Morgan, “Clock Games: Theory and Experiments”, Games and Economic Behavior., Vol.68, Issue.2, pp.532-550, 2010.
[3] NS Qureshi, H Mushtaq, MS Aslam, M Ahsan, “Computing Game Design with Automata Theory”, International Journal of Multidisciplinary Sciences and Engineering, Vol.3, issue.5, pp.13021, 2012.
[4] Abid Jamil, "An Infinite Runner Game Design using Automata Theory", International Journal of Computer Science and Software Engineering, Vol.5, Issue.7, pp.119-125, 2016.
[5] NS Qureshi, Z Abbas, M Sohaib, M Arshad, “A Roller Coaster Game Design using Automata Theory”, International Journal Of Multidisciplinary Sciences And Engineering, Vol.3, Issue.5, pp.40-45, 2012.
[6] A. Jamil, E. A. Ullah, M. Rehman, “An Infinite Runner Design using Automata Theory”, IJCSSE, Vol..5, Issue.7, pp.119-125, 2016.

N. Raj, R. Dubey, "Snakes and Stairs Game Design using Automata Theory," International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.58-62, 2017.

Communication has become stronger due to exponential increase in the usage of social media in the last few years. People use them for communicating with friends, finding new friends, updating any important activities of their life, etc. Among different types of social media, most important are social networking sites and mobile networks. Due to their growing popularity and deep reach, these mediums are infiltrated with huge Vol.of spam messages. In this paper, we have discussed 5 traditional machine learning techniques for detecting spam in the short text messages on two datasets: SMS Spam Collection dataset taken from UCI Repository and Twitter dataset. Twitter dataset is compiled by crawling the public live tweets using Twitter API. The BoW with TF and TF-IDF weighing schemes is used for feature selection. The performance of various classifiers is evaluated with the help of metrics like precision, recall, accuracy and F1 score. The results show that the Random Forest gave highest accuracy with 100 estimators.

Spam Detection, machine learning, Traditional classifiers, Twitter spam, SMS spam, Text Classification

[1] L. F. Cranor, & B. A. LaMacchia, “Spam!”, Communications of the ACM, Vol 41, Issue 8, pp.74-83. 1998.
[2] G. Jain, & M. Sharma, “Social Media: A Review”, In Information Systems Design and Intelligent Applications, Springer India, pp. 387-395. 2016
[3] M. Nelson, “Spam Control: Problems and Opportunities”, Ferris Research, India, pp.23-82, 2003.
[4] G.V. Cormack, J.M.G. Hidalgo, E.P. Sánz, “Feature engineering for mobile (SMS) spam filtering”, In Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, US, pp. 871-872, 2007.
[5] C. K. Grier, Thomas, V. Paxson, M. Zhang, “@ spam: the underground on 140 characters or less”, In Proceedings of the 17th ACM conference on Computer and communications security, Chicago, pp.27-37, 2010.
[6] H. Stern, “A Survey of Modern Spam Tools”, In Proceedings of the 5th Conference on Email and Anti-spam, CA, pp.1-10, 2008.
[7] A. Cournane, R. Hunt, “An analysis of the tools used for the generation and prevention of spam”, Computers & Security, Vol.23, Issue.2, pp.154-166, 2004.
[8] T. Kurt, C. Grier, J. Ma, V. Paxson, D. Song, “Design and evaluation of a real-time url spam filtering service”, In 2011 IEEE Symposium on Security and Privacy, USA, pp.447-462, 2011.
[9] J. Kim, K. Chung, K. Choi, “Spam filtering with dynamically updated URL statistics”, IEEE Security & Privacy, Vol.4, Issue.5, pp.33-39, 2007.
[10] J.R. Levine, “Experiences with Greylisting”, In Proceedings of 2nd Conference Email and Anti-Spam (CEAS 05), NY, pp1-2, 2005
[11] B. Agarwal, N. Mittal, “Prominent feature extraction for review analysis: an empirical study”, Journal of Experimental & Theoretical Artificial Intelligence, Vol.28, Issue.3, pp.485-498, 2016.
[12] B. Agarwal, N. Mittal, “Sentiment analysis using conceptnet ontology and context information”, In Prominent Feature Extraction for Sentiment Analysis (Springer), US, pp.63-75, 2016.
[13] L. Zhang, J. Zhu, T. Yao, “An evaluation of statistical spam filtering techniques”, ACM Transactions on Asian Language Information Processing (TALIP), Vol.3, Issue.4, pp.243-269, 2004.
[14] I. Rish, “An empirical study of the naive Bayes classifier”, In IJCAI 2001 workshop on empirical methods in artificial intelligence, Vol.3, Issue.22, pp.41-46, 2001.
[15] F. Sebastiani, “Machine learning in automated text categorization”, ACM computing surveys (CSUR), Vol.34, Issue.1, pp.1-47, 2002
[16] Z. Yang, X. Nie, W. Xu, J. Guo, “An approach to spam detection by naive Bayes ensemble based on decision induction”, In Sixth International Conference on Intelligent Systems Design and Applications, China, pp.861-866, 2006
[17] C. Kim, K. B. Hwang, “Naive Bayes classifier learning with feature selection for spam detection in social bookmarking”, In Proceedings of European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/ PKDD), US, pp.32, 2008.
[18] I. Androutsopoulos, J. Koutsias, K. V. Chandrinos, C. D. Spyropoulos, “An experimental comparison of naive Bayesian and keyword-based anti-spam filtering with personal e-mail messages”, In Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval, Greece, pp.160-167, 2000.
[19] T. A. Almeida, A. Yamakami, J. Almeida, “Evaluation of approaches for dimensionality reduction applied with naive bayes anti-spam filters”, International Conference on Machine Learning and Applications, Miami, pp.517-522, 2009.
[20] C. Cortes, & V. Vapnik. “Support-vector networks”, Machine learning, Vol.20, Issue.3, pp.273-297, 1995
[21] M. Mccord, M. Chuah, “Spam detection on twitter using traditional classifiers”, In International Conference on Autonomic and Trusted Computing, Heidelberg, pp.175-186, 2011.
[22] P. Kolari, T. Finin,, A. Joshi, March, “SVMs for the Blogosphere: Blog Identification and Splog Detection”, In AAAI Spring Symposium: Computational Approaches to Analyzing Weblogs, Baltimore, pp.92-99, 2006.
[23] H.B. Wang, Y. Yu, Z. Liu, “SVM classifier incorporating feature selection using GA for spam detection”, In International Conference on Embedded and Ubiquitous Computing, Japan, pp.1147-1154, 2005
[24] C. Y. Tseng, M. S. Chen, “Incremental SVM model for spam detection on dynamic email social networks”, In Int. Conf. on Computational Science and Engineering, Vancouver, pp.128-135, 2009.
[25] M. Healy, S. J. Delany, A. Zamolotskikh, “An assessment of case base reasoning for short text message classification”, In N. Creaney (Ed.), Proceedings of 16th Irish Conference on Artificial Intelligence and Cognitive Science, Castlebar, pp.257-266, 2005.
[26] A. Harisinghaney, A. Dixit, S. Gupta, A. Arora, “Text and image based spam email classification using KNN Naïve Bayes and Reverse DBSCAN algorithm”, In Optimization Reliabilty and Information Technology (ICROIT), India, pp.153-155, 2014
[27] T.P. Ho, H.S. Kang, S.R. Kim, “Graph-based KNN Algorithm for Spam SMS Detection”, Journal of Universal Computer Science, Vol.19, Issue.16, pp.2404-2419, 2013.
[28] F. Barigou, B. Beldjilali, B. Atmani, “Using cellular automata for improving knn based spam filtering”, Internationa Arab Journal Information Technology, Vol.11, Issue.4, pp.345-353, 2014.
[29] A.T. Sabri, A. H. Mohammads, B. Al-Shargabi, M. A. Hamdeh, “Developing new continuous learning approach for spam detection using artificial neural network (CLA_ANN)”, European Journal of Scientific Research, Vol.42, Issue.3, pp.525-535, 2011.
[30] MR. Nagpure, SS. Mesakar, SR. Raut and Vanita P.Lonkar, "Image Retrieval System with Interactive Genetic Algorithm Using Distance", International Journal of Computer Sciences and Engineering, Vol.2, Issue.12, pp.109-113, 2014.
[31] D. DeBarr, & H. Wechsler, “Spam detection using clustering, random forests, and active learning”, In Sixth Conference on Email and Anti-Spam. Mountain View, California, pp.1-6, 2009.
[32] A. Karami, L. Zhou, “Improving static SMS spam detection by using new content-based features”, In 20th Americas Conference on Information systems (AMCIS), Savannah, pp.1-9, 2014.
[33] A. Garg, N. Batra, I. Taneja, A. Bhatnagar, A. Yadav, S. Kumar, "Cluster Formation based Comparison of Genetic Algorithm and Particle swarm Optimization Algorithm in Wireless Sensor Network", International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.2, pp.14-20, 2017.
[34] Y. Zhang, S. Wang, P. Phillips G. Ji, “Binary PSO with mutation operator for feature selection using decision tree applied to spam detection”, Knowledge-Based Systems, Vol.64, Issue.3, pp.22-31, 2014.
[35] DJ. Hand, K. Yu, “Idiot’s Bayes—not so stupid after all?”, International statistical review, Vol.69, Issue.3, pp.385-398, 2001
[36] LBreiman, “Random forests”, Machine learning, Vol.45, Issue.1, pp.5-32, 2001.
[37] M. Lichman, “UCI Machine Learning Repository”, School of Information and Computer Science University of California, California, pp.1-143, 2013.

G. Jain, Manisha, B. Agarwal, "Spam Detection on Social Media Text," International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.63-70, 2017.

OnlineSocial Networking (OSN) incurs many problems such as – privacy of each time shared in OSN may not be secured e.g. twitter, Facebook and Unauthorized data can be shared easily to their timeline. The existing algorithm is Interaction Algorithm which is totally based on “what the framework does. ’It is implemented as so Roles which are played objects at run time entity. But this problem is resolved by using – the Conflict Detection Algorithm in the proposed system. In this algorithm the individual assurance slants of every mastermind clients with a particular deciding objective recognizes the conflicts among them. The nonappearance of online networking event protection association bolsters in current standard Social Media bases, which makes clients not prepared to fittingly control to whom these things are really shared?. Current framework or system are either nonsensically requesting or basically considers only settled techniques for social affair security inclines. I propose the basic computational system to choose clashes for multi-party security association in Online networking that can adjust to various conditions by showing the concessions that clients make to achieve a reaction for the debate. The result for Privacy of each item shared in online networking will be more secured.

online networking, unauthorized photos, items, Interaction Algorithm, Conflict Detection Algorithm

[1]. K. Thomas, G. Chris, MN Davi, “Antagonistic: Multi-Party Protection Chances in Interpersonal organizations”, In International Symposium on Privacy Enhancing Technologies Symposium, Heidelberg, pp.236-252, 2010.
[2]. A. Laminar, L. Vilma, A. Lehmuskallio, S. Tamminen, “We’re in It Together: Relational Administration of Divulgence in Informal community Administrations”, In Proceedings of the SIGCHI conference on human factors in computing systems, USA, pp. 3217-3226, 2011.
[3]. SM Jose, "Security and Self –divulgences in Multivalent Systems", In the 10th International Conference on Autonomous Agents and Multivalent Systems, NY, pp.1333-1334. 2011.
[4]. Yu Lei, Huan Liu, "Productive Component Determination by means of Examination of Importance and Excess”, Journal of machine learning research, Vol.5, Issue.10, pp.1205-1224, 2004.
[5]. SM Jose, Natalia Criado, "Verstile Clash Determination Component for Multi-Party Security Administration in Online Networking", In Proceedings of the 13th Workshop on Privacy in the Electronic Society, USA, pp. 69-72, 2014.
[6]. Fang, Lujun, Kristen Lefebvre, "Protection Wizards for person to person Communication Locales", In Proceedings of the 19th international conference on World Wide Web, USA, pp.351-360, 2010.
[7]. Hu, Hongxin, Gail-Joon Ahn, Ziming Zhao, Dejun Yang, "Amusement Theoretic Examination of Multiparty Get to Control in Online Informal Communities", In Proceedings of the 19th ACM symposium on Access control models and technologies, NY, pp. 93-102, 2014.
[8]. Mazzia Alessandra, Kristen LeFevre, Eytan Adar, "The Pviz Understanding Instrument for Informal Community Protection Settings", In Proceedings of the Eighth Symposium on Usable Privacy and Security, US, pp.1-13, 2012.

R. Tandon, Prabadevi B., "Resolving Multi-party Privacy Clashes in Online P TO P Social Networking," International Journal of Computer Sciences and Engineering, Vol.5, Issue.5, pp.71-76, 2017.