{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T06:12:30Z","timestamp":1740809550835,"version":"3.38.0"},"reference-count":31,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2025,3,1]]},"DOI":"10.1587\/transinf.2024fcp0010","type":"journal-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T22:11:52Z","timestamp":1724105512000},"page":"239-251","source":"Crossref","is-referenced-by-count":0,"title":["Strategies and Equilibria on Indistinguishability of Winning Objectives and Related Decision Problems"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"Rindo","family":"NAKANISHI","sequence":"first","affiliation":[{"name":"Graduate School of Informatics, Nagoya University"}]},{"given":"Yoshiaki","family":"TAKATA","sequence":"additional","affiliation":[{"name":"School of Informatics, Kochi University of Technology"}]},{"given":"Hiroyuki","family":"SEKI","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Nagoya University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] O. Goldreich, Foundations of Cryptography, Cambridge University Press, 2001.","DOI":"10.1017\/CBO9780511546891"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] L. Sweeney, \u201c<i>k<\/i>-anonymity: A model for protecting privacy,\u201d Int\u2019l Journal on Uncertainty, Fuzziness and Knowledge-based Systems, vol.10, no.5, pp.557-570, 2002. 10.1142\/s0218488502001648","DOI":"10.1142\/S0218488502001648"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] V. Bru\u00e9re, \u201cComputer aided synthesis: a game-theoretic approach,\u201d DLT, pp.3-35, 2017. 10.1007\/978-3-319-62809-7_1","DOI":"10.1007\/978-3-319-62809-7_1"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[5] A. Pnueli and R. Rosner, \u201cOn the synthesis of a reactive module,\u201d ACM POPL, pp.179-190, 1989. 10.1145\/75277.75293","DOI":"10.1145\/75277.75293"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[6] D. Fisman, O. Kupferman, and Y. Lustig, \u201cRational synthesis,\u201d TACAS, pp.190-204, 2010. 10.1007\/978-3-642-12002-2_16","DOI":"10.1007\/978-3-642-12002-2_16"},{"key":"6","unstructured":"[7] S. Almagor and S. Guendelman, \u201cConcurrent games with multiple topologies,\u201d arXiv: 2207.02596."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[8] R. Berthon, B. Maubert, A. Murano, S. Rubin, and M.Y. Vardi, \u201cStrategy logic with imperfect information,\u201d ACM Trans. Computational Logic, vol.22, no.1, pp.1-51, 2021. 10.1145\/3427955","DOI":"10.1145\/3427955"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[9] P. Bouyer, N. Markey, and S. Vester, \u201cNash equilibria in symmetric graph games with partial observation,\u201d Information and Computation, vol.254, pp.238-258, 2017. 10.1016\/j.ic.2016.10.010","DOI":"10.1016\/j.ic.2016.10.010"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[10] K. Chatterjee and L. Doyen, \u201cThe complexity of partial-observation parity games,\u201d LPAR, LNTCS, vol.6397, pp.1-14, 2010. 10.1007\/978-3-642-16242-8_1","DOI":"10.1007\/978-3-642-16242-8_1"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[11] K. Chatterjee and L. Doyen, \u201cGames with a weak adversary,\u201d ICALP, LNTCS, vol.8573, pp.110-121, 2014. 10.1007\/978-3-662-43951-7_10","DOI":"10.1007\/978-3-662-43951-7_10"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[12] P. Samarati, \u201cProtecting respondents\u2019 identities in microdata release,\u201d IEEE Trans. Knowl. Data Eng., vol.13, no.6, pp.1010-1027, 2001. 10.1109\/69.971193","DOI":"10.1109\/69.971193"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[13] J.-W. Byun, A. Kamra, E. Bertino, and N. Li, \u201cEfficient <i>k<\/i>-anonymization using clustering techniques,\u201d DASFAA, LNISA, vol.4443, pp.188-200, 2007. 10.1007\/978-3-540-71703-4_18","DOI":"10.1007\/978-3-540-71703-4_18"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] R.J. Bayardo and R. Agrawal, \u201cData privacy through optimal <i>k<\/i>-anonymization,\u201d ICDE, pp.217-228, 2005. 10.1109\/icde.2005.42","DOI":"10.1109\/ICDE.2005.42"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[15] A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam, \u201c\u2113-diversity: Privacy beyond <i>k<\/i>-anonymity,\u201d ICDE, vol.24, 2006. also in TKDD, vol.1, no.1, March 2007. 10.1109\/icde.2006.1","DOI":"10.1109\/ICDE.2006.1"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[16] N. Li, T. Li, and S. Venkatasubramanian, \u201c<i>t<\/i>-closeness: Privacy beyond <i>k<\/i>-anonymity and \u2113-diversity,\u201d ICDE, pp.106-115, 2007. 10.1109\/icde.2007.367856","DOI":"10.1109\/ICDE.2007.367856"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[17] C. Dwork, F.D. McSherry, K. Nissim, and A. Smith, \u201cCalibrating noise to sensitivity in private data analysis,\u201d IEEE Trans. Cloud Comput., pp.265-284, 2006. 10.1007\/11681878_14","DOI":"10.1007\/11681878_14"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[18] C. Dwork, \u201cDifferential privacy,\u201d ICALP, pp.1-12, 2006. 10.1007\/11787006_1","DOI":"10.1007\/11787006_1"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[20] C. Dwork and A. Roth, \u201cThe algorithmic foundations of differential privacy,\u201d Foundations and Trends in Theoretical Computer Science, vol.9, no.3-4, pp.211-407, 2013. now Publishers. 10.1561\/0400000042","DOI":"10.1561\/0400000042"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[21] R. Shokri, M. Stronati, C. Song, and V. Shmatikov, \u201cMembership inference attacks against machine learning models,\u201d IEEE Symp. Security and Privacy, 2017. 10.1109\/sp.2017.41","DOI":"10.1109\/SP.2017.41"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[22] B.C.M. Fung, K. Wang, R. Chen, and P.S. Yu, \u201cPrivacy-preserving data publishing: A survey of recent developments,\u201d ACM Computing Surveys, vol.42, no.4, pp.14:1-14:53, June 2010. 10.1145\/1749603.1749605","DOI":"10.1145\/1749603.1749605"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[23] M.E. Andr\u00e9s, N.E. Bordenabe, K. Chatzikokolakis, and C. Palamidessi, \u201cGeo-indistinguishability: Differential privacy for location based systems,\u201d ACM CCS, pp.901-914, 2013. 10.1145\/2508859.2516735","DOI":"10.1145\/2508859.2516735"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[24] M. Abadi, A. Chu, I. Goodfellow, H.B. McMahan, I. Moronov, K. Talwar, and L. Zhang, \u201cDeep learning with differential privacy,\u201d ACM CCS, pp.308-318, 2016. 10.1145\/2976749.2978318","DOI":"10.1145\/2976749.2978318"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[25] R. Shokri and V. Shmatikov, \u201cPrivacy-preserving deep learning,\u201d ACM CCS, pp.1310-1321, 2015. 10.1145\/2810103.2813687","DOI":"10.1145\/2810103.2813687"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[26] K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, \u201cAnonymity protocols as noisy channels,\u201d Information and Computation, vol.206, no.2-4, pp.378-401, 2008. 10.1016\/j.ic.2007.07.003","DOI":"10.1016\/j.ic.2007.07.003"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[27] G. Smith, \u201cOn the foundations of quantitative information flow,\u201d FoSSaCS, pp.288-302, 2009. 10.1007\/978-3-642-00596-1_21","DOI":"10.1007\/978-3-642-00596-1_21"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[28] D. Clark, S. Hunt, and P. Malacaria, \u201cA static analysis for quantifying information flow in a simple imperative language,\u201d J. Computer Security, vol.15, no.3, pp.321-371, 2007. 10.3233\/jcs-2007-15302","DOI":"10.3233\/JCS-2007-15302"},{"key":"27","unstructured":"[29] O. Kupferman and O. Leshkowitz, \u201cSynthesis of privacy-preserving systems,\u201d FSTCS, LIPIcs, vol.250, pp.42:1-42:23, 2022. 10.4230\/LIPIcs.FSTTCS.2022.42"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[30] R. Nakanishi, Y. Takata, and H. Seki, \u201cA game theoretic approach to indistinguishability of winning objectives as user privacy,\u201d International Colloquium on Theoretical Aspects of Computing, LNCS, vol.14446, pp.36-54, 2023. 10.1007\/978-3-031-47963-2_4","DOI":"10.1007\/978-3-031-47963-2_4"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[31] M. Ummels, \u201cThe complexity of nash equilibria in infinite multiplayer games,\u201d FOSSACS, LNTCS, vol.4962, pp.20-34, 2008. 10.1007\/978-3-540-78499-9_3","DOI":"10.1007\/978-3-540-78499-9_3"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[32] M. Ummels and D. Wojtczak, \u201cThe complexity of nash equilibria in stochastic multiplayer games,\u201d Logical Methods in Computer Science, vol.7, no.3, 2011. 10.2168\/lmcs-7(3:20)2011","DOI":"10.2168\/LMCS-7(3:20)2011"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[33] K. Chatterjee, L. de Alfaro, and T.A. Henzinger, \u201cThe complexity of stochastic Rabin and Streett games,\u201d ICALP, LNTCS, vol.3580, pp.878-890, 2005. 10.1007\/11523468_71","DOI":"10.1007\/11523468_71"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCP0010\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:33:58Z","timestamp":1740800038000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCP0010\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024fcp0010","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"article-number":"2024FCP0010"}}