In general, privacy game can be defined as individual and/or cooperative behaviors between the user and the adversary (attacker) that choose a certain defense/attack strategy/action to maximize their self-interest.
Nature selects a data (i.e., user secret that contains privacy information) for the user, where the data are selected according to a probability distribution function.
Given the chosen data, the user runs a protection mechanism to generate a disguised data...
- Acquisti A, Dingledine R, Syverson P (2003) On the economics of anonymity. In: Proceedings of the Financial Cryptography (FC), Lecture Notes in Computer Science, Springer, vol 2742. pp 84–102Google Scholar
- Freudiger J, Manshaei MH, Hubaux J-P, Parkes DC (2009) On non-cooperative location privacy: a game-theoretic analysis. In: Proceedings of the ACM conference on computer and communications security (CCS), ACM, pp 324–337Google Scholar
- Nisan N (ed) (2007) Introduction to mechanism design (for computer scientists). In: Proceedings of the algorithmic game theory. Cambridge University Press, Cambridge, UK, pp 209–242Google Scholar
- Nisan N, Ronen A (1999) Algorithmic mechanism design. In: Proceedings of the 31 annual ACM symposium on theory of computing, ACM, pp 129–140Google Scholar
- Raya M, Shokri R, Hubaux J-P (2010) On the tradeoff between trust and privacy in wireless ad hoc networks. In: Proceedings of the ACM conference on wireless network security (WiSec), ACM, pp 75–80Google Scholar
- Shokri R, Theodorakopoulos G, Troncoso C, Hubaux JP, Le Boudec JY (2012) Protecting location privacy: optimal strategy against localization attacks. In: Proceedings of the ACM conference on computer and communications security (CCS), ACM, pp 617–627Google Scholar
- Zhang N, Yu W, Fu X, Das SK (2010) gPath: a game-theoretic path selection algorithm to protect Tor’s anonymity. In: Proceedings of the 1st conference on decision and game theory for security (GameSec), Lecture Notes in Computer Science, Springer, vol 6442. pp 58–72Google Scholar