iosr-JCE   Recent Trends in Computer Technology & Communication 2k16" (RTCTC-2k16)

Abstract: Inside world involving Web, the idea of class data revealing is getting high reputation. The actual solitude as well as safety measures involving class data revealing include the key troubles which usually are to be regarded with all the this specific principle. Because of the semi-trust mother nature with the alternative party, this are not dependable and hence, safety measures versions used usually are not immediately employed towards the composition involving foreign structured class revealing. On this paper, put in place composition for any risk-free class revealing pertaining to public foreign, which could acquire the advantages of Cloud Server's assist very effectively.

[1] RFC2315, "PKCS #7: Cryptographic message syntax(version 1.5)," http://www.ietf.org/rfc/rfc2315.txt, Mar 1998.
[2] Y. Tang, P. Lee, J. Lui, and R. Perlman, "Secure overlay cloud stor- age with access control and assured deletion," IEEE Transactions
on Dependable and Secure Computing, vol. 9, no. 6, pp. 903–916, 2012.
[3] K. Ren, C. Wang, and Q. Wang, "Security challenges for the public cloud," Ieee Internet Computing, vol. 16, no.1, pp. 69–73, 2012.
[4] S. Yu, C. Wang, K. Ren, and W. Lou, "Achieving secure, scalable, and fine-grained data access control in cloud computing," in IEEE
INFOCOM 2010: Proc. The 29th Conference on Computer Communications. IEEE, 2010.
[5] D.H.Tran,H.L.Nguyen,W.Zha,andW.K.Ng,"Towardssec uri- ty in sharing data on cloud-based social networks,"in ICICS 2011: Proc.
8th International Conference on Information, Communications and Signal Processing. IEEE CS, 2011.

Abstract: Due to the advance of new technology data sharing has never been easier in this world. An accurate analysis on the shared data provides a group of benefits to both the society and individuals. Data sharing between two members or group of members must take into account several issues. They are efficiency, data integrity and privacy of data owner. To overcome this issue Ring signature concept is introduced. It is a promising approach to construct a secret and authentic data sharing system which allows a owner of the data to anonymously authenticate his/her data which can be put into the cloud for storage or analysis purpose. This could be creating costly certificate verification in the traditional public key infrastructure (PKI) so this type of verification additionally create a bottleneck and scalable problem. To overcome this problem Identity-based (ID-based) ring signature could be used.

[1] J. K. Liu and D. S. Wong, "Solutions to key exposure problem in ring signature," I. J. Netw. Secur., vol. 6, no. 2, pp. 170–180, 2008.
[2] J. K. Liu, T. H. Yuen, and J. Zhou, "Forward secure ring signature without random oracles," in Proc. 13th Int. Conf. Inform.
Commun. Security, 2011, vol. 7043, pp. 1–14.
[3] H. Xiong, Z. Qin, and F. Li. An anonymous sealed-bid electronic auction based on ring signature. I. J. Network Security, 8(3):235
242, 2009.
[4] J. Yu, F. Kong, H. Zhao, X. Cheng, R. Hao, and X.-F. Guo. Noninterative forward-secure threshold signature without random
oracles. J. Inf. Sci. Eng., 28(3):571586, 2012.
[5] C. Wang, S. S. M. Chow, Q. Wang, K. Ren, and W. Lou. Privacy preserving public auditing for secure cloud storage. IEEE Trans.
Computers, 62(2):362375,2013.
[6] C. A. Melchor, P.-L. Cayrel, P. Gaborit, and F. Laguillaumie, "A new efficient threshold ring signature scheme based on coding
theory," IEEE Trans. Inform. Theory, vol. 57, no. 7, pp. 4833–4842, Jul. 2011.

Abstract: PWS stands for Personalized Web Search which is highly and immensely effective way for enhanced improvement quality of searching services on online. Now a day's huge amount of information or data is being uploaded on the internet, with increase of this, users expect accurate result and PWS is able to fulfil the expectation of users. Based on the data of user PWS works accordingly. The base paper is modeled according to hierarchy of user's profile and at the same time privacy is also maintained. For generalization, we have used greedyDP i.e. Greedy Discriminating Power and GreedyIL i.e. Greedy Information Loss and using this it predicts about Personalization of queries.
Keywords - Privacy protection, personalized web search, profile, GreedyIL, GreedyDP

[1] Z. Dou, R. Song, and J.-R. Wen, "A Large-Scale Evaluation and Analysis of Personalized Search Strategies," Proc. Int'l Conf.
World Wide Web (WWW), pp. 581-590, 2007.
[2] J. Teevan, S.T. Dumais, and E. Horvitz, "Personalizing Search via Automated Analysis of Interests and Activities," Proc. 28th Ann.
Int'l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR), pp. 449-456, 2005.
[3] M. Spertta and S. Gach, "Personalizing Search Based on User Search Histories," Proc. IEEE/WIC/ACM Int'l Conf. Web
Intelligence (WI), 2005.
[4] B. Tan, X. Shen, and C. Zhai, "Mining Long-Term Search History to Improve Search Accuracy," Proc. ACM SIGKDD Int'l Conf.
Knowledge Discovery and Data Mining (KDD), 2006.
[5] K. Sugiyama, K. Hatano, and M. Yoshikawa, "Adaptive Web Search Based on User Profile Constructed without any Effort from
Users," Proc. 13th Int'l Conf. World Wide Web (WWW), 2004.

Abstract:Access Control Mechanism provide security to information from unauthorized users. Even authorized person may illegally use the data to dispose the privacy of individuals to whom the data belongs to. Privacy Protection Mechanism [PPM] anonymize the relation to prevent identity and attributes disclosure. Privacy Protection Mechanism needs to satisfy the constrained like imprecision bound along with privacy requirements. For satisfy privacy requirements it needs suppression and generalization techniques of
anonymization algorithm.

[1] "Accuracy-Constrained Privacy-Preserving Access Control Mechanism for Relational Data" Zahid Pervaiz, Walid G. Aref, Senior
Member, IEEE, Arif Ghafoor, Fellow, IEEE, and Nagabhushana Prabh.
[2] K. Browder and M. Davidson, "The Virtual Private Database in oracle9ir2," Oracle Technical White Paper, vol. 500, 2002.
[3] S. Chaudhuri, T. Dutta, and S. Sudarshan, "Fine Grained Authorization through Predicated Grants," Proc. IEEE 23rd Int'l Conf.
Data Eng., pp. 1174-1183, 2007.
[4] K. LeFevre, D. DeWitt, and R. Ramakrishnan, "Mondrian Multidimensional K-Anonymity," Proc. 22nd Int'l Conf. Data Eng., pp.
25- 25, 2006.
[5] T. Iwuchukwu and J. Naughton, "K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization," Proc.
33rd Int'l Conf. Very Large Data Bases, pp. 746-757, 2007.
[6] P. Samarati, "Protecting Respondents' Identities in Microdata Release," IEEE Trans. Knowledge and Data Eng., vol. 13, no. 6, pp.
1010-1027, Nov. 2001.
[7] A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubrama- niam, "L-Diversity: Privacy Beyond k-anonymity," ACM Trans.
Knowledge Discovery from Data, vol. 1, no. 1, article 3, 2007.
[8] E. Bertino and R. Sandhu, "Database Security-Concepts, Approaches, and Challenges," IEEE Trans. Dependable and Secure
Computing, vol. 2, no. 1, pp. 2-19, Jan.-Mar. 2005.
[9] "Approximation Algorithms for k-Anonymity" Gagan Aggarwal,Tomas Feder,Rajeev Motwani,Rina Panigraphy.

Abstract: This paper will focus on database management system with application scenarios in real time telemedicine database management systems to maximize care admissions and minimize care difficulties issue such as distance, travel, and time complexity. This paper implements three-fold approach on the basis of database fragmentation, database websites clustering and intelligent data distribution (allocation). This approach reduces the amount of data transmission between many websites during applications execution to achieve cost efficient Communication between websites during applications processing and improves applications response time, reliability, flexibility and throughput.

[1] Clustering Large: Scale,Distributed Software Component Repositories(2012) presented by M.P.Paixao,L.Silva.
[2] Dynamics Fragmentation And Replica Management in Distributed Database System(2012) presentedby J.Hauglid,N.Ryeng
[3] A New Technique For Database Fragmentation In Distributed System(2011) presented by H.Khan
[4] Modeling Of Mixed Fragmentation In Distributed Database Using UML2.0 Presented By T.Kumar And M.Mrunalini.

Abstract: Abstract-Data sharing in a cloud storage is an important functionality. So in cloud storage how securely, efficiently, and flexibly we share our data with others is becomes challenging now a days. In this paper we proposed a new cryptosystem for efficient delegation of decryption rights in any set of cipher text possible which produces constant size cipher text .the system produces one such a key which is a aggregate key of all set of secret keys and encompassing the power of all this keys being aggregate. The secrete key holder release that one aggregated key for some choices of encrypted files which he oly want to share with others and remaining files are hidden from all and remains confidential throughout the sharing of all set of files among cloud storage. The release of this aggregate key for that one task make available to others by sending conventionally or stored smart card.

[1] Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage Cheng-Kang Chu, Sherman S.
M. Chow, Wen-Guey Tzeng, Jianying Zhou, and Robert H. Deng, Senior Member, IEEE
[2] C. Wang, S.S.M. Chow, Q. Wang, K. Ren, and W. Lou, Privacy-Preserving Public Auditing for Secure
Cloud Storage, IEEE Trans. Computers, vol. 62, no. 2, pp. 362-375, Feb. 2013.
[3] B. Wang, S.S.M. Chow, M. Li, and H. Li, Storing Shared Data on The Cloud via Security- Mediator,
Proc. IEEE 33rd Intl Conf.Distributed Computing Systems (ICDCS), 2013.
[4] S.S.M. Chow, C.-K. Chu, X. Huang, J. Zhou, and R.H. Deng, Dynamic Secure Cloud Storage with
Provenance, Cryptography and Security, pp. 442-464, Springer, 2012.
[5] D. Boneh, C. Gentry, B. Lynn, and H. Shacham, Aggregate and Verifiably Encrypted Signatures from
Bilinear Maps, Proc. 22nd Intl Conf. Theory and Applications of Cryptographic Techniques
(EUROCRYPT 03), pp. 416-432, 2003.

Abstract:Network Security has become very important in today's world, as a result of which various methods are adopted to bypass it. Network administrators need to keep up with the recent advancements in both the hardware and software fields to prevent their as well as the user's data. Authentication is one of the primary and most commonly ways of ascertaining and ensuring security in the network. This paper outlines the various attack methods which are used, various defense mechanism against attack and various authentication
techniques.
Key Words: Attacks, Firewalls, Authentication, Router.

[1] A R. F. Hamedani, "Network Security Issues, Tools for Testing," School of Information Science, Halmstad University, 2010.
[2] B. Daya ,"Network Security: History, Importance, and Future ,"University of Florida Department of Electrical and Computer
Engineering , 2013. http://web.mit.edu/~bdaya/www/Network%20Security.pdf
[3] Hafiz Zahid Ullah Khan, "Comparative Study of Authentication Techniques", IJVIPNS-IJENS Vol: 10 No: 04.
[4] J. E. Canavan, Fundamentals of Network Security, Artech House Telecommunications Library, 2000.
[5] Lawrence O‟Gorman, "Comparing Passwords, Tokens, and Biometrics for User Authentication", Vol. 91, No. 12, Dec. 2003, pp.
2019-2040 ã 2003 IEEE.
[6] M. M. B. W. Pikoulas J, "Software Agents and Computer Network Security," Napier University, Scotland, UK.

Abstract: Now a days video surveillance system have an increasing demand in various fields such as defence and industries for security. Detection of moving target in initial stage and then performing various functions like detecting, classifying, and tracking targets embedded in a background scene. However, many problems are associated with real time detection and tracking of target such as illumination changes, ghost image, noise, etc. To overcome such problems of automatic target detection (ATR) a dwt based approach is proposed in this paper for real time detection and tracking of an object. An attempt has been made to develop effective real time object
tracking system.
Keywords; ATR, feature extraction, DWT, object tracking.

1] S. Arivazhagan, L. Ganesan, " Automatic Target Detection Using Wavelet Transform," EURASIP Journal on Apllied Signal
Processing 2004:17, 2663-2674.
[2] Wesam A. Sakla, Adel A. Sakla, M.S. Alam, " Wavelet- based Hyperspectral Target Detection using Spectral Fringe-adjusted Joint
Transform Correlation," Proceedings of SPIE vol. 7335 , 73350B 2009.
[3] Patil Gaurav Jaywantrao, Shabahat Hasan, " Application of Image Fusion Using Wavelet Transform in Target Tracking," International
Journal of Engineering Research & technology, ISSN: 2278-0181, Vol. 1, Issue 8, October 2012.
[4] Sunil Tiwari N, Ravikumar A.V, " Multiple Moving Object Detection and Tracking using Harr Features with Smart Video
Surveillance System," International Journal of Engineering Research & Technology (IJERT), ISSN: 2278-0181, Vol. 3, Issue 6, June-
2014.
[5] Sukanyathara J, Alphonsa Kuriakose, " Robust Detection and tracking of Multiple Objects under Complex Backgrounds and
Occulsion," International Journal of Engineering Research & Technology, Vol.3, Issue 8, August 2014
[6] B. Ugur. Toreyin, A. Enis Cetin, Anil Aksay, M. Bilgay Akhan, "Moving Object Detection in Wavelet Compressed Video," Signal
Processing: Image Communication 20 (2005) 255-264.

Abstract: This paper presents the deposition and characterization of the Indium selenide (In2Se3) films onto the non-conducting glass and conducting indium tin oxide coated glass substrates in alkaline bath using chemical solution technique, respectively. The films were deposited by using Indium sulfate and selenium powder as precursors of In3+ and Se2- species at room temperature for deposition time of 46 h, respectively. The structural, surface morphological and optical properties of the deposited films were studied to decide the suitability of the deposited materials for various applications including photovoltaic.

[1]. H. M. Pathan, S. S. Kulkarni, R. S. Mane and C. D. Lokhande (2005), Mater. Chem. Phys., 93: 16.
[2]. Guang Han, Zhi-Gang Chen, Chenghua Sun, Lei Yang, Lina Cheng, Zhifeng Li, Wei Lu, Zachary M. Gibbs, G. Jeffery Snyder,
Kevin Jack, John Drennanc and Jin Zou (2014), CrystEngComm , 16: 393
[3]. J. Ye, S. Soeda, Y. Nakamura, O. Nittono, Jpn. (1998) J. Appl. Phys. 37:4264
[4]. S. Yang, H. Wang, W. Fu and D. Kelley (2007), J. Photochem. Photobiol., A, 192: 159.
[5]. I. H. Mutlu, M. Z. Zarbaliyev and F. Aslan (2007), J. Sol-Gel Sci.Technol. 43:223.
[6]. H. Bouzouita, N. Bouguila, S. Duchemin, S. Fiechter and A. Dhouib (2002), Renew Energy, 25:131.
[7]. A. Chaiken, K. Nauka, G. A. Gibson, H. Lee, C. C. Yang, J. Wu,J. W. Ager, K. M. Yu and W. Walukiewicz (2003), Appl. PhysLett.
94:2390.

Abstract: Our government has goal to develop 100 smart cities. Which will work on smart technologies like smart grid, smart phone, different tracking devices which will generate large amount of data. Traditionally theses data is handling by data centers. Resource Management is one of the most critical problems of data centers. One effective way to tackle this problem is using the optimal way to handle this data and when we talk about the Smart Cities which will generate large amount of data it's become too critical to handle this
enormous amount of data.

[1] http://en.wikipedia.org/wiki/Smart_grid
[2] http://erb.umich.edu/Research/InstituteReports/11-12/Hicks-Smart-Grid.pdf,Christian Hicks
[3] Tarry Singh, Pavan Kumar Vara, "Smart Metering the Clouds", 2009 18th IEEE International Workshops Technologies:
Infrastructures for Collaborative Enterprises.
[4] "The smart grid vision for India‟s Power Sector." International Smart Grid Conference Proceedings.
[5] Y. Pradeep, S. A. Khaparde and Reji Kumar "Intelligent GridInitiatives in India"
[6] Bhushan A.Ugale, Piyush Soni, Tsering Pema, Anirudha Patil, "Role of Cloud Computing for Smart Grid Of India and its Cyber
Security"
[7] Dave Haak, Sharon Allan, Maikel van Verseveld, Ann Burns,"Achieving high performance in smart grid data management: The utility
industry context".

Abstract:Data mining is the most fast growing area today which is used to extract important knowledge from large data collections but often these collections are divided among several parties. Privacy liability may prevent the parties from directly sharing the data and some types of information about the data. In this project they propose a protocol for secure mining of association rules in horizontally distributed databases. The current integral protocol is that of Kantarcioglu and Clifton well known as KC protocol. This protocol is based on anunsecured distributed version of the Apriori algorithm named as Fast Distributed Mining (FDM) algorithm of Cheung et al.

[1] C.N. Modi, U.P. Rao and D.R. Patel [1]To Reduce Data Leakage in Horizontally Distributed Database Using
Association Rules 2004.
[2] b) V K S K Sai Vadapalli and G Loshma Privacy Preserving Association Rule Mining in Retail Industries[2] 2009.
[3] c) Ahmed HajYasienPRESERVING PRIVACY IN ASSOCIATION RULE MINING
[4] d) R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, pages 487499,
1994. [2]
[5] e) R. Agrawal and R. Srikant. Privacy-preserving data mining. In SIGMOD Conference, pages 439450, 2000.

Abstract:In faculty of computer engineering, designing of well structure websites are have challenge with effective user navigation. Web developers has known of how a website should be structured can be considerably different from that of the users. How websites having their ideal structure can be consider different. For effective user navigation of website structure have various methods that offered to relink web pages, the complete fulfill new website structure are unpredictable and the measurement analysis or cost of disorientation(confusion of flow)of users are still not completing their analysis. This paper is having ability to improve website structure without introducing any changes like existing, illusive, changes that also knows as substantial changes in also allow large changes. In addition, this paper have defined evaluating analysis and using them to compute the overall performance for improving website structure by using genuine data sets. Evaluation results confirmed that the navigation of user on the improved structure is indeed greatly enhanced. More interestingly, this find that heavily disoriented users are more likely to benefit from the improved structure than the less disoriented users.
Keywords - Web Structure, Navigation Efficiency, Mini Sessions, Out-Degree Threshold, Website Design, User Navigation technique.

[1] Pingdom, "Internet 2009 in Numbers," http://royal.pingdom.Com/2010/01/22/internet-2009-in-numbers/, 2010.
[2] J. Grau, "US Retail e-Commerce: Slower But Still Steady Growth,"
http://www.emarketer.com/Report.aspx?code=emarketer_2000492, 2008.
[3] Internet retailer, "Web Tech Spending Static-But High-for the Busiest E-Commerce Sites," http://www.internetretailer.com/
dailyNews.asp?id = 23440, 2007
[4] D. Dhyani, W.K. Ng, and S.S. Bhowmick, "A Survey of Web Metrics," ACM Computing Surveys, vol. 34, no. 4, pp. 469-503,
2002.
[5] X. Fang and C. Holsapple, "An Empirical Study of Web Site Navigation Structures' Impacts on Web Site Usability," Decision
Support Systems, vol. 43, no. 2, pp. 476-491, 2007.
[6] J. Lazar, Web Usability: A User-Centered Design Approach. Addison Wesley, 2006.