A game-theoretic approach to indistinguishability of winning objectives as user privacy
Abstract: Game theory on graphs is a basic tool in computer science. In this paper, we propose a new game-theoretic framework for studying the privacy protection of a user who interactively uses a software service. Our framework is based on the idea that an objective of a user using software services should not be known to an adversary because the objective is often closely related to personal information of the user. We propose two new notions, O-indistinguishable strategy (O-IS) and objective-indistinguishability equilibrium (OIE). For a given game and a subset O of winning objectives (or objectives in short), a strategy of a player is O-indistinguishable if an adversary cannot shrink O by excluding any objective from O as an impossible objective. A strategy profile, which is a tuple of strategies of all players, is an OIE if the profile is locally maximal in the sense that no player can expand her set of objectives indistinguishable from her real objective from the viewpoint of an adversary. We show that for a given multiplayer game with Muller objectives, both of the existence of an O-IS and that of OIE are decidable.
- Deep learning with differential privacy. ACM CCS, 2016.
- S. Almagor and S. Guendelman. Concurrent games with multiple topologies. arXiv: 2207.02596.
- Geo-indistinguishability: Differential privacy for location based systems. ACM CCS, 2013.
- R. J. Bayardo and R. Agrawal. Data privacy through optimal k𝑘kitalic_k-anonymization. ICDE, pages 217–228, 2005.
- Strategy logic with imperfect information. ACM Trans. Computational Logic, 22(1):1–51, 2021.
- Graph games and reactive synthesis. In E. M. Clarke et al., editor, Handbook of Model Checking, chapter 27, pages 921–962. Springer, 2018.
- Nash equilibria in symmetric graph games with partial observation. Information and Computation, 254:238–258, 2017.
- V. Bruére. Computer aided synthesis: a game-theoretic approach. DLT, pages 3–35, 2017.
- Efficient k𝑘kitalic_k-anonymization using clustering techniques. DASFAA, pages 188–200, 2007.
- The complexity of stochastic rabin and streett games. ICALP, 2005.
- K. Chatterjee and L. Doyen. The complexity of partial-observation parity games. LPAR, pages 1–14, 2010.
- K. Chatterjee and L. Doyen. Games with a weak adversary. ICALP, pages 110–121, 2014.
- Doomsday equilibria for omega-regular games. Information and Computation, 254:296–315, 2017.
- Games with secure equilibria. Theoretical Computer Science, 365:67–82, 2006.
- Anonymity protocols as noisy channels. Information and Computation, 206(2-4):378–401, 2008.
- A static analysis for quantifying information flow in a simple imperative language. J. Computer Security, 15:321–371, 2007.
- C. Dwork. Differential privacy. ICALP, pages 1–12, 2006.
- C. Dwork. Differential privacy: A survey of results. TAMC, pages 1–19, 2008.
- Calibrating noise to sensitivity in private data analysis. TCC, pages 265–284, 2006.
- C. Dwork and A. Roth. The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science, 9:3–4, 2013. now Publishers.
- Rational synthesis. TACAS, pages 190–204, 2010.
- Privacy-preserving data publishing: A survey of recent developments. ACM Computing Surveys, 42(4):14:1–14:53, June 2010.
- O. Goldreich. Foundations of Cryptography, volume I Basic Tools. Cambridge University Press, 2001.
- O. Kupferman and O. Leshkowitz. Synthesis of privacy-preserving systems. FSTCS, 42:1–21, 2022.
- t𝑡titalic_t-closeness: Privacy beyond k𝑘kitalic_k-anonymity and ℓℓ{\ell}roman_ℓ-diversity. ICDE, pages 106–115, 2007.
- ℓℓ{\ell}roman_ℓ-diversity: Privacy beyond k𝑘kitalic_k-anonymity. ICDE, 24, 2006. also in TKDD, 1(1), Mar 2007.
- A. Pnueli and R. Rosner. On the synthesis of a reactive module. ACM POPL, pages 179–190, 1989.
- P. Samarati. Protecting respondents’ identities in microdata release. IEEE Trans. Knowledge and Data Engineering, 13(6):1010–1027, 2001.
- R. Shokri and V. Shmatikov. Privacy-preserving deep learning. ACM CCS, 2015.
- Membership inference attacks against machine learning models. IEEE Symp. Security and Privacy, 2017.
- G. Smith. On the foundations of quantitative information flow. FoSSaCS, pages 288–302, 2009.
- L. Sweeney. k𝑘kitalic_k-anonymity: A model for protecting privacy. Int’l Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):557–570, 2002.
- M. Ummels. The complexity of nash equilibria in infinite multiplayer games. FOSSACS, pages 20–34, 2008.
- M. Ummels and D. Wojtczak. The complexity of nash equilibria in stochastic multiplayer games. Logical Methods in Computer Science, 7(3), 2011.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.