1 --- 6/16/2015 9:20:53 PM 9. Role-Based Access Control (RBAC) Role Classification Algorithm Prof. Bharat Bhargava Center for Education and Research in.

Slides:



Advertisements
Similar presentations
Answering Approximate Queries over Autonomous Web Databases Xiangfu Meng, Z. M. Ma, and Li Yan College of Information Science and Engineering, Northeastern.
Advertisements

Security Issues in Mobile Code Systems David M.Chess, High Integrity Computing Lab, IBM T.J. Watson Research Center Hawthorne, NY, USA Mobile code systems.
Clustering k-mean clustering Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein.
1 Trust-based Privacy Preservation for Peer-to-peer Data Sharing Y. Lu, W. Wang, D. Xu, and B. Bhargava yilu, wangwc, dxu, cs.purdue.edu Department.
Application of Bayesian Network in Computer Networks Raza H. Abedi.
Face Recognition Face Recognition Using Eigenfaces K.RAMNATH BITS - PILANI.
/7/2015 8:01:19 PM 7. Using Trust for Role-Based Access Control (RBAC) Prof. Bharat Bhargava Center for Education and Research in Information Assurance.
IUCRC New Site Planning Grant Purdue University Net-Centric Software and Systems Research Center Joining Existing NSFcenters at Univ. of North Texas, Arizona.
Dynamics of Learning VQ and Neural Gas Aree Witoelar, Michael Biehl Mathematics and Computing Science University of Groningen, Netherlands in collaboration.
Information Security and Assurance Center 1 Address: 615 McCallie Avenue Phone: Chattanooga TN 37403
International Workshop on Semantic Based GIS Ontology assisted decision making a case study in trip planning for tourism Eleni Tomai, Maria Spanaki, Poulicos.
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
Service Discrimination and Audit File Reduction for Effective Intrusion Detection by Fernando Godínez (ITESM) In collaboration with Dieter Hutter (DFKI)
K nearest neighbor and Rocchio algorithm
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
1 Trust and Privacy in Authorization Bharat Bhargava Yuhui Zhong Leszek Lilien CERIAS Security Center CWSA Wireless Center Department of CS and ECE Purdue.
CS292 Computational Vision and Language Pattern Recognition and Classification.
Secure communication in cellular and ad hoc environments Bharat Bhargava Department of Computer Sciences, Purdue University This is supported.
Improving Image registration accuracy Narendhran Vijayakumar 02/29/2008.
Tracking a moving object with real-time obstacle avoidance Chung-Hao Chen, Chang Cheng, David Page, Andreas Koschan and Mongi Abidi Imaging, Robotics and.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
CoLaB 22nd December 2005 Secure Access to Service-based Collaborative Workflow for DAME Duncan Russell Informatics Institute University of Leeds, UK.
1 Life-and-Death Problem Solver in Go Author: Byung-Doo Lee Dept of Computer Science, Univ. of Auckland Presented by: Xiaozhen Niu.
Neural Technology and Fuzzy Systems in Network Security Project Progress 2 Group 2: Omar Ehtisham Anwar Aneela Laeeq
Sanjay Goel, School of Business/Center for Information Forensics and Assurance University at Albany Proprietary Information 1 Unit Outline Information.
Semi-Supervised Clustering Jieping Ye Department of Computer Science and Engineering Arizona State University
September 2003 Fraud Formalization and Detection Bharat Bhargava, Yuhui Zhong, Yunhua Lu Center for Education and Research in Information Assurance and.
Mining Behavior Models Wenke Lee College of Computing Georgia Institute of Technology.
Using Entropy to Trade Privacy for Trust Yuhui Zhong Bharat Bhargava {zhong, Department of Computer Sciences Purdue University This work.
Parallel K-Means Clustering Based on MapReduce The Key Laboratory of Intelligent Information Processing, Chinese Academy of Sciences Weizhong Zhao, Huifang.
Data Mining for Intrusion Detection: A Critical Review Klaus Julisch From: Applications of data Mining in Computer Security (Eds. D. Barabara and S. Jajodia)
● Problem statement ● Proposed solution ● Proposed product ● Product Features ● Web Service ● Delegation ● Revocation ● Report Generation ● XACML 3.0.
High Accuracy Attack Provenance via Binary-based Execution Partition Kyu Hyung Lee Xiangyu Zhang Dongyan Xu Department of Computer Science and CERIAS,
Intrusion Detection for Grid and Cloud Computing Author Kleber Vieira, Alexandre Schulter, Carlos Becker Westphall, and Carla Merkle Westphall Federal.
Indoor Localization using Wireless LAN infrastructure Location Based Services Supervised by Prof. Dr. Amal Elnahas Presented by Ahmed Ali Sabbour.
Unsupervised Learning Reading: Chapter 8 from Introduction to Data Mining by Tan, Steinbach, and Kumar, pp , , (
nd Joint Workshop between Security Research Labs in JAPAN and KOREA Profile-based Web Application Security System Kyungtae Kim High Performance.
Computer Security: Principles and Practice
Giorgos Giannopoulos (IMIS/”Athena” R.C and NTU Athens, Greece) Theodore Dalamagas (IMIS/”Athena” R.C., Greece) Timos Sellis (IMIS/”Athena” R.C and NTU.
A security framework combining access control and trust management for mobile e-commerce applications Gregor v.Bochmann, Zhen Zhang, Carlisle Adams School.
2001/11/27IDS Lab Seminar1 Adaptive Fraud Detection Advisor: Dr. Hsu Graduate: Yung-Chu Lin Source: Fawcett, Tom and Foster Provost, Journal of Data Mining.
Visual Information Systems Recognition and Classification.
Chapter 4: Pattern Recognition. Classification is a process that assigns a label to an object according to some representation of the object’s properties.
Authorization in Trust Management Conditional Delegation and Attribute-Based Role Assignment using XACML and RBAC Brian Garback © Brian Garback 2005.
Date : 2013/03/18 Author : Jeffrey Pound, Alexander K. Hudek, Ihab F. Ilyas, Grant Weddell Source : CIKM’12 Speaker : Er-Gang Liu Advisor : Prof. Jia-Ling.
SOME ISSUES OF ROLE- BASED COLLABORATION Haibin Zhu, PhD Member, IEEE, Assistant Professor Dept. of Computer Science, Nipissing University, 100 College.
A Trust Based Distributed Kalman Filtering Approach for Mode Estimation in Power Systems Tao Jiang, Ion Matei and John S. Baras Institute for Systems Research.
Data and Applications Security Research at the University of Texas at Dallas Dr. Bhavani Thuraisingham The University of Texas at Dallas April 25, 2006.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Advisor : Dr. Hsu Graduate : Sheng-Hsuan Wang Authors :
Gene expression & Clustering. Determining gene function Sequence comparison tells us if a gene is similar to another gene, e.g., in a new species –Dynamic.
Intelligent Database Systems Lab Advisor : Dr. Hsu Graduate : Chien-Shing Chen Author : Juan D.Velasquez Richard Weber Hiroshi Yasuda 國立雲林科技大學 National.
Adaptive Tracking in Distributed Wireless Sensor Networks Lizhi Yang, Chuan Feng, Jerzy W. Rozenblit, Haiyan Qiao The University of Arizona Electrical.
CISC 849 : Applications in Fintech Namami Shukla Dept of Computer & Information Sciences University of Delaware iCARE : A Framework for Big Data Based.
At the beginning of each semester, CSE hires a number of Graduate Teaching Assistants (GTAs) as graders, lab supervisors, and instructors. The department.
Clustering Algorithms Sunida Ratanothayanon. What is Clustering?
An Energy-Efficient Approach for Real-Time Tracking of Moving Objects in Multi-Level Sensor Networks Vincent S. Tseng, Eric H. C. Lu, & Kawuu W. Lin Institute.
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.
1 XACML for RBAC and CADABRA Constrained Delegation and Attribute-Based Role Assignment Brian Garback © Brian Garback 2005.
SECURITY IN MOBILE NETWORKS Bharat Bhargava CERIAS and Computer Sciences Departments Purdue University, W. Lafayette, IN Supported.
VIEWS b.ppt-1 Managing Intelligent Decision Support Networks in Biosurveillance PHIN 2008, Session G1, August 27, 2008 Mohammad Hashemian, MS, Zaruhi.
Anomaly Detection Carolina Ruiz Department of Computer Science WPI Slides based on Chapter 10 of “Introduction to Data Mining” textbook by Tan, Steinbach,
Talal H. Noor, Quan Z. Sheng, Lina Yao,
Semi-Supervised Clustering
Clustering.
DataMining, Morgan Kaufmann, p Mining Lab. 김완섭 2004년 10월 27일
Dry Run Fix it Write a program
Formalization of Trust, Fraud, and Vulnerability Analysis
Trust-based Privacy Preservation for Peer-to-peer Data Sharing
Presentation transcript:

/16/2015 9:20:53 PM 9. Role-Based Access Control (RBAC) Role Classification Algorithm Prof. Bharat Bhargava Center for Education and Research in Information Assurance and Security (CERIAS) and Department of Computer Sciences Purdue University Collaborators in the RAID Lab ( Ms. E. Terzi (former Graduate Student) Dr. Yuhui Zhong (former Ph.D. Student) Prof. Sanjay Madria (U. Missouri-Rolla) This research is supported by CERIAS and NSF grants from IIS and ANIR.

/16/2015 9:20:53 PM RBAC Role Classification Algorithm - Outline 1) Introduction 2) Algorithm 2.1) Algorithm Preliminaries 2.2) Algorithm - Training Phase 2.3) Algorithm - Classification Phase 2.4) Classification Algorithm Pseudocode 3) Experiments 3.1) Experiment 1: Classification Accuracy 3.2)Experiment 2: Detection and Diagnosis 3.3) Experiment Summary

/16/2015 9:20:53 PM 1) Introduction Goals for RBAC Role Classification Algorithm Detect intruders (malicious users) that enter the system Build user role profiles using a supervised clustering algorithm Incorporate the method in RBAC Server Architecture  RBAC = Role Based Access Control Context Role server architecture that dynamically assigns roles to users based on trust and credential information Role classification algorithm phases Training phase  Build clusters that correspond to the role profiles based on the previously selected training set of normal audit log records Classification phase  Process on the run users audit records and specify whether they behave according to the profile of the role they are holding [E. Terzi, Y. Zhong, B. Bhargava et al., 2002]

/16/2015 9:20:53 PM 2) Algorithm 2.1) Algorithm Preliminaries Data format Audit log record [X 1, X 2,…,X n, R i ] where : X 1, X 2,…,X n - n attributes of the audit log R i : role held by user who created the log record assumption: Every user can hold only one role No records of the form: [X 1, X 2,…,X n, R i ] [X 1, X 2,…,X n, R j ] with R i  R j

/16/2015 9:20:53 PM 2.2) Algorithm - Training Phase Training Phase – Building the Cluster Create d dummy clusters, where d - nr of all discrete system roles  Centroid - the mean vector, containing the average values of the selected audit data attributes of all the users that belong to the specific role a) For each training data record (Rec cur ), calculate its Euclidean distance from each one of existing clusters b) Find the closest cluster C cur to Rec cur c) If role represented by C cur = role of Rec cur then cluster Rec cur to C cur else create a new cluster C new containing Rec cur C new centroid:  Rec cur C new role:  Role of Rec cur

/16/2015 9:20:53 PM 2.3) Algorithm - Classification Phase Classification Phase Calculate distance between the newly produced audit record Rec new of a user U and each existing cluster a) Find cluster C min closer to Rec new b) Find cluster C cur closest to Rec new c) if role represented by C cur = role of Rec new then U is a normal user else U is an intruder and an alarm is raised

/16/2015 9:20:53 PM Input: cluster list, audit log record Rec for every cluster C i in cluster list calculate the distance between Rec and C i find the closest cluster C min if C min.role = Rec.role then return else raise alarm Input: Training audit log record [X1, X2,…,Xn, R], where X1,,…,Xn are attribute values, and R is the user’s role Output: A list of centroid representations of clusters [M1, M2,…, Mn, pNum, R] Step 1: for every role R i, create one cluster C i C i.role = R i for every attribute M k : 2.4) Classification Algorithm Pseudocode Step 2: for every training record Rec i calculate its Euclidean distance from existing clusters find the closest cluster C min if C min.role = Rec i.role then reevaluate the attribute values else create new cluster C j C j.role = Rec i.role for every attribute M k : C j.M k = Rec i.M k  Training Phase – Build Clusters  Classification Phase – Detect Malicious Users

/16/2015 9:20:53 PM 3) Experiments 3.1) Experiment 1: Classification Accuracy Goal Test classification accuracy of the method Data Training Set: 2000 records Test Set: Substi- tute 0% - 90% of records from the training set with new records  Experiment results

/16/2015 9:20:53 PM 3.2) Experiment 2: Detection & Diagnosis Goal Test the ability of the algorithm to point out misbehaviors and specify the type of misbehavior Data Training Set: 2000 records Test Set: Modify the role attribute of 0%-90% of the 2000 records from the training set  Experiment results

/16/2015 9:20:53 PM 3.3) Experiment Summary  Accuracy of detection of malicious users by the classification algorithm ranges from 60% to 90%  90% of misbehaviors identified in a friendly environment  Friendly environment - fewer than 20% of behaviors are malicious  60% of misbehaviors identified in an unfriendly environment  Unfriendly environment - at least 90% of behaviors are malicious)

/16/2015 9:20:53 PM Our Research at Purdue  Web Site: http/  Over one million dollars in current support from: NSF, Cisco, Motorola, DARPA  Selected Publications  B. Bhargava and Y. Zhong, "Authorization Based on Evidence and Trust", in Proc. of Data Warehouse and Knowledge Management Conference (DaWaK), Sept  E. Terzi, Y. Zhong, B. Bhargava, Pankaj, and S. Madria, "An Algorithm for Building User-Role Profiles in a Trust Environment", in Proc. of DaWaK, Sept  A. Bhargava and M. Zoltowski, “Sensors and Wireless Communication for Medical Care,” in Proc. of 6 th Intl. Workshop on Mobility in Databases and Distributed Systems (MDDS), Prague, Czechia, Sept  B. Bhargava, Y. Zhong, and Y. Lu, "Fraud Formalization and Detection", in Proc. of DaWaK, Prague, Czech Republic, Sept

/16/2015 9:20:53 PM THE END