Game Theoretic Model of Censorship Resistance Andrei Serjantov University of Cambridge Computer Laboratory.

Slides:



Advertisements
Similar presentations
1 A Graph-Theoretic Network Security Game M. Mavronicolas , V. Papadopoulou , A. Philippou  and P. Spirakis § University of Cyprus, Cyprus  University.
Advertisements

9 x9 81 4/12/2015 Know Your Facts!. 9 x2 18 4/12/2015 Know Your Facts!
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Definition of the Anonymity of Mix Network Runs Andrei Serjantov University of Cambridge Computer Laboratory.
1 x0 0 4/15/2015 Know Your Facts!. 9 x1 9 4/15/2015 Know Your Facts!
1 x0 0 4/16/2015 Know Your Facts!. 1 x8 8 4/16/2015 Know Your Facts!
3 x0 0 7/18/2015 Know Your Facts!. 4 x3 12 7/18/2015 Know Your Facts!
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.
LAUREN FRATAMICO Common knowledge of rationality and backward induction.
Nash equilibria in Electricity Markets: A comparison of different approaches Seminar in Electric Power Networks, 12/5/12 Magdalena Klemun Master Student,
Playing Games for Security: An Efficient Exact Algorithm for Solving Bayesian Stackelberg Games Praveen Paruchuri, Jonathan P. Pearce, Sarit Kraus Catherine.
Economics 202: Intermediate Microeconomic Theory 1.HW #6 on website. Due Tuesday. 2.Second test covers up through today’s material, and will be “pseudo-cumulative”
Benjamin Johnson Carnegie Mellon University Are Security Experts Useful? Bayesian Nash Equilibria for Network Security Games with Limited Information TRUST.
Using Game Theoretic Approach to Analyze Security Issues In Ad Hoc Networks Term Presentation Name: Li Xiaoqi, Gigi Supervisor: Michael R. Lyu Department:
Network Security An Economics Perspective IS250 Spring 2010 John Chuang.
Non-cooperative Game Theory Notes by Alberto Bressan.
Differential Game Theory Notes by Alberto Bressan.
Distributed Computing Group On the Impact of Malicious Players in Distributed Systems Stefan Schmid DYNAMO’07: 1st Workshop on Dynamic Networks (Salerno,
6.1 Consider a simultaneous game in which player A chooses one of two actions (Up or Down), and B chooses one of two actions (Left or Right). The game.
Dynamic Network Security Deployment under Partial Information George Theodorakopoulos (EPFL) John S. Baras (UMD) Jean-Yves Le Boudec (EPFL) September 24,
Nash Equilibria in Competitive Societies Eyal Rozenberg Roy Fox.
Algorithms and Economics of Networks Abraham Flaxman and Vahab Mirrokni, Microsoft Research.
Game Theoretic Analysis of Oligopoly lr L R 0000 L R 1 22 The Lane Selection Game Rational Play is indicated by the black arrows.
Real Security Threats Ross Anderson Cambridge. Peer-to-peer networks (1) Early P2P proposals included the ‘Eternity Service’ (1996) – a widely distributed.
1. problem set 6 from Osborne’s Introd. To G.T. p.210 Ex p.234 Ex p.337 Ex. 26,27 from Binmore’s Fun and Games.
ITE 370. Deployment Deployment is the process used to distribute a finished application (or component) to be installed on other computers.
Raga Gopalakrishnan University of Colorado at Boulder Sean D. Nixon (University of Vermont) Jason R. Marden (University of Colorado at Boulder) Stable.
Strategic Modeling of Information Sharing among Data Privacy Attackers Quang Duong, Kristen LeFevre, and Michael Wellman University of Michigan Presented.
1 On the Windfall of Friendship: Inoculation Strategies on Social Networks Dominic Meier Yvonne Anne Oswald Stefan Schmid Roger Wattenhofer.
Games People Play. 4. Mixed strategies In this section we shall learn How to not lose a game when it appears your opponent has a counter to all your moves.
The Power of the Defender M. Gelastou  M. Mavronicolas  V. Papadopoulou  A. Philippou  P. Spirakis §  University of Cyprus, Cyprus § University of.
Presenter: Jen Hua Chi Adviser: Yeong Sung Lin Network Games with Many Attackers and Defenders.
computer
4 x1 4 10/18/2015 Know Your Facts!. 5 x /18/2015 Know Your Facts!
3 x0 0 10/18/2015 Know Your Facts!. 11 x /18/2015 Know Your Facts!
Game theory & Linear Programming Steve Gu Mar 28, 2008.
National Science Foundation Directorate for Computer & Information Science & Engineering (CISE) Trustworthy Computing and Transition to Practice Secure.
1 The Price of Defense M. Mavronicolas , V. Papadopoulou , L. Michael ¥, A. Philippou , P. Spirakis § University of Cyprus, Cyprus  University of Patras.
A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti.
Modeling Reasoning in Strategic Situations Avi Pfeffer MURI Review Monday, December 17 th, 2007.
GameSec 2010 November 22, Berlin Mathias Humbert, Mohammad Hossein Manshaei, Julien Freudiger and Jean-Pierre Hubaux EPFL - Laboratory for Computer communications.
Incentives for Sharing in Peer-to-Peer Networks By Philippe Golle, Kevin Leyton-Brown, Ilya Mironov, Mark Lillibridge.
Vaggelis G. Douros Stavros Toumpis George C. Polyzos Channel Access Competition in Linear Multihop Device-to-Device Networks 1 Nicosia,
Subgames and Credible Threats (with perfect information) Econ 171.
© Cambridge University Press 2012 AREA OF STUDY 2 UNIT 4 MANAGING PEOPLE AND CHANGE THE MANAGEMENT OF CHANGE.
1 Multi-radio Channel Allocation in Competitive Wireless Networks Mark Felegyhazi, Mario Čagalj, Jean-Pierre Hubaux EPFL, Switzerland IBC’06, Lisbon, Portugal.
Mix networks with restricted routes PET 2003 Mix Networks with Restricted Routes George Danezis University of Cambridge Computer Laboratory Privacy Enhancing.
Socially Inspired Computing Engineering with Social Metaphors.
Dynamic games, Stackelburg Cournot and Bertrand
MAIN RESULT: We assume utility exhibits strategic complementarities. We show: Membership in larger k-core implies higher actions in equilibrium Higher.
Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
UNIT 1 ROUTERS Cambridge Technicals. Routers You need to explain the function of a ROUTER in how computers connect to the internet and to networks in.
Extensive Form (Dynamic) Games With Perfect Information (Theory)
Human-Computable Passwords Jeremiah Blocki Manuel Blum Anupam Datta Santosh Vempala.
ПЕЧЕНЬ 9. Закладка печени в период эмбрионального развития.
Yuan Deng Vincent Conitzer Duke University
A Game Theoretic Study of Attack and Defense in Cyber-Physical Systems
Non-additive Security Games
ToNC Workshop Economic Foundations
Christos H. Papadimitriou UC Berkeley
For modeling conflict and cooperation Schwartz/Teneketzis
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 2 Bayesian Games Zhu Han, Dusit Niyato, Walid Saad, Tamer.
© University of Cambridge
Learn Your 2x Facts.
The Internet Today Module 2 Section 2.
Technology Scenarios NGN Assignment1
Non linearity The logistic equation
Presentation transcript:

Game Theoretic Model of Censorship Resistance Andrei Serjantov University of Cambridge Computer Laboratory

Scenario P2P censorship resistant network Traditional model: secure or insecure –Does not explain the fact that holiday photos are not “censored” –Hence, build an economic model: Attacker derives utility from censoring, publisher derives utility from the fact that his document is available The conflict between the publisher and the cesnsor

Model Network of size n Publisher publishes to number of nodes d, at a cost c(d) Attacker attacks x nodes, at a cost c(x) If no copies are available, attacker get U If one or more copies is available, publisher gets U’

Results If attacker’s cost is linear, no Nash Equilibria in pure strategies. If the cost is c(x) = x α, then there are Nash equilibria at d<α Meaning: publisher publishes to some nodes, some nodes get attacked. This challenges the traditional model of insecure