Audit Games Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha 1 Carnegie Mellon University.

Slides:



Advertisements
Similar presentations
Policy Auditing over Incomplete Logs: Theory, Implementation and Applications Deepak Garg 1, Limin Jia 2 and Anupam Datta 2 1 MPI-SWS (work done at Carnegie.
Advertisements

QoS-based Management of Multiple Shared Resources in Dynamic Real-Time Systems Klaus Ecker, Frank Drews School of EECS, Ohio University, Athens, OH {ecker,
Adaptive Regret Minimization in Bounded Memory Games Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha 1 GameSec 2013 – Invited Paper.
Time Slicing in Mobile TV Broadcast Networks with Arbitrary Channel Bit Rates Cheng-Hsin Hsu Joint work with Mohamed Hefeeda April 23, 2009 Simon Fraser.
Current Techniques in Language-based Security David Walker COS 597B With slides stolen from: Steve Zdancewic University of Pennsylvania.
1 University of Southern California Keep the Adversary Guessing: Agent Security by Policy Randomization Praveen Paruchuri University of Southern California.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Randomized Sensing in Adversarial Environments Andreas Krause Joint work with Daniel Golovin and Alex Roper International Joint Conference on Artificial.
Regret Minimizing Audits: A Learning-theoretic Basis for Privacy Protection Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha Carnegie Mellon.
Playing Games for Security: An Efficient Exact Algorithm for Solving Bayesian Stackelberg Games Praveen Paruchuri, Jonathan P. Pearce, Sarit Kraus Catherine.
1 Learning with continuous experts using Drifting Games work with Robert E. Schapire Princeton University work with Robert E. Schapire Princeton University.
Part II General Integer Programming II.1 The Theory of Valid Inequalities 1.
Security via Strategic Randomization Milind Tambe Fernando Ordonez Praveen Paruchuri Sarit Kraus (Bar Ilan, Israel) Jonathan Pearce, Jansuz Marecki James.
Computing Optimal Randomized Resource Allocations for Massive Security Games Presenter : Jen Hua Chi Advisor : Yeong Sung Lin.
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
A Convex Optimization Approach to Model (In)validation of Switched ARX Systems with Unknown Switches Northeastern University Yongfang Cheng 1, Yin Wang.
Intelligent Patrolling Sarit Kraus Department of Computer Science Bar-Ilan University Collaborators: Noa Agmon, Gal Kaminka, Efrat Sless 1.
Regret Minimizing Audits: A Learning-theoretic Basis for Privacy Protection Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha Carnegie Mellon.
Time Slicing in Mobile TV Broadcast Networks with Arbitrary Channel Bit Rates Cheng-Hsin Hsu Joint work with Dr. Mohamed Hefeeda April 23, 2009 Simon Fraser.
A Game-theoretic Approach to the Design of Self-Protection and Self-Healing Mechanisms in Autonomic Computing Systems Birendra Mishra Anderson School of.
All rights reserved © 2005, Alcatel Enhanced Security situational Awareness for (Enterprise) networks  Bertrand Marquet / François Cosquer  Alcatel.
Loss and Delay Accountability for the Internet by Presented by:Eric Chan Kai Chen.
Systems with small trusted computing bases (TCBs) open possibility for automated security verification of systems Example: SecVisor - a 3kLOC security.
© P. Pongcharoen ISA/1 Applying Designed Experiments to Optimise the Performance of Genetic Algorithms for Scheduling Capital Products P. Pongcharoen,
1 DETERRING INTERNAL INFORMATION SYSTEMS MISUSE EECS711 : Security Management and Audit Spring 2010 Presenter : Amit Dandekar Instructor : Dr. Hossein.
Stochastic greedy local search Chapter 7 ICS-275 Spring 2007.
Feasibility Criteria for Investigating Potential Application Areas of AI Planning T.L.McCluskey, The University of Huddersfield,UK
Commitment without Regrets: Online Learning in Stackelberg Security Games Nika Haghtalab Carnegie Mellon University Joint work with Maria-Florina Balcan,
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Copyright © 2006 CyberRAVE LLC. All rights reserved. 1 Virtual Private Network Service Grid A Fixed-to-Mobile Secure Communications Framework Managed Security.
1 Privacy-Preserving Distributed Information Sharing Nan Zhang and Wei Zhao Texas A&M University, USA.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
When Security Games Go Green: Designing Defender Strategies to Prevent Poaching and Illegal Fishing Fei Fang 1, Peter Stone 2, Milind Tambe 1 University.
Advertisement 1. Audit Mechanisms for Provable Risk Management and Accountable Data Governance Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh.
7 th Continual Improvement & Innovation Symposium 2015 CASE STUDY COMPETITION: INNOVATION TEMPLATE [ Name of the Organization ] [ Innovation Title ]
Incentive Compatible Assured Information Sharing Murat Kantarcioglu.
CSC8320. Outline Content from the book Recent Work Future Work.
m-Privacy for Collaborative Data Publishing
The Cost and Windfall of Manipulability Abraham Othman and Tuomas Sandholm Carnegie Mellon University Computer Science Department.
EasyBid: Enabling Cellular Offloading via Small Players Zhixue Lu 1, Prasun Sinha 1 and R. Srikant 2 1 The Ohio State University 2 Univ. of Illinois at.
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Tuomas Raivio and Raimo P. Hämäläinen Systems Analysis Laboratory Helsinki.
Playing GWAP with strategies - using ESP as an example Wen-Yuan Zhu CSIE, NTNU.
Computing and Approximating Equilibria: How… …and What’s the Point? Yevgeniy Vorobeychik Sandia National Laboratories.
Application of Design Heuristics in the Designing and Implementation of Object Oriented Informational Systems.
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Evolving Reactive NPCs for the Real-Time Simulation Game.
Illustration: 3-Party Secure Sum Compare, match, and analyze data from different organizations without disclosing the private data to any other party Experimental.
A demonstration of distribution-based calibration Ioulia MARKOU, Vasileia PAPATHANASOPOULOU, Constantinos ANTONIOU National Technical University of Athens,
Stochastic greedy local search Chapter 7 ICS-275 Spring 2009.
Privacy Preserving Payments in Credit Networks By: Moreno-Sanchez et al from Saarland University Presented By: Cody Watson Some Slides Borrowed From NDSS’15.
m-Privacy for Collaborative Data Publishing
Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.
Self-Organized Resource Allocation in LTE Systems with Weighted Proportional Fairness I-Hong Hou and Chung Shue Chen.
Overview of the Operations Research Modeling Approach Chapter 2: Hillier and Lieberman Chapter 2: Decision Tools for Agribusiness Dr. Hurley’s AGB 328.
Part II General Integer Programming II.1 The Theory of Valid Inequalities 1.
Bayesian Algorithmic Mechanism Design Jason Hartline Northwestern University Brendan Lucier University of Toronto.
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
Teaching Computers to Think:
Keep the Adversary Guessing: Agent Security by Policy Randomization
Security in Outsourcing of Association Rule Mining
A Game Theoretic Study of Attack and Defense in Cyber-Physical Systems
Non-additive Security Games
Differential Evolution
Who cares about implementation and precision?
A Novel Framework for Software Defined Wireless Body Area Network
When Security Games Go Green
CSE 4705 Artificial Intelligence
CASE − Cognitive Agents for Social Environments
18734: Foundations of Privacy
Dr. Arslan Ornek MATHEMATICAL MODELS
Presentation transcript:

Audit Games Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha 1 Carnegie Mellon University

Motivation 2

Auditing  Permissive real time access control policy  Inspect accesses after occurrence  Find and punish policy violators  How does it help?  Deter potential violators  Take remedial measures to prevent future losses 3

Auditing for Policy Enforcement HIPAA GLBA EU Data Protection Directive 4

Auditing in Practice  FairWarning Audit Tool for hospitals  Flags all celebrity record accesses as suspicious  Place traffic police at strategic locations  Intelligent heuristics, but, no mathematical model or guarantees 5

Why study Audit Process?  Optimize costs expended in auditing  Audits costs money  Prevent violations  Decide appropriate punishment for deterrence  Efficiently computable audit strategies  Enable cost-optimal prioritized inspections 6

Outline  Simple rational game model  Example  Main Algorithm for computing equilibrium  Example  Future Work 7

Simple Rational Model 8 Utility when audited Utility when unaudited

Punishment as an Action  High Punishment: Hostile Work Environment  Low Punishment: No incentive to follow policy. x 9 Simple Rational Model

Stackelberg Equilibrium Concept 10 Simple Rational Model

Small example Example Defender’s utility Adversary’s utility 11

Example contd. 12 Example

Computing Optimal Defender Strategy 13 Quadratic Non-convex Simple Rational Model

Properties of Optimal Point 14 Tight Constraints Main Algorithm

Main Idea in Algorithm 15 Main Algorithm

16 Main Algorithm

Main Theorem 17 Main Algorithm

Varying cost of punishment Example

Future Work  Studying security games variations in audit games  Budget-constrained defender  Combinatorial constraints on use of defender resources  Varying punishment with violation severity  Validation:  Simulation: studying effect of various parameters  Real world case study 19 Future Work

Conclusion 20 First model of auditing and first step toward a computationally feasible solution of audit games. Research at the intersection of AI and security & privacy holds lot of promise, given the encouraging precedent set by the deployment of security games algorithms

Extensions 21 Extensions