iosr-JCE   Volume-13 ~ Issue-2

Abstract: Online Social Networks (OSNs) are inherently designed to enable people to share personal and public information and make social connections with others. These OSNs provides digital social interactions and social as well as personal information sharing, but in sharing a number of security and privacy problems raised. While OSNs allow users to restrict access to shared data, they currently do not provide any mechanism to totally enforce privacy issue solver associated with multiple users. To this end, we propose an approach to enable the protection of shared data associated with multiple users in OSNs. We formulate an access control model to capture the essence of multiparty authorization requirements, along with a multiparty policy specification scheme and a policy enforcement mechanism. Besides we also implement a proof-of-concept prototype which is called as MController (multi controller) having contributor, stakeholder and disseminator controllers along with owner controller.
Index Terms: social network, multi party access control, MController, decision voting.

[1] Hongxin Hu, Gail-Joon Ahn, Senior Member, IEEE, and Jan Jorgensen "Multiparty Access Control for Online Social Networks: Model and Mechanisms" IEEE transactions,2012.
[2] Besmer and H. Richter Lipford. "Moving Beyond Untagging: Photoprivacy in A Tagged World". pages 1563–1572. ACM, 2010.
[3] L. Bilge, T. Strufe, D. Balzarotti and E. Kirda. "All Your Contacts are Belong to Us: Automated Identity Theft Attacks On Social Networks". pages 551–560. ACM, 2009.
[4] Carminati and E. Ferrari. "Collaborative Access Control in Online Social Networks". pages 231–240. IEEE, 2011.
[5] Carminati, E. Ferrari, and A. Perego. "Rule-Based Access Control for Social Networks". pages 1734–1744. Springer, 2006.
[6] B. Carminati, E. Ferrari, and A. Perego. "Enforcing access control in web-based social networks." ACM Transactions on Information and System Security (TISSEC), 13(1):1–38, 2009.
[7] Carrie. "Access Control Requirements for Web 2.0 Security and Privacy." In Proc. of Workshop on Web 2.0 Security & Privacy (W2SP). Citeseer, 2007.
[8] J. Choi, W. De Neve, K. Plataniotis, and Y. Ro. "Collaborative face recognition for improved face annotation in personal photo collections shared on online social networks." Multimedia, IEEE Transactions on, 13(1):14–28, 2011.
[9] P. Fong. "Preventing sybil attacks by privilege attenuation: A design principle for social network systems." In Security and Privacy (SP), 2011 IEEE Symposium on, pages 263–278. IEEE, 2011.
[10] P. Fong."Relationship-based access control: Protection model and policy language". In Proceedings of the first ACM conference on Data and application security and privacy, pages 191–202. ACM, 2011.

Abstract: Frequent pattern mining is an important chore in the data mining, which reduces the complexity of the data mining task. The usages of frequent patterns in various verticals of the data mining functionalities are discussed in this paper. The gap analysis between the requirements and the existing technology is also analyzed. State of art in the area of frequent pattern mining was thrashed out here. Working mechanisms and the usage of frequent patterns in various practices were conversed in the paper. The core area to be concentrated is the minimal representation, contextual analysis and the dynamic identification of the frequent patterns.

Keywords: Frequent pattern, Association, Clustering, Classification

[1] Jiawei Han, Hong Cheng, Dong Xin,Xifeng Yan, "Frequent pattern mining: current status and future Directions", Data Mining and Knowledge Discovery, Vol. 15 (2007), pp. 55-86.

[2] Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993ACM-SIGMODinternational conference on management of data (SIGMOD'93), Washington, DC, pp 207–216

[3] Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 1994 international conference on very large data bases (VLDB'94), Santiago, Chile, pp 487–499

[4] Mannila H, Toivonen H, Verkamo AI (1994) Efficient algorithms for discovering association rules. In: Proceeding of the AAAI'94 workshop knowledge discovery in databases (KDD'94), Seattle, WA, pp 181–192

[5] Park JS, Chen MS, Yu PS (1995) An effective hash-based algorithm for mining association rules. In: Proceeding of the 1995 ACM-SIGMOD international conference on management of data (SIGMOD'95), San Jose, CA, pp 175–186 [6] Savasere A, Omiecinski E, Navathe S (1995) An efficient algorithm for mining association rules in large databases. In: Proceeding of the 1995 international conference on very large data bases (VLDB'95), Zurich, Switzerland, pp 432–443

[7] Toivonen H (1996) Sampling large databases for association rules. In: Proceeding of the 1996 international conference on very large data bases (VLDB'96), Bombay, India, pp 134–145

[8] Brin S, Motwani R, Ullman JD, Tsur S (1997) Dynamic itemset counting and implication rules for market basket analysis. In: Proceeding of the 1997 ACM-SIGMOD international conference on management of data (SIGMOD'97), Tucson, AZ, pp 255–264

[9] Cheung DW, Han J, Ng V, Wong CY (1996) Maintenance of discovered association rules in large an incremental updating technique. In: Proceeding of the 1996 international conference on data engineering (ICDE'96), New Orleans, LA, pp 106–114

[10] Park JS, Chen MS, Yu PS (1995) Efficient parallel mining for association rules. In: Proceeding of the 4th international conference on information and knowledge management, Baltimore, MD, pp 31–36

Abstract: Adequate user authentication is a persistent problem, particularly with hand- held devices such as Personal Digital Assistants (PDAs), which tend to be highly personal and at the fringes of an organization's influence. Yet, these devices are being used increasingly in corporate settings where they pose a security risk, not only by containing sensitive information, but also by providing the means to access such information over wireless network interfaces. User authentication is the first line of defense for a lost or stolen PDA. How- ever, motivating users to enable simple PIN or password mechanisms and periodically update their authentication information is a constant struggle. This paper describes a general-purpose mechanism for authenticating a user to a PDA using a visual login technique called Picture Password. The underlying rationale is that image recall is an easy and natural way for users to authenticate, removing a serious barrier to compliance with organizational policy. Features of Picture Password include style dependent image selection, password reuse, and embedded salting, which overcome a number of problems with knowledge-based authentication for handheld devices. Though designed specifically for handheld devices, Picture Password is also suitable for note-books, workstations, and other computational devices. Scrambling technique is applied to make image recognition more complex during the login process and thus protecting from the common attacks in the graphical password system.

Keywords: Graphical Passwords, Security, Image Scrambling,KBRP.

[1] The Quest to Replace Passwords: A Framework for Comparative Evaluation of Web Authentication Schemes,Joseph Bonneau University of Cambridge Cambridge, UK jcb82@cl.cam.ac.uk Cormac Herley Microsoft Research Redmond, WA, USA cormac@microsoft.com Paul C. van Oorschot Carleton University Ottawa, ON, Canada paulv@scs.carleton.ca Frank Stajanoy University of Cambridge Cambridge, UK
frank.stajano@cl.cam.ac.uk

[2] Persuasive Cued Click-Points: Design, Implementation, and Evaluation of a Knowledge-Based Authentication Mechanism Sonia Chiasson, Member, IEEE, Elizabeth Stobert, Student Member, IEEE, Alain Forget, Robert Biddle, Member, IEEE, and Paul C. van Oorschot, Member, IEEE.IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 9, NO. 2, MARCH/APRIL 2012

[3] Persuasive Cued Click Points with Click Draw Based Graphical Password Scheme P. R. Devale Shrikala M. Deshmukh, Anil B. Pawar.
[4] Purely Automated Attacks on PassPoints-Style Graphical Passwords Paul C. van Oorschot, Amirali Salehi-Abari, and Julie Thorpe
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 5, NO. 3, SEPTEMBER 2010

[5] S. Chiasson, P. van Oorschot, and R. Biddle, ?Graphical Password Authentication Using Cued Click Pointsm Pro c. European Symp. Research in Computer Security (ESORICS), pp. 359-374, Sept. 2007.

[6] The science of guessing: analyzing an anonymized corpus of 70 million passwords Joseph Bonneau Computer Laboratory University of Cambridge jcb82@cl.cam.ac.uk. 2012 IEEE Symposium on Security and Privacy

[7] Dimitri Van De Ville, W.P., Rik Van de Walle, Ignace Lemahieu, Image Scrambling Without Bandwidth Expansion. IEEE Transactions on Cirsuits and Systems for Video Technology, 2004. 14

[8] AN IMAGE SCRAMBLING ALGORITHM USING PARAMETER BASED M-SEQUENCES YICONG ZHOU1, KAREN PANETTA1, FELLOW, IEEE, SOS AGAIAN2, SENIOR MEMBER, IEEE.

[9] Guosheng Gu, g.H. The application of chaos and DWT in image scrambling. in Proceeding of the Fifith Interational Conference on Machine Learning and Cybernetics. 2006. Dalian.

[10] S. Agaian, J.A., K. Egiazarian, P. Kuosmanen, Decompositional methods for stack filtering using Fibonacci pcodes. Signal Processing, 1995. 41: p. 101-110.