{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:53Z","timestamp":1760202713785,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,29]],"date-time":"2016-08-29T00:00:00Z","timestamp":1472428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,29]]},"DOI":"10.1145\/2970030.2970039","type":"proceedings-article","created":{"date-parts":[[2016,8,31]],"date-time":"2016-08-31T12:32:08Z","timestamp":1472646728000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Expressing Receipt-Freeness and Coercion-Resistance in Logics of Strategic Ability"],"prefix":"10.1145","author":[{"given":"Masoud","family":"Tabatabaei","sequence":"first","affiliation":[{"name":"Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg"}]},{"given":"Wojciech","family":"Jamroga","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Polish Academy of Sciences"}]},{"given":"Peter Y. A.","family":"Ryan","sequence":"additional","affiliation":[{"name":"Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg"}]}],"member":"320","published-online":{"date-parts":[[2016,8,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30079-3_16"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-005-3875-8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796329"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585270"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17619-7_20"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2008.26"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1324249.1324261"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1755-2567.1988.tb00717.x"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195407"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.19.463-487"},{"key":"e_1_3_2_1_11_1","first-page":"691","volume-title":"Proceedings of AAMAS","author":"Boureanu I.","year":"2010","unstructured":"I. Boureanu , M. Cohen , and A. Lomuscio . Model checking detectability of attacks in multiagent systems . In Proceedings of AAMAS , pages 691 -- 698 , 2010 . I. Boureanu, M. Cohen, and A. Lomuscio. Model checking detectability of attacks in multiagent systems. In Proceedings of AAMAS, pages 691--698, 2010."},{"key":"e_1_3_2_1_12_1","first-page":"1141","volume-title":"Proceedings of AAMAS","author":"Boureanu I.","year":"2012","unstructured":"I. Boureanu , A. V. Jones , and A. Lomuscio . Automatic verification of epistemic specifications under convergent equational theories . In Proceedings of AAMAS , pages 1141 -- 1148 , 2012 . I. Boureanu, A. V. Jones, and A. Lomuscio. Automatic verification of epistemic specifications under convergent equational theories. In Proceedings of AAMAS, pages 1141--1148, 2012."},{"key":"e_1_3_2_1_13_1","first-page":"1209","volume-title":"Proceedings of AAMAS","author":"Boureanu I.","year":"2016","unstructured":"I. Boureanu , P. Kouvaros , and A. Lomuscio . Verifying security properties in unbounded multiagent systems . In Proceedings of AAMAS , pages 1209 -- 1217 , 2016 . I. Boureanu, P. Kouvaros, and A. Lomuscio. Verifying security properties in unbounded multiagent systems. In Proceedings of AAMAS, pages 1209--1217, 2016."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11679219_7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2773799.2773923"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-005-9019-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392200.2392207"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11555827_8"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2006.8"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2167913.2167931"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the Workshop Frontiers in Electronic Elections (FEE 2005","author":"Delaune S.","year":"2005","unstructured":"S. Delaune , S. Kremer , and M. D. Ryan . Receipt-freeness: Formal definition and fault attacks . In Proceedings of the Workshop Frontiers in Electronic Elections (FEE 2005 ), Milan, Italy. Citeseer , 2005 . S. Delaune, S. Kremer, and M. D. Ryan. Receipt-freeness: Formal definition and fault attacks. In Proceedings of the Workshop Frontiers in Electronic Elections (FEE 2005), Milan, Italy. Citeseer, 2005."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6364938"},{"key":"e_1_3_2_1_23_1","volume-title":"Handbook of Theoretical Computer Science","author":"Emerson E.","year":"1990","unstructured":"E. Emerson . Temporal and modal logic . In J. van Leeuwen, editor, Handbook of Theoretical Computer Science , volume B, pages 995-- 1072 . Elsevier Science Publishers , 1990 . E. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995--1072. Elsevier Science Publishers, 1990."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1160633.1160666"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.17.423-475"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29963-6_10"},{"issue":"2","key":"e_1_3_2_1_27_1","first-page":"185","article-title":"Agents that know how to play","volume":"63","author":"Jamroga W.","year":"2004","unstructured":"W. Jamroga and W. van der Hoek . Agents that know how to play . Fundamenta Informaticae , 63 ( 2-3 ): 185 -- 219 , 2004 . W. Jamroga and W. van der Hoek. Agents that know how to play. Fundamenta Informaticae, 63(2-3):185--219, 2004.","journal-title":"Fundamenta Informaticae"},{"key":"e_1_3_2_1_28_1","volume-title":"Receipt-freeness as a special case of anonymity in epistemic logic","author":"Jonker H. L.","year":"2006","unstructured":"H. L. Jonker and W. Pieters . Receipt-freeness as a special case of anonymity in epistemic logic . 2006 . H. L. Jonker and W. Pieters. Receipt-freeness as a special case of anonymity in epistemic logic. 2006."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102199.1102213"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/794201.795175"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/876661.876668"},{"key":"e_1_3_2_1_32_1","volume-title":"EEE'04. 2004","author":"Ku W.-C.","year":"2004","unstructured":"W.-C. Ku and C.-M. Ho . An e-voting scheme against bribe and coercion. In e-Technology, e-Commerce and e-Service, 2004 . EEE'04. 2004 IEEE International Conference on, pages 113--116. IEEE , 2004 . W.-C. Ku and C.-M. Ho. An e-voting scheme against bribe and coercion. In e-Technology, e-Commerce and e-Service, 2004. EEE'04. 2004 IEEE International Conference on, pages 113--116. IEEE, 2004."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.13"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2010.16"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24691-6_19"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765361.1765396"},{"issue":"1","key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.3233\/FUN-2008-851-425","article-title":"LDYIS: a framework for model checking security protocols","volume":"85","author":"Lomuscio A.","year":"2008","unstructured":"A. Lomuscio and W. Penczek . LDYIS: a framework for model checking security protocols . Fundamenta Informaticae , 85 ( 1-4 ): 359 -- 375 , 2008 . A. Lomuscio and W. Penczek. LDYIS: a framework for model checking security protocols. Fundamenta Informaticae, 85(1-4):359--375, 2008.","journal-title":"Fundamenta Informaticae"},{"key":"e_1_3_2_1_38_1","first-page":"683","volume-title":"Receipt-freeness in large-scale elections without untappable channels","author":"Magkos E.","year":"2001","unstructured":"E. Magkos , M. Burmester , and V. Chrissikopoulos . Receipt-freeness in large-scale elections without untappable channels . In Towards The E-Society, pages 683 -- 693 . Springer , 2001 . E. Magkos, M. Burmester, and V. Chrissikopoulos. Receipt-freeness in large-scale elections without untappable channels. In Towards The E-Society, pages 683--693. Springer, 2001."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.3923\/itj.2009.934.964"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BFb0034841","volume-title":"Advances in Cryptology-ASIACRYPT'96","author":"Michels M.","year":"1996","unstructured":"M. Michels and P. Horster . Some remarks on a receipt-free and universally verifiable mix-type voting scheme . In Advances in Cryptology-ASIACRYPT'96 , pages 125 -- 132 . Springer , 1996 . M. Michels and P. Horster. Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In Advances in Cryptology-ASIACRYPT'96, pages 125--132. Springer, 1996."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32940-1_15"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2631917"},{"key":"e_1_3_2_1_43_1","first-page":"133","volume-title":"Proceedings of FSTTCS","author":"Mogavero F.","year":"2010","unstructured":"F. Mogavero , A. Murano , and M. Vardi . Reasoning about strategies . In Proceedings of FSTTCS , pages 133 -- 144 , 2010 . F. Mogavero, A. Murano, and M. Vardi. Reasoning about strategies. In Proceedings of FSTTCS, pages 133--144, 2010."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_22"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/647215.720390"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-1-84882-736-3_5","volume-title":"Formal Methods: State of the Art and New Directions","author":"Ryan P. Y. A.","year":"2010","unstructured":"P. Y. A. Ryan . The computer ate my vote . In Formal Methods: State of the Art and New Directions , pages 147 -- 184 . Springer , 2010 . P. Y. A. Ryan. The computer ate my vote. In Formal Methods: State of the Art and New Directions, pages 147--184. Springer, 2010."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32747-6_5"},{"key":"e_1_3_2_1_49_1","first-page":"1057","volume-title":"Proceedings of AAMAS'10","author":"Schnoor H.","year":"2010","unstructured":"H. Schnoor . Strategic planning for probabilistic games with incomplete information . In Proceedings of AAMAS'10 , pages 1057 -- 1064 , 2010 . H. Schnoor. Strategic planning for probabilistic games with incomplete information. In Proceedings of AAMAS'10, pages 1057--1064, 2010."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)82604-0"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ARES.2007.108"}],"event":{"name":"PrAISe '16: International Workshop on AI for Privacy and Security","acronym":"PrAISe '16","location":"The Hague Netherlands"},"container-title":["Proceedings of the 1st International Workshop on AI for Privacy and Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2970030.2970039","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2970030.2970039","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:50:00Z","timestamp":1750218600000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2970030.2970039"}},"subtitle":["Preliminary Attempt"],"short-title":[],"issued":{"date-parts":[[2016,8,29]]},"references-count":50,"alternative-id":["10.1145\/2970030.2970039","10.1145\/2970030"],"URL":"https:\/\/doi.org\/10.1145\/2970030.2970039","relation":{},"subject":[],"published":{"date-parts":[[2016,8,29]]},"assertion":[{"value":"2016-08-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}