{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:04:13Z","timestamp":1743127453226,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031479625"},{"type":"electronic","value":"9783031479632"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-47963-2_4","type":"book-chapter","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T21:41:26Z","timestamp":1700689286000},"page":"36-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Game-Theoretic Approach to\u00a0Indistinguishability of\u00a0Winning Objectives as\u00a0User Privacy"],"prefix":"10.1007","author":[{"given":"Rindo","family":"Nakanishi","sequence":"first","affiliation":[]},{"given":"Yoshiaki","family":"Takata","sequence":"additional","affiliation":[]},{"given":"Hiroyuki","family":"Seki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,23]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., et al.: Deep learning with differential privacy. In: ACM CCS (2016)","DOI":"10.1145\/2976749.2978318"},{"key":"4_CR2","unstructured":"Almagor, S., Guendelman, S.: Concurrent games with multiple topologies. arXiv:2207.02596"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Andr\u00e9s, M.E., Bordenabe, N.E., Chatzikokolakis, K., Palamidessi, C.: Geo-indistinguishability: differential privacy for location based systems. In: ACM CCS (2013)","DOI":"10.1145\/2508859.2516735"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R.: Data privacy through optimal $$k$$-anonymization. In: ICDE, pp. 217\u2013228 (2005)","DOI":"10.1109\/ICDE.2005.42"},{"issue":"1","key":"4_CR5","first-page":"1","volume":"22","author":"R Berthon","year":"2021","unstructured":"Berthon, R., Maubert, B., Murano, A., Rubin, S., Vardi, M.Y.: Strategy logic with imperfect information. ACM Trans. Comput. Logic 22(1), 1\u201351 (2021)","journal-title":"ACM Trans. Comput. Logic"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/978-3-319-10575-8_27","volume-title":"Handbook of Model Checking","author":"R Bloem","year":"2018","unstructured":"Bloem, R., Chatterjee, K., Jobstmann, B.: Graph games and reactive synthesis. In: Clarke, E., Henzinger, T., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 921\u2013962. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_27"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ic.2016.10.010","volume":"254","author":"P Bouyer","year":"2017","unstructured":"Bouyer, P., Markey, N., Vester, S.: Nash equilibria in symmetric graph games with partial observation. Inf. Comput. 254, 238\u2013258 (2017)","journal-title":"Inf. Comput."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-62809-7_1","volume-title":"Developments in Language Theory","author":"V Bruy\u00e8re","year":"2017","unstructured":"Bruy\u00e8re, V.: Computer aided synthesis: a game-theoretic approach. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 3\u201335. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62809-7_1"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-71703-4_18","volume-title":"Advances in Databases: Concepts, Systems and Applications","author":"J-W Byun","year":"2007","unstructured":"Byun, J.-W., Kamra, A., Bertino, E., Li, N.: Efficient k-anonymization using clustering techniques. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 188\u2013200. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71703-4_18"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1007\/11523468_71","volume-title":"Automata, Languages and Programming","author":"K Chatterjee","year":"2005","unstructured":"Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The complexity of stochastic Rabin and Streett games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 878\u2013890. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_71"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-16242-8_1","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L.: The complexity of partial-observation parity games. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 1\u201314. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16242-8_1"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-662-43951-7_10","volume-title":"Automata, Languages, and Programming","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Doyen, L.: Games with a weak adversary. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 110\u2013121. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_10"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.ic.2016.10.012","volume":"254","author":"K Chatterjee","year":"2017","unstructured":"Chatterjee, K., Doyen, L., Filiot, E., Raskin, J.-F.: Doomsday equilibria for omega-regular games. Inf. Comput. 254, 296\u2013315 (2017)","journal-title":"Inf. Comput."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2006.07.032","volume":"365","author":"K Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzi\u0144ski, M.: Games with secure equilibria. Theor. Comput. Sci. 365, 67\u201382 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20134","key":"4_CR15","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.ic.2007.07.003","volume":"206","author":"K Chatzikokolakis","year":"2008","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy channels. Inf. Comput. 206(2\u20134), 378\u2013401 (2008)","journal-title":"Inf. Comput."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.3233\/JCS-2007-15302","volume":"15","author":"D Clark","year":"2007","unstructured":"Clark, D., Hunt, S., Malacaria, P.: A static analysis for quantifying information flow in a simple imperative language. J. Comput. Secur. 15, 321\u2013371 (2007)","journal-title":"J. Comput. Secur."},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","volume-title":"Theory and Applications of Models of Computation","author":"C Dwork","year":"2008","unstructured":"Dwork, C.: Differential privacy: a survey of results. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 1\u201319. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79228-4_1"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2013","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9, 3\u20134 (2013)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-12002-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Fisman","year":"2010","unstructured":"Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 190\u2013204. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_16"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Fung, B.C.M., Wang, K., Chen, R., Yu, P.S.: Privacy-preserving data publishing: a survey of recent developments. ACM Comput. Surv. 42(4), 14:1\u201314:53 (2010)","DOI":"10.1145\/1749603.1749605"},{"key":"4_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography, volume I: Basic Tools","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography, volume I: Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"4_CR24","unstructured":"Kupferman, O., Leshkowitz, O.: Synthesis of privacy-preserving systems. In: FSTCS, pp. 42:1\u201321 (2022)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., Venkatasubramanian, S.: $$t$$-closeness: privacy beyond $$k$$-anonymity and $${\\ell }$$-diversity. In: ICDE, pp. 106\u2013115 (2007)","DOI":"10.1109\/ICDE.2007.367856"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D.: $${\\ell }$$-diversity: privacy beyond $$k$$-anonymity. In: ICDE, vol. 24 (2006). also in TKDD 1(1) (2007)","DOI":"10.1145\/1217299.1217302"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: ACM POPL, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"issue":"6","key":"4_CR28","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P Samarati","year":"2001","unstructured":"Samarati, P.: Protecting respondents\u2019 identities in microdata release. IEEE Trans. Knowl. Data Eng. 13(6), 1010\u20131027 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Shokri, R., Shmatikov, V.: Privacy-preserving deep learning. In: ACM CCS (2015)","DOI":"10.1145\/2810103.2813687"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Shokri, R., Stronati, M., Song, C., Shmatikov, V.: Membership inference attacks against machine learning models. In: IEEE Symposium Security and Privacy (2017)","DOI":"10.1109\/SP.2017.41"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-00596-1_21","volume-title":"Foundations of Software Science and Computational Structures","author":"G Smith","year":"2009","unstructured":"Smith, G.: On the foundations of quantitative information flow. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 288\u2013302. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00596-1_21"},{"issue":"5","key":"4_CR32","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: $$k$$-anonymity: a model for protecting privacy. Int. J. Uncertainty Fuzziness Knowl.-Based Syst. 10(5), 557\u2013570 (2002)","journal-title":"Int. J. Uncertainty Fuzziness Knowl.-Based Syst."},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-78499-9_3","volume-title":"Foundations of Software Science and Computational Structures","author":"M Ummels","year":"2008","unstructured":"Ummels, M.: The complexity of Nash equilibria in infinite multiplayer games. In: Amadio, R. (ed.) FoSSaCS 2008. LNCS, vol. 4962, pp. 20\u201334. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78499-9_3"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Ummels, M., Wojtczak, D.: The complexity of Nash equilibria in stochastic multiplayer games. Logical Methods Comput. Sci. 7(3) (2011)","DOI":"10.2168\/LMCS-7(3:20)2011"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47963-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T19:48:08Z","timestamp":1730576888000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47963-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031479625","9783031479632"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47963-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2023.compsust.utec.edu.pe\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}