{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:07:19Z","timestamp":1725552439444},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642124587"},{"type":"electronic","value":"9783642124594"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12459-4_14","type":"book-chapter","created":{"date-parts":[[2010,4,29]],"date-time":"2010-04-29T02:49:38Z","timestamp":1272509378000},"page":"186-200","source":"Crossref","is-referenced-by-count":6,"title":["Game-Based Verification of Multi-Party Contract Signing Protocols"],"prefix":"10.1007","author":[{"given":"Ying","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenyi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sjouke","family":"Mauw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/266420.266426","volume-title":"Proc. CCS","author":"N. Asokan","year":"1997","unstructured":"Asokan, N., Waidner, M., Schunter, M.: Optimistic protocols for fair exchange. In: Proc. CCS, pp. 7\u201317. ACM, New York (1997)"},{"issue":"4","key":"14_CR2","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/49.839935","volume":"18","author":"N. Asokan","year":"2000","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optmistic fair exchange of digital signatures. Selected Areas in Communications\u00a018(4), 591\u2013606 (2000)","journal-title":"Selected Areas in Communications"},{"issue":"17","key":"14_CR3","doi-asserted-by":"publisher","first-page":"1606","DOI":"10.1016\/S0140-3664(02)00049-X","volume":"25","author":"S. Kremer","year":"2002","unstructured":"Kremer, S., Markowitch, O., Zhou, J.: An intensive survey of fair non-repudiation protocols. Computer Communications\u00a025(17), 1606\u20131621 (2002)","journal-title":"Computer Communications"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-48169-9_11","volume-title":"Distributed Computing","author":"J.A. Garay","year":"1999","unstructured":"Garay, J.A., MacKenzie, P.D.: Abuse-free multi-party contract signing. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol.\u00a01693, pp. 151\u2013166. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10817-005-9019-5","volume":"36","author":"R. Chadha","year":"2006","unstructured":"Chadha, R., Kremer, S., Scedrov, A.: Formal analysis of multi-party contract signing. J. Autom. Reasoning\u00a036(1-2), 39\u201383 (2006)","journal-title":"J. Autom. Reasoning"},{"issue":"2-4","key":"14_CR6","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.ic.2007.07.007","volume":"206","author":"A. Mukhamedov","year":"2008","unstructured":"Mukhamedov, A., Ryan, M.D.: Fair multi-party contract signing using private contract signatures. Inf. Comput.\u00a0206(2-4), 272\u2013290 (2008)","journal-title":"Inf. Comput."},{"key":"14_CR7","first-page":"13","volume-title":"Proc. CSF","author":"S. Mauw","year":"2009","unstructured":"Mauw, S., Radomirovi\u0107, S., Torabi Dashti, M.: Minimal message complexity of asynchronous multi-party contract signing. In: Proc. CSF, pp. 13\u201325. IEEE CS, Los Alamitos (2009)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BFb0028774","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Mang, F.Y.C., Qadeer, S., Rajamani, S.K., Tasiran, S.: Mocha: Modularity in model checking. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 521\u2013525. Springer, Heidelberg (1998)"},{"issue":"5","key":"14_CR9","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM\u00a049(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"14_CR10","first-page":"955","volume-title":"Handbook of Theoretical Computer Science (B)","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science (B), pp. 955\u20131072. MIT Press, Cambridge (1990)"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R. Alur","year":"1999","unstructured":"Alur, R., Henzinger, T.A.: Reactive modules. Formal Methods in System Design\u00a015(1), 7\u201348 (1999)","journal-title":"Formal Methods in System Design"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhang, C., Pang, J., Mauw, S.: Game-based verification of multi-party contract signing protocols \u2013 Mocha models and ATL properties (2009), http:\/\/satoss.uni.lu\/members\/jun\/mpcs\/","DOI":"10.1007\/978-3-642-12459-4_14"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-45657-0_29","volume-title":"Computer Aided Verification","author":"A. Cimatti","year":"2002","unstructured":"Cimatti, A., Clarke, E.M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: An open source tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 359\u2013364. Springer, Heidelberg (2002)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(74)90116-2","volume":"10","author":"L. Adleman","year":"1974","unstructured":"Adleman, L.: Short permutation strings. Discrete Mathematics\u00a010, 197\u2013200 (1974)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jlap.2004.09.003","volume":"64","author":"R. Chadha","year":"2005","unstructured":"Chadha, R., Mitchell, J.C., Scedrov, A., Shmatikov, V.: Contract signing, optimism, and advantage. J. Log. Algebr. Program.\u00a064(2), 189\u2013218 (2005)","journal-title":"J. Log. Algebr. Program."},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11787006_9","volume-title":"Automata, Languages and Programming","author":"D. K\u00e4hler","year":"2006","unstructured":"K\u00e4hler, D., K\u00fcsters, R., Wilke, T.: A Dolev-Yao-based definition of abuse-free protocols. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 95\u2013106. Springer, Heidelberg (2006)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-540-74835-9_28","volume-title":"Computer Security \u2013 ESORICS 2007","author":"V. Cortier","year":"2007","unstructured":"Cortier, V., K\u00fcsters, R., Warinschi, B.: A cryptographic model for branching time security properties - the case of contract signing protocols. In: Biskup, J., L\u00f3pez, J. (eds.) ESORICS 2007. LNCS, vol.\u00a04734, pp. 422\u2013437. Springer, Heidelberg (2007)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-540-45099-3_12","volume-title":"Static Analysis","author":"T.A. Henzinger","year":"2000","unstructured":"Henzinger, T.A., Majumdar, R., Mang, F.Y.C., Raskin, J.F.: Abstract interpretation of game properties. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol.\u00a01824, pp. 220\u2013239. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects in Security and Trust"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12459-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:54:10Z","timestamp":1606168450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12459-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642124587","9783642124594"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12459-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}