On the Tradeoff between Trust and Privacy in Wireless Ad Hoc Networks Maxim …...…. Raya Reza …….…. Shokri Jean-Pierre..Hubaux LCA1, EPFL, Switzerland The.

Slides:



Advertisements
Similar presentations
Protecting Location Privacy: Optimal Strategy against Localization Attacks Reza Shokri, George Theodorakopoulos, Carmela Troncoso, Jean-Pierre Hubaux,
Advertisements

© 2007 Levente Buttyán and Jean-Pierre Hubaux Security and Cooperation in Wireless Networks Chapter 12: Secure protocols for.
EPFL, Lausanne, Switzerland Márk Félegyházi Equilibrium Analysis of Packet Forwarding Strategies in Wireless Ad Hoc Networks – the Static Case Márk Félegyházi.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Self-Organized Anonymous Authentication in Mobile Ad Hoc Networks Julien Freudiger, Maxim Raya and Jean-Pierre Hubaux SECURECOMM, 2009.
Network of Excellence in Internet Science Network of Excellence in Internet Science (EINS) 3 rd Plenary Meeting Munich, November 2013 FP7-ICT
1 Privacy Prof. Ravi Sandhu Executive Director and Endowed Chair March 8, © Ravi Sandhu World-Leading Research.
DARWIN: Distributed and Adaptive Reputation Mechanism for Wireless Ad- hoc Networks CHEN Xiao Wei, Cheung Siu Ming CSE, CUHK May 15, 2008 This talk is.
 Introduction  Benefits of VANET  Different types of attacks and threats  Requirements and challenges  Security Architecture  Vehicular PKI.
Game Theory-Based Network Selection: Solutions and Challenges Speaker: Kai-Wei Ping Advisor: Prof Dr. Ho-Ting Wu 2013/05/20 1.
Appendix B: A tutorial on game theory for wireless networks
4 Why Should we Believe Politicians? Lupia and McCubbins – The Democratic Dilemma GV917.
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
Using Game Theoretic Approach to Analyze Security Issues In Ad Hoc Networks Term Presentation Name: Li Xiaoqi, Gigi Supervisor: Michael R. Lyu Department:
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
On Data-Centric Trust Establishment in Ephemeral Ad Hoc Networks Maxim Raya, Panos Papadimitratos, Virgil D. Gligor, Jean-Pierre Hubaux INFOCOM 2008.
Game-Theoretic Approaches to Multi-Agent Systems Bernhard Nebel.
Gabriel Tsang Supervisor: Jian Yang.  Initial Problem  Related Work  Approach  Outcome  Conclusion  Future Work 2.
19 - Subgame perfect equilibrium: matchmaking and strategic investments.
Harsanyi transformation Players have private information Each possibility is called a type. Nature chooses a type for each player. Probability distribution.
Bottleneck Routing Games in Communication Networks Ron Banner and Ariel Orda Department of Electrical Engineering Technion- Israel Institute of Technology.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
Pricing What Can Pricing Do In Wireless Networks? Jianning Mai and Lihua Yuan
© 2007 Levente Buttyán and Jean-Pierre Hubaux Security and Cooperation in Wireless Networks Chapter 3: Trust assumptions and.
SECOND PART: Algorithmic Mechanism Design. Mechanism Design MD is a subfield of economic theory It has a engineering perspective Designs economic mechanisms.
Dynamic Network Security Deployment under Partial Information George Theodorakopoulos (EPFL) John S. Baras (UMD) Jean-Yves Le Boudec (EPFL) September 24,
Long Term Evolution and Femtocells Mini-Project Security and Cooperation in Wireless Networks | EPFL January 19, 2010 By Igor Bilogrevic, LCA1 Supervisor:
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Performance Analysis of Reputation-based Mechanisms for Multi-hop Wireless Networks Fabio Milan Dipartimento di Elettronica Politecnico di Torino Turin,
A Game-Theoretic Look at Joint Multi-Access, Power and Rate Control Yalin Evren Sagduyu, Anthony Ephremides Objective and Motivation * Objective: Analyze.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Security Games in Online Advertising: Can Ads Help Secure the Web? Nevena Vratonjic Maxim Raya Jean-Pierre Hubaux June 2010, WEIS’10 David C. Parkes.
Budhaditya Pyne BEE-IV Roll No: Jadavpur University.
Game Theory and Privacy Preservation in Recommendation Systems Iordanis Koutsopoulos U of Thessaly Thalis project CROWN Kick-off Meeting Volos, May 11,
By: Gang Zhou Computer Science Department University of Virginia 1 A Game-Theoretic Framework for Congestion Control in General Topology Networks SYS793.
Revocation Games in Ephemeral Networks Maxim Raya, Mohammad Hossein Manshaei, Márk Félegyházi, Jean-Pierre Hubaux CCS 2008.
Social Group Utility Maximization Game with Applications in Mobile Social Networks Xiaowen Gong, Xu Chen, Junshan Zhang Arizona State University Allerton.
EC941 - Game Theory Prof. Francesco Squintani Lecture 5 1.
© 2007 Levente Buttyán and Jean-Pierre Hubaux Security and Cooperation in Wireless Networks Chapter 3: Trust assumptions and.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
A Game-Theoretic Model for Defending Against Malicious Users in RecDroid Bahman Rashidi December 5 th, 2014.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Tuomas Raivio and Raimo P. Hämäläinen Systems Analysis Laboratory Helsinki.
Regret Minimizing Equilibria of Games with Strict Type Uncertainty Stony Brook Conference on Game Theory Nathanaël Hyafil and Craig Boutilier Department.
A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti.
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Janne Karelahti, Tuomas Raivio, and Raimo P. Hämäläinen Systems Analysis.
Non-Cooperative Multi-Radio Channel Allocation in Wireless Networks Márk Félegyházi*, Mario Čagalj†, Shirin Saeedi Bidokhti*, Jean-Pierre Hubaux* * Ecole.
1 Epidemic Data Survivability in UWSNs
GameSec 2010 November 22, Berlin Mathias Humbert, Mohammad Hossein Manshaei, Julien Freudiger and Jean-Pierre Hubaux EPFL - Laboratory for Computer communications.
ECO290E: Game Theory Lecture 13 Dynamic Games of Incomplete Information.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
Algorithmic, Game-theoretic and Logical Foundations
Part 3 Linear Programming
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
15-1 Economics: Theory Through Applications This work is licensed under the Creative Commons Attribution-Noncommercial-Share Alike 3.0 Unported.
Non-Cooperative Behavior in Wireless Networks Márk Félegyházi (EPFL) PhD. public defense July 9, 2007.
1 Multi-radio Channel Allocation in Competitive Wireless Networks Mark Felegyhazi, Mario Čagalj, Jean-Pierre Hubaux EPFL, Switzerland IBC’06, Lisbon, Portugal.
Intermediate Microeconomics Game Theory. So far we have only studied situations that were not “strategic”. The optimal behavior of any given individual.
Trust Signaling Maroš Servátka (University of Canterbury, NZ) Steven Tucker (University of Canterbury, NZ) Radovan Vadovič (ITAM, Mexico) June 2007 ESA,
Eunyoung Chang 1 CS 6204 Mobile Computing.  Problem  Proposed Approaches  COMMIT Approaches  THE SYSTEM MODEL  The COMMIT Protocol  Protocol Analysis.
Econ 545, Spring 2016 Industrial Organization Dynamic Games.
SYNERGY: A Game-Theoretical Approach for Cooperative Key Generation in Wireless Networks Jingchao Sun, Xu Chen, Jinxue Zhang, Yanchao Zhang, and Junshan.
Contents of the Talk Preliminary Materials Motivation and Contribution
Presented by Edith Ngai MPhil Term 3 Presentation
Intermediate Microeconomics
How to think about strategic games
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 2 Bayesian Games Zhu Han, Dusit Niyato, Walid Saad, Tamer.
EASTERN MEDITERRANEAN UNIVERSITY DEPARTMENT OF INDUSTRIAL ENGINEERING IENG314 OPERATIONS RESEARCH II SAMIR SAMEER ABUYOUSSEF
Blockchain Mining Games
Presentation transcript:

On the Tradeoff between Trust and Privacy in Wireless Ad Hoc Networks Maxim …...…. Raya Reza …….…. Shokri Jean-Pierre..Hubaux LCA1, EPFL, Switzerland The Third ACM Conference on Wireless Network Security (WiSec‘10) March 2010 Hoboken, NJ, USA

The Trust-Privacy Tradeoff Entity-centric trust Trust is built in each entity The cost is reduced privacy Data-centric trust Trust is built in the data Entities can keep privacy 2 privacy security privacy

The Dilemma of Data-Centric Trust Data increasingly comes from multiple sources Mobile devices reflect their users’ preferences and hence characterize them 3 Ephemeral network Users are not fully hidden behind their data! More contributions = More accurate trust

The Privacy-Preserving Gene Building data-centric trust is a collective effort Users might lose some of their privacy What if entities are privacy-preserving? A privacy-preserving entity maximizes its privacy Game theory: A selfish entity optimizes its utility Privacy-preservation = Selfishness 4 How to build data-centric trust in ephemeral networks with privacy-preserving entities?

Example: VANET CA pre-establishes credentials offline Entities communicate attributes (e.g., credentials, location) Communication is sequential There are deadlines on making decisions Benign entities disseminate truthful info Adversaries disseminate false info 5

Trust-Privacy Games Problem: privacy-preserving entities building data-centric trust in the presence of privacy-preserving attackers Game theory can help by modeling situations where the decisions of players affect each other Attacker-Defender Game G AD Trust Contribution Game G TC Similar to eBay auctions: privacy = money. But, privacy cannot be «reimbursed» 6

7 AD Minimum required trust threshold Start Deadline Time …… A D

8 AD Start Deadline Time …… A D Winner

9 AD Start Deadline Time Attacker-Defender Game: captures at the macroscopic level the competition between attackers and defenders to support their respective versions of the truth

10 AD Start Deadline Time Trust Contribution Game: defines at the microscopic level the individual amounts of privacy to be contributed by entities in each side to collectively win G AD

Attacker-Defender Game 11 Access to channel is probabilistic Theorem: The strategy (W,W) is the Perfect Bayesian Equilibrium of G AD Players – Attackers – Defenders Strategies – Wait (W) – Send (S) Start Deadline

Trust Contribution Game 12 Theorem: The Subgame Perfect Equilibrium of G TC is defined by: Theorem: The Subgame Perfect Equilibrium of G TC is defined by: No entity contributes!

Game with Incentives 13 reward for playing early Start Deadline Theorem: The equilibrium of is defined by: K: # of users Theorem: The equilibrium of is defined by: K: # of users Corollary: The strategy (S,S) can be enforced in G AD by choosing appropriate reward r. I Incentives help

Conclusion Data-centric trust can reduce privacy losses compared to entity-centric trust Privacy-preserving entities are selfish by definition and need a game-theoretic analysis Without incentives, privacy-preserving entities do not contribute to trust establishment 14