Volume-3 , Issue-9 , Sep - 2015 Go Back

These days, Email is also one of the advertising medium. Though it is a healthy medium for advertising, this is getting misused also. It gets really inconvenient to attend all those unnecessary emails. It is also very distracting. Here we are proposing a solution as email classifier. It will classify the inbox emails into various categories. A selected category of emails can be blocked considering it spam. In this study, the features of traditional heuristics and social networking are presented by combining them in feature set. This is done with Bayesian algorithm, know very helpful in such text classification tasks. The experimental result shows that the high detection rate is achieved by proposed approach. In this by using reduced feature set method we identify malicious URLs in email.

Social Network, URL Detection, Bayesian Classification, Decision Tree, Feature Set Extraction

[1] Chia-Mei Chen, D.J. Guan, Qun-Kai Su, National Sun Yat-sen University, Kaohsiung, Taiwan, ROC.Feature set identification for detecting suspicious URLs using Bayesian classification in social networks, 133-147, 2014.
[2] Dhanalakshmi ranganayakulu, Chellappan C, “Adhiparasakthi Engineering College, Melmaruvathur 603319, INDIA. Anna University, Chennai 600025, INDIA. Detecting malicious URLs in E-mail-An implementation, 125-131, 2013
[3] Lei SHI, Qiang WANG, Xinming MA, Mei WENG, Hongbo QIAO, College of Information and Management Science, HeNan Agricultural University, Zhengzhou 450002,China.Spam Email Classification Using Decision Tree Ensemble, 949-956, 2012
[4] Enrico Blanzieri University of Trento, Italy Anton Bryl, Italy Create-Net, Trento, Italy. A Survey of Learning-Based Techniques of Email Spam Filtering, 1-35, October 2007.
[5] Xin Jin et.al “Social Spam Guard: A Data Mining Based Spam Detection System for Social Media Networks”, 37thInternational Conference on Very Large Data Bases, August 29th 2011, Washington.

Vispute Dhanashri, Vispute Bhagyashri, Sonawane Monika, Nikam Seema, "A Survey on Detecting Suspicious and Malicious URLs in E-mail and Social Networks," International Journal of Computer Sciences and Engineering, Vol.3, Issue.9, pp.205-209, 2015.

In this paper the virtual reality augmented R.T.O. testing with an interactive virtual environment is presented. It was designed as a modular system that can convert a car using Google Cardboard to in virtual reality (VR) car. Novel hardware components embedded with sensors were implemented on stationary car to monitor driver performance while immersing them in a virtual reality driving simulator providing to driver with visual and hepatic feedback.

Virtual Reality, Google Cardboard, Virtual Reality Driving Simulator, R.T.O Testing, Driver Performance

[1] Richard Ranky, Mark Sivak, Jeffrey Lewis,Venkata Gade, Judith E. Deutsch and Constantinos Mavroidis VRACK - VirtualReality Augmented Cycling Kit: Design and Validation IEEE Virtual Reality 2010. 20 - 24 March.
[2] Akinwuntan, A. E. De Weerdt, W. Feys, H., De Vooght, F.Devos, H. Baten, G. et al. (2007). Training of driving-related attentional performance after stroke using a driving simulator.
[3] Elizabeth H. Oakes (2007) Encyclopedia of World Scientist Info Base Publishing. p. 701. ISBN 978-1-4381-1882-6.Retrieved 16 August 2012
[4] J. Caviedesand, J. Villegas, “Real time 2D to 3D conversion: Technical and visual quality requirements,” IEEE International Conference on Consumer Electronics, pp. 897-898, 2011.
[5] Dougherty, Conor (May 28, 2015) “Google Intensifies Focus on its Cardboard Virtual Reality Device “Retrieved June 17, 2015

Nishant Swarnkar, Inderpal Singh Chug, Faraz Bagwan, Gaurav Thorat, "VR4DT : Virtual Reality for Driving Test," International Journal of Computer Sciences and Engineering, Vol.3, Issue.9, pp.210-213, 2015.

Now a day, voting for any social issue is important for modern democratic societies. The manual voting system is implemented for election from many years in our country. We are using face recognition to secure the system. The image captured at the time of registration as well as login phase is stored into the cloud database. The converted images are then matched by applying matching criteria which will be we decide. If match is found then and then only the user can proceed for voting Otherwise, the user is considered as invalid user or voter. For confirmation of voting, SMS will send to the voter from server to indicate voting is done successfully.

Face Recognition, Cloud Database, Web-Cam, Security

[1] Roddick, John F., and Myra Spiliopoulou. "A bibliography of temporal, spatial and spatio-temporal data mining research." ACM SIGKDD Explorations Newsletter 1.1 (1999): 34-38
[2] Face Base Online Voting System using Steganography (Volume 3, Issue 10, and October 2013).
[3] Kevin Daimi and et al. University of Detroit Mercy, Detroit, Michigan 48219, USA.
[4] Kirti Autade and et al., “E-voting on Android System”, International Journal of Emerging Technology and Advanced Engineering ,Volume 2, Issue 2, PP 242-245, February 2012 .
[5] William Stallings(2007),”Cryptography And Network Security ”. Edition 5,Pearson publications.
[6] Smita S. Mudholkar , Pradnya M. Shende , Milind V. Sarode , “Biometrics Authentication Technique” , International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.1, February 2012.
[7] Lingyan Bi, Weining Wang, HaobinZhong, Wenxuan Liu, "Design and Application of Remote Control System Using Mobile Phone with JNI Interface", The 2008 International Conference of Embedded Software and Systems Symposia (ICESS2008), ,pp.416-419,2008.
[8] Radovan Murin, “Mobile Voting for Android”, “Czech Technical University in Prague Faculty of Electrical Engineering, - GUI design, implementation and testing”, Thesis, May 6, 2011.[9]. A. B. Rajendra and H. S. Sheshadri (2012), Study on Visual Secret Sharing Schemes Using Biometric Authentication Techniques, AJCST, Vol 1, pp.157-160.
[9]. C. Neuman and Ts'o. Theodore, “Kerberos: An Authentication Service for Computer Networks”. IEEE Communications Magazine. September 1994.

[10] Anusha M N and Srinivas B K (2012), “Remote Voting System for Corporate Companies using Visual Cryptography,” vol. 2, pp. 250–251.
[11] Rajendra Basavegowda, Sheshadri Seenappa (2013) “Electronic Medical Report Security Using Visual Secret Sharing Scheme”, IEEE UKSim 15th International Conference on Computer Modeling and Simulation Proceedings, pp, 78-83.
[12] Hussein Khalid Abd-alrazzq1, Mohammad S. Ibrahim2 and Omar Abdurrahman Dawood (2012), “Secure Internet Voting System based on Public Key Kerberos”, IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 2, No 3, pp. 428-434.
[13] Kosala, Raymond, and Hendrik Blockeel. "Web mining research: A survey."ACMSigkdd Explorations Newsletter 2.1 (2000): 1-15.
[14] S. Stubblebine and V. Gligor. “On message integrity in cryptographic protocols”. In Symposium on Security and Privacy ’92. IEEE, 1992.
[15] Unnati A. Patel and Dr. Swamynarayan Priya, “Development of a Student Attendance Management System Using RFID and Face Recognition”, IJARCSMS, Volume 2, Issue 8, August 2014.
[16] P. N. Huu, V. Tran-Quang, and T. Miyoshi, “Image compression algorithm considering energy balance on wireless sensor networks,” in IEEE Int. Conf. Industrial Informatics (INDIN), Osaka, Japan, Jul. 13–16, 2010, pp. 1005–1010.
[17] M. Bishop and D. Wagner, “Risks of e-voting”, Community ACM, vol.50, no. 11, pp. 120–120, 2007.

Fugat Ashlesha G., Gaikwad Shital S., Gangurde Jyoti P. and Sawant Aishwarya S., "A Survey on Secured Online Voting System Using Face Recognition," International Journal of Computer Sciences and Engineering, Vol.3, Issue.9, pp.214-216, 2015.

In this paper we proposed that a system to present an android application for 3Dimentional model construction from 2Dimentional images. The system enables user to have more informative, interactive and user specific experiences with augmented information by recognizing/tracking the content of offline 2D images. For android device which required Low computational power and an image matching technique based on the combination of two binary feature descriptors are applied Our application can be applicable to many areas such as education and entertainment industry.

Augmented reality,BRISK,FREAK,Image processing,Image Matching and detection

[1] V. Vlahakis, N. Loannidis, J. Karigiannis, M. Tsotros, and M. Gounaris, "Archeoguide: An Augmented Reality Guide for Archaeological Sites," IEEE Computer Graphics and Applications, vol. 22, pp.52-60, 2002.
[2] iTacitus, http://www.itacitus.org (accessed on June, 29, 2013).
[3] S. Leutenegger, M. Chli, and R. Y. Siegwart, "BRISK: Binary robust invariant scalable keypoints," IEEE International Conference on Computer Vision (ICCV), pp. 2548-2555, 2011.
[4] A. Alahi, R. Ortiz, and P. Vandergheynst, "FREAK: Fast retina keypoints," Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 510-517, 2012.
[5]V. Lepetit, "On Computer Vision for Augmented Reality," International Symposium on Ubiquitous Virtual Reality (ISUVR), pp. 13-16, 2008.
[6] M. A. Fischler, R. C. Bolles, "Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography," Communications of ACM (CACM), vol. 24, no. 6, pp.381-395, 1981.
[7] Y-L. Chang, et al, “Depth Map Generation For 2D-To-3D Conversion By Short-Term Motion Assisted Color Segmentation” in Proceedings of ICME, 2007
[10] W. J. Tam, and L. Zhang, “3D-TV content generation: 2D-to-3D conversion,” in Proc. ICME, pp. 1869-1872, 2010

Pranoti Vaidya, Jyoti Deore, Rakhi Thakare and Pooja Pangavhane, "A Survey on: Conversion of 2 Dimensional Images to 3 Dimensional Model," International Journal of Computer Sciences and Engineering, Vol.3, Issue.9, pp.217-219, 2015.

This paper describes about research work carried out by various authors, in which different methods are adapted to mine negative association rules. Many research surveys indicate that negative association rules are very important as positive association rules. The discovery of negative association rules are based on the interest patterns and non-interest patterns from data base (that is mining negative association rules from frequent item sets and infrequent item sets). A negative association is referred to as a negative relation between two item sets. This negative relation implies a negative rule between the two item sets.

Negative Association Rules, Infrequent Item Sets, Non- Interest Patterns

[1] Savasere, E. Omiecinski and S. Navathe,” Mining for Strong Nеgativе Аssociations in a Large Database of Customer Transactions”, Proc. Intl. Conf. on Data Engineering, 1998, pp 494–502.
[2] R. Agarwal, E. R. Srikant, “Fast Algorithms for Mining Аssociation Rules in Large Databases,” Proc. Of the 20th International conference on very Large Databases,pp.487-499, Santiago, Chile, 1994.
[3] Idheba Mohammad Ali O, Swesi, Azuraliza Abu Bakar and Anis Suhailis Abdul Kadir “Mining Positive and Nеgativе Аssociation Rules from Interesting Frequent and Infrequent Itemsets” 978-1-4673-0024/10/@26 @2012.
[4] D.R. Thiruvady and G.I. Webb,” Mining Nеgativе Аssociation Rules Using GRD”, Proc. Pacific-Asia Conf. on Advances in Knowledge Discovery and Data Mining, 2004, pp 161–165.
[5] Wu Χ., Zhang C., Zhang S.: Mining both positive and nеgativе аssociation rules. In: Proc. Of ICML (2002) 658- 665
[6] Χ. Wu, C. Zhang and S. Zhang,” Efficient Mining of both Positive and Nеgativе Аssociation Rules”, ACM Trans on Information Systems, vol. 22(3), 2004, pp 381–405.
[7] P. Υan, G. Chen, C. Cornelis, M. De Cock and E.E. Kerre,” Mining Positive and Nеgativе Fuzzy Аssociation Rules”, LNCS 3213, 2004, pp 270–276.
[8] Χ. Υuan, B.P. Buckles, Z. Υuan and J. Zhang, ”Mining Nеgativе Аssociation Rules”, Proc. Seventh Intl. Symposium on Computers and Communication, Italy, 2002, pp 623–629.
[9] S. Brin, R. Motwani and C. Silverstein,” Beyond Market Baskets: Generalizing Аssociation Rules to Correlations”, Proc. ACM SIGMOD on Management of Data, 1997, pp 265-276.

[10] Rakesh duggirala, P.Narayan: IJCTT on “Mining Positive and Nеgativе Аssociation Rules Using Coherent Approach” ,2013
[11] Sandeep Singh Rawat and Lakshmi Rajamani “Probability Apriori based Approach to Mine Rare Аssociation Rules” Data Mining and Optimization (DMO) 28-29 June 2011, Selangor, Malaysia 978-1-61284-212-7/11/$26.00 ©IEEE 2011.
[12] Nikky Suryawanshi, Susheel Jain, Anurag Jain, “A Review of Nеgativе and Positive аssociation rule mining with Multiple constraint and correlation factor”, 2012, pp 778-781
[13] Li-Min Tsai, Shu-Jing Lin, and Don-Lin Υang “Efficient Mining of Generalized Nеgativе Аssociation Rules” Granular Computing 978-0-7695-4161-7/10 $26.00 © IEEE 2010.
[14] O. Daly and D. Taniar, “Exception rules mining based on nеgativе аssociation rules”, lecture notes in computer science, vol. 3046, 2004 and pp 543-552.
[15] M. L. Antonie and O. R. Zaiane, “Mining Positive and Nеgativе Аssociation Rules: an Approach for confined rules”, Proc. Intl. Conf. on Principles and Practice of Knowledge Discovery in Databases, 2004, pp 27-38.
[16] Arun K Pujari “Data Mining Techniques” @ Universities press (India) private limited 2001, 2009:81-99.
[17] Kavitha Rani et al. “Mining Nеgativе Аssociation Rules” International Journal of Engineering and Technology Vol.3 (2), 2011, 100-105.
[18] Sumalatha et al. “Mining Positive and Nеgativе Аssociation Rules” International Journal of Engineering and Technology Vol.02, No.09, 2010, 2916-2920
[19] Υun Sing Koh, Russel Pears, “Efficiently Finding Nеgativе Аssociation Rules With Out Ѕupport Threshold”: AI 2007, LNAI 4830, pp. 710–714, 2007. C_Springer-Verlag Berlin Heidelberg 2007
[20] Kudu, G. Islam, M.M; Munir, S.; Bari, M.F. “An associative classifier with nеgativе rules” 978-1-4244- 2172-5@31@2008
[21] John Tsiligaridis, Toppenish, WA” for mining nеgativе аssociation rules: An Approach for Binary Trees”: International Journal of New Computer Architectures and their Applications (IJNCAA) 3(3): 81-87. The Society of Digital Information and Wireless Communications, 2013 (ISSN: 2220-9085)
[22] Chris Cornelis, peng Υan, Χing Zhang: IEEE conference on “ Mining Positive and Nеgativе Аssociation Rules from Large Databases”, 2006.

E. Bala Krishna, B. Rama and A. Nagaraju, "A Survey on Effective Mining of Negative Association Rules from Huge Databases," International Journal of Computer Sciences and Engineering, Vol.3, Issue.9, pp.220-223, 2015.

In this paper we proposed that, the set of minutia factors is taken into consideration to be the maximum different feature for fingerprint illustration and is extensively used in fingerprint matching. It turned into believed that the minutia set does now not contain sufficient data to reconstruct the unique fingerprint photograph from which minutiae had been extracted. The prior know-how approximately fingerprint ridge systems is encoded in terms of orientation patch and non-stop segment patch dictionaries to improve the fingerprint reconstruction. We additionally proposed a brand new or first publicly to be had database for minor (additionally foremost) finger knuckle photographs from 503 exceptional topics. The efforts to expand an automatic minor finger knuckle sample matching scheme reap promising outcomes and illustrate its simultaneous use to seriously enhance the overall performance over the conventional finger knuckle identification.

Fingerprint Reconstruction; Knuckle Matching; Major & minor knuckle

[1] Kai Cao and Anil K. Jain, Fellow, IEEE, “Learning Fingerprint Reconstruction: From Minutiae to Image”, IEEE Transaction on information forensics and security, Vol. 10, No. 1, January 2015.
[2]Ajay Kumar, Senior Member,IEEE, “Importance of Being Unique From Finger Dorsal Patterns: Exploring Minor Finger KnucklePatterns in Verifying Human Identities”, IEEE Transaction on information forensics and security, Vol. 09, No. 8, August 2014.
[3] D. Maltoni, D. Maio, A. K. Jain, and S. Prabhakar, Handbook of Fingerprint Recognition, 2nd ed. New York, NY, USA: Springer-Verlag, 2009.
[4] Information Technology—Biometric Data Interchange Formats—Part 2: Finger Minutiae Data, ISO/IEC Standard 19794-2, 2005.
[5]FVC2002. (2002). Fingerprint Verification Competition. [Online]. Available:http://bias.csr.unibo.it/fvc2002/.
[6] C. J. Hill, “Risk of masquerade arising from the storage of biometrics,” B.S. thesis, Dept. Comput. Sci., Austral. Nat. Univ., Canberra, ACT, Australia, 2001.
[7] B. G. Sherlock and D. M. Monro, “A model for interpreting fingerprint topology,” Pattern Recognit., vol. 26, no. 7, pp. 1047–1055, 1993.
[8] A. Ross, J. Shah, and A. K. Jain, “From template to image: Reconstructing fingerprints from minutiae points,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 4, pp. 544–560, Apr. 2007.
[9] R. Cappelli, D. Maio, A. Lumini, and D. Maltoni, “Fingerprint image reconstruction from standard templates,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 9, pp. 1489–1503, Sep. 2007.
[10] J. Feng and A. K. Jain, “Fingerprint reconstruction: From minutiae to phase,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 2, pp. 209–223, Feb. 2011.
[11] S. Li and A. C. Kot, “An improved scheme for full fingerprint reconstruction,” IEEE Trans. Inf. Forensics Security, vol. 7, no. 6, pp. 1906–1912, Dec. 2012.

Kumavat Kalpesh, Jadhav Samiksha,Burkul Gauri, MahajanGaurav, "Verifying Human Unique Identities using Fingerprint Reconstruction and Knuckle Reorganization," International Journal of Computer Sciences and Engineering, Vol.3, Issue.9, pp.224-227, 2015.

Since ages, marking attendance and other similar college functions has been most important activities of any school, college to keep records. This record helps the organization in generating their month-end progress report etc such system may be manual or automated. In proposed system, an attempt has been made to develop and deploy M-ERP application on Android mobile phones. The advancement in the mobile devices, wireless and web technologies gives rise to new application that makes ERP system very easy and convenient. M-ERP means performing college register functions by using portable mobile device. M-ERP application will integrate all the business functions like marking attendance, marks, Student information etc in a single centralized database. M-ERP promising the possibility of convenient, easy and safe way to handle business functions of college. We have described how the android mobile phones are efficient and can be used for ERP system.

M-ERP Application, Portable, Business Functions, Single System And Database

[1]. “Mobile based College ERP system”, Ravindrakumar Rajput, Jitesh Gupta, Sonali Gulve & Sujit Ahirrao, International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181. Vol. 4 Issues 03, March-2015
[2]. Jiang Yingjie (2005), “Critical Success Factors in ERP Implementation in Finland”, M.Sc. Thesis in Accounting, the Swedish School of Economics and Business Administration.
[3]. Kvavik, R. B., Katz,R. N., Beecher, K., Caruso, J., King, P., Voludakis, J., & Williams, L.A. (2002). The promise and performance of enterprise systems for higher education ERS0204).
[4]. DUCAUSE Center for Applied Research (ECAR). 15. Kim, Y. Lee-Z. Gosain. S. (2005) “Impediments to successful ERP implementation process”, Business Process Management Journal, 11(2), 158-170. 16. King, P., Kvavik, R. B., & Voloudakis, J. (2002). Enterprise resource planning systems in higher education (ERB0222). Boulder, CO:Educause Center for Applied Research (ECAR).
[5]. Implementing Cloud ERP systems in Higher Educational Institutes and Universities, Prof. Shreedhar Deshmukh, Indian Journal of Research PARIPEX,ISSN – 2250-1991, Volume : 3 | Issue : 2 | Feb 2014.

Akshay Kulshrestha, Jinal Patel, Pornima Deshmukh and Lavina Krishnani , "A Survey on Mobile based ERP system (M-ERP)," International Journal of Computer Sciences and Engineering, Vol.3, Issue.9, pp.228-231, 2015.

In today’s E-Commerce market mostly all the vendors like Amazon, Flipkart, Snap deal and other E-Commerce websites are show its product in the form of 2D image. Our world is exist in 3D but we mostly use 2D view for see something virtually (include newspaper image, TV advertise, template). All these things are come under boundary and resist the customer to provide full view of product. So in this paper we are representing the positive points and drawbacks of the existing system. It will help to build the proposed system. Generally each e-commerce website show different views of products by uploading images in 2D view due to this customer face problem they can’t see the fully view of product. Very few websites shows their products in 3D view using flash player, but the problem with showing 3D view of product using flash player. First its static i.e. it will show the 3D view of the products with generated flash file. Second thing it needs flash player to run the 3D view of product. In this paper we represent existing system merits and demerits and give brief view about the present system.

2D image , 3D image generation algorithm and various method

[1] E. Delage, H. Lee, and A. Y. Ng, “A dynamic Bayesian network model for autonomous 3D reconstruction from a single indoor image,” in Proc.IEEE Comput. Soc. Conf. CVPR, Jun. 2006, pp. 2418–2428.
[2] N. Elfiky, T. Gevers, A. Gijsenij, and J. Gonzàlez, “Color constancy using 3D scene geometry derived from a single image,” IEEE Trans.Image Process., vol. 23, no. 9, pp. 3855–3868, Sep. 2014.
[3] H. Wang, S. Gould, and D. Koller, “Discriminative learning with latent variables for cluttered indoor scene understanding,” in Proc. 11th ECCV, 2010, pp. 435–449.
[4] O. Barinova, V. Konushin, A. Yakubenko, K. Lee, H. Lim, and A. Konushin, “Fast automatic single-view 3D reconstruction of urban scenes,” in Proc. 10th Eur. Conf. Comput. Vis. (ECCV), Marseille, France, Oct. 2008, pp. 100–113.
[5] A. Saxena, M. Sun, and A. Y. Ng, “Make3D: Learning 3D scene structure from a single still image,” IEEE Trans. Pattern Anal. Mach.Intell., vol. 31, no. 5, pp. 824–840, May 2008.
[6] D. Hoiem, A. A. Efros, and M. Hebert, “Recovering surface layout from an image,” Int. J. Comput. Vis., vol. 75, no. 1, pp. 151–172, 2007.

Nayan Patel, Gaurav Mungase, Ram Patil, Amol Bodke , "Review of Image Representation in E-Commerce," International Journal of Computer Sciences and Engineering, Vol.3, Issue.9, pp.232-235, 2015.

Based on user interest and information requirement Personalized Web Search (PWS) delivers different search results for disguised users. Personalized web search have disguise characteristics while compared with common web search, as which deliver same set of search result for the same keyword search, by different kind of user have different needs. Really, these diligences have become one of the main hurdles for locating personalized search and how to do privacy-preserving personalization is a extensive challenge. Hence to overcome these difficulties privacy protection in Personalized Web Search provides a model hierarchical user profile, which have been built based on user preferences. Propose a PWS framework User Customizable Online Privacy-preserving Search with K-anonymity (UCOPSK) which generalizes profile as per the user specified privacy requirements in online and offline search. In this proposed work the profiles are constructed for each static and dynamic user in the websites. K-anonymity is applied to each user profile to manifest of sensitive information of user in privacy preservation, which can significantly prevent the sensational information leakage under attacks, and it is commonly used in discrete fields now a days. This paper describes the various approaches and techniques of preserving user data applied on personalized web search to build up a new algorithm & method to improve performance, utility and security of existing data and help to create the new predictions on the data. This paper describes the comparative study of clustering techniques used to improve privacy preservation on personalized web search.

Web pages, web search engines, personalized web search, web mining, privacy protection, risk, profile, generalization and k-anonymity

[1] M. Speretta, S. Gauch “Personalized Search based on User Search Histories”, IEEE/WIC/ACM International Conference on Web Intelligence (WI'05). Compiegne University of Technology, France, pp. 622-628 September 2005.
[2] Y. S. Chen, C. Shahabi, “Automatically improving the accuracy of user profiles with genetic algorithm”, Proceedings of IASTED International Conference on Artificial Intelligence and Soft Computing, Cancun, Mexico, pp. 283-288, May 2001.
[3] M. Halkidi, I. Koutsopoulos, “A game theoretic framework for data privacy preservation in recommender systems”, Proc. European Mach. Learn., Prin. Pract. Knowl. Disc. Databases, ECML PKDD, Springer-Verlag, pp. 629–644, 2011.
[4] Y. Xu, K. Wang, B. Zhang, Z. Chen, “Privacy-enhancing personalized Web search”, Proc. Int.WWWConf., ACM, pp. 591–600, 2007.
[5] Bedi, Punam, Harmeet Kaur, and Sudeep Marwaha. "Trust Based Recommender System for Semantic Web." In IJCAI, vol. 7, pp. 2677-2682, 2007.
[6] B. Shapira, Y. Elovici, A. Meshiach, T. Kuflik, ”The model for Private Web”, J. Amer. Soc. Inform. Sci., Technol., pp. 159–172, 2005.
[7] M. Halkidi, I. Koutsopoulos, “A game theoretic framework for data privacy preservation in recommender systems”, Proc. European Mach. Learn., Prin. Pract. Knowl. Disc. Databases, ECML PKDD, Springer-Verlag, pp. 629–644, , 2011.
[8] Y. Xu, K. Wang, B. Zhang, Z. Chen, “Privacy-enhancing personalized Web search”, Proc. Int.WWW Conf., ACM, pp. 591–600, 2007.
[9] D. Rebollo-Monedero, J. Forné, “Optimal query forgery for private information retrieval”, IEEE Trans. Inform. Theory, pp. 4631–4642, 2010.
[10] G. Paliouras, “Discovery of web user communities and their role in personalization User Model. User Adapt. Interact”, pp. 22(1–2), 151–175, 2012.
[11] P. Heymann, G.Koutrika, Garcia-Molina, “Can social bookmarking improve web search?”, Proceedings of the international conference on web search and web data mining, WSDM ’08, pp. 195–206, 2008.
[12] Ding, Shifei, Yanan Zhang, Xinzheng Xu, and Lina Bao. "A novel extreme learning machine based on hybrid kernel function." Journal of Computers 8, pp- 2110-2117, 2013.
[13] K. Ja¨rvelin and J. Keka¨la¨inen, “IR Evaluation Methods for Retrieving Highly Relevant Documents”, Proc. 23rd Ann. Int’l ACM SIGIR Conf. Research and Development Information Retrieval (SIGIR), pp. 41-48, 2000.
[14] Y. Zhu, L. Xiong, and C. Verdery, “Anonymizing User Profiles for Personalized Web Search”, Proc. 19th Int’l Conf. World Wide Web (WWW), pp. 1225-1226, 2010.
[15] J. Castellı´-Roca, A. Viejo, and J. Herrera-Joancomartı´, “Preserving User’s Privacy in Web Search Engines” Computer Comm., vol. 32, no. 13/14, pp. 1541-1551, 2009.
[16] X. Xiao and Y. Tao, “Personalized Privacy Preservation,” Proc. ACM SIGMOD Int’l Conf. Management of Data (SIGMOD), 2006.
[17] Z. Dou, R. Song, & J.R. Wen, “A large-scale evaluation and analysis of personalized search strategies”, In Proceedings of the 16th international conference on World Wide Web ACM, pp.582-590, May 2007.
[18] K. Sugiyama, K.Hatano & M. Yoshikawa, “Adaptive web search based on user profile constructed without any effort from users”, In Proceedings of the 13th international conference on World Wide Web, pp. 675-684, May 2004.
[19] Y. Xu, K. Wang, B. Zhang & Z. Chen, “Privacy-enhancing personalized web search”, In Proceedings of the 16th international conference on World Wide Web ACM, pp. 591-600, May 2007.
[20] J. Teevan, S. T. Dumais & E. Horvitz, “Personalizing search via automated analysis of interests and activities”, In Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval ACM, pp.449-456, August 2005.
[21] J. Sun, H. Zeng, H. Liu, Y. Lu, and Z. Chen, “CubeSVD: a novel approach to personalized web search”, In Proc. 14th Int. World Wide Web Conference, pp. 382–390, 2005.
[22] B. Smyth, M. Coyle, O. Boydell, P. Briggs, E.Balfe, J. Freyne and K. Bradley, “A live-user evaluation of collaborative web search”, In Proc. 19th Int. Joint Conf. on AI, 2005.
[23] K. Ramanathan, J. Giraudi, and A. Gupta, “Creating Hierarchical User Profiles Using Wikipedia,” HP Labs, 2008.
[24] P. A. Chirita, W. Nejdl, R. Paiu, and C. Kohlschu¨tter, “Using ODP metadata to personalize search”, In Proc. 31st Annual Int. ACM SIGIR Conf. on Research and Development in InformationRetrieval, pp. 178–185, 2005.
[25] A. Krause & E. Horvitz, “A utility-theoretic approach to privacy in online services”, Journal of Artificial Intelligence Research, pp. 633-662, 2010.
[26] D. Chaum, “Untraceable electronic mail, return addresses, and digital pseudonyms”, Commun. ACM , 1981, pp. 84–90
[27] L. Page, S.Brin, R.Motwani and T.Winograd, “The pagerank citation ranking: bringing order to the web”, Technical report, Computer Science Department, Stanford University, 1998.
[28] F. Liu and J.Cho, “Automatic identification of user interest for personalized search”, In Proc. 15th Int. World Wide Web Conference, pp.727–736, 2006.

V. Kavitha and T. Uma Maheswari, "Comparison User Customizable Privacy-preserving Search (UPS) with User Customizable Online Privacy-preserving Search with K-anonymity (UCOPSK)," International Journal of Computer Sciences and Engineering, Vol.3, Issue.9, pp.236-241, 2015.

The capability of distributing selected encrypted data with different users by means of public cloud storage may greatly alleviate the protection concerns over inadvertent data leaks in the cloud. Efficient management of encryption keys solves this difficulty. The preferred flexibility of distributing any group of selected documents with any group of users hassle different encryption keys to be used for different credentials. However, this also implies the requirement of securely sharing to users a large amount of keys for both encryption and search, and those users will have to securely stock up the received encrypted keys, and submit an equally large amount of keyword trapdoors to the cloud in order to carry out the exploration over the shared data. The obscure need for secure communication, storage, and complexity noticeably explains that the approach is not appliable. In this paper, a novel concept called, key aggregate Searchable encryption (KASE) is estimated to resolve this matter-of-fact problem and instantiating the notion through a concrete KASE scheme, in which a data holder only needs to share a single key to a user for distributing a large amount of documents, and the user only needs to tender a single trapdoor to the cloud for querying the user shared documents. But by using single key for a group, it is easily misused by the group members. If moved to multiple-keys, information is accesses by Brute-force attack. Hence it should be enhanced in a way that reduced number of keys should be used. The security analysis and concert evaluation both confirm that our projected schemes are provably secure and practically efficient.

Searchable Group Data Sharing, Public Key Encryption, Trapdoor, Cryptographic Cloud System

[1] S Yu, C Wang, K. Ren, and W. Lou, “Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Com-puting”, Proc. IEEE INFOCOM, pp. 534-542, 2010.
[2] R Lu, X Lin, X Liang, and X Shen, “Secure Provenance: The Essential of Bread and Butter of Data Forensics in Cloud Computing”, Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010.
[3] Z Liu, Z Wang, X Cheng, et al. “Multi-user Searchable Encryption with Coarser-Grained Access Control in Hybrid Cloud”, Fourth International Conference on Emerging Intelligent Data and Web Technologies (EIDWT), IEEE, pp. 249-255, 2013.
[4] L B Oliveira, D F Aranha, E Morais, et al. “Tinytate: Computing the tate pairing in resource-constrained sensor nodes”, IEEE Sixth IEEE International Symposium on Network Computing and Applications, pp. 318-323, 2007.
[5] M. Li, W. Lou, K. Ren. “Data security and privacy in wireless body area networks”, Wireless Communications, IEEE, 17(1): 51- 58, 2010.
[6] B Wang, B Li, and H Li, “Knox: Privacy-Preserving Auditing for Shared Data with Large Groups in the Cloud”, Proc. 10th Int’l Conf. Applied Cryptography and Network Security, pp. 507-525, 2012
[7] R A Popa ,N Zeldovich. “Multi-key searchable encryption”. Cryptology ePrint Archive, Report 2013/508, 2013.
[8] J Li, X F Chen, M Q Li, J W Li, P Lee, Wenjing Lou. “Secure Deduplication with Efficient and Reliable Convergent Key Management”, IEEE Transactions on Parallel and Distributed Systems, 25(6): 1615-1625, 2014.

[9] D H Phan, D Pointcheval, S F Shahandashti, et al. “Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts”, International journal of information security, 12(4): 251-265, 2013.
[10] J Li, K Kim. “Hidden attribute-based signatures without anonymity revocation”, Information Sciences, 180(9): 1681-1689, Elsevier, 2010.
[11] J W Li, J Li, X F Chen, et al. “Efficient Keyword Search over Encrypted Data with Fine-Grained Access Control in Hybrid Cloud”, In: Network and System Security 2012, LNCS, pp. 490- 502, 2012.
[12] X Liu, Y Zhang, B Wang, and J Yan. “Mona: secure multiowner data sharing for dynamic groups in the cloud”, IEEE Transactions on Parallel and Distributed Systems, 2013, 24(6): 1182-1191.

Santhiya.C, Vanishree K.A. and M.K. Chandrasekaran Ph.D., "Secured Group Data Bestow with Key-Agglomerative Searchable Encryption via Cloud Storage," International Journal of Computer Sciences and Engineering, Vol.3, Issue.9, pp.242-247, 2015.