{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T23:40:04Z","timestamp":1742341204699,"version":"3.40.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642279393"},{"type":"electronic","value":"9783642279409"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27940-9_11","type":"book-chapter","created":{"date-parts":[[2012,1,19]],"date-time":"2012-01-19T07:29:29Z","timestamp":1326958169000},"page":"152-168","source":"Crossref","is-referenced-by-count":5,"title":["Synthesizing Protocols for Digital Contract Signing"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vishwanath","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","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: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 521\u2013525. Springer, Heidelberg (1998)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Asynchronous protocols for optimistic fair exchange. In: IEEE S&P, pp. 86\u201399 (1998)","DOI":"10.1109\/SECPRI.1998.674826"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Chadha, R., Kanovich, M.I., Scedrov, A.: Inductive methods and contract-signing protocols. In: CCS, pp. 176\u2013185. ACM (2001)","DOI":"10.1145\/501983.502008"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-45187-7_24","volume-title":"CONCUR 2003 - Concurrency Theory","author":"R. Chadha","year":"2003","unstructured":"Chadha, R., Mitchell, J.C., Scedrov, A., Shmatikov, V.: Contract Signing, Optimism, and Advantage. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 366\u2013382. Springer, Heidelberg (2003)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-71209-1_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A.: Assume-Guarantee Synthesis. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 261\u2013275. Springer, Heidelberg (2007)"},{"issue":"1-2","key":"11_CR6","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., Jurdzinski, M.: Games with secure equilibria. Theor. Comput. Sci.\u00a0365(1-2), 67\u201382 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR7","unstructured":"Chatterjee, K., Raman, V.: Assume-guarantee synthesis for digital contract signing. CoRR, abs\/1004.2697 (2010)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","first-page":"52","volume-title":"Logic of Programs","author":"E.M. Clarke","year":"1981","unstructured":"Clarke, E.M., Emerson, E.A.: Design and Synthesis of Synchronization Skeletons using Branching-Time Temporal Logic. In: Engeler, E. (ed.) Logic of Programs 1979. LNCS, vol.\u00a0125, pp. 52\u201371. Springer, Heidelberg (1981)"},{"key":"11_CR9","unstructured":"Even, S., Yacobi, Y.: Relations among public key signature systems, technical report 175. Technical report, Technion, Haifa, Israel (1980)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-48405-1_29","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J.A. Garay","year":"1999","unstructured":"Garay, J.A., Jakobsson, M., MacKenzie, P.D.: Abuse-Free Optimistic Contract Signing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 449\u2013466. Springer, Heidelberg (1999)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kremer, S., Raskin, J.-F.: Game analysis of abuse-free contract signing. In: CSFW, pp. 206\u2013220. IEEE (2002)","DOI":"10.1109\/CSFW.2002.1021817"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.3233\/JCS-2003-11307","volume":"11","author":"S. Kremer","year":"2003","unstructured":"Kremer, S., Raskin, J.-F.: A game-based verification of non-repudiation and fair exchange protocols. JCS\u00a011(3), 399\u2013430 (2003)","journal-title":"JCS"},{"key":"11_CR13","volume-title":"The Temporal Logic of Reactive and Concurrent Systems: Specification","author":"Z. Manna","year":"1991","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, New York (1991)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-36552-4_31","volume-title":"Information Security and Cryptology - ICISC 2002","author":"O. Markowitch","year":"2003","unstructured":"Markowitch, O., Gollmann, D., Kremer, S.: On Fairness in Exchange Protocols. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 451\u2013464. Springer, Heidelberg (2003)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/3-540-45439-X_25","volume-title":"Information Security","author":"O. Markowitch","year":"2001","unstructured":"Markowitch, O., Kremer, S.: An Optimistic Non-repudiation Protocol with Transparent Trusted Third Party. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol.\u00a02200, pp. 363\u2013378. Springer, Heidelberg (2001)"},{"key":"11_CR16","unstructured":"Pagnia, H., G\u00e4rtner, F.C.: On the impossibility of fair exchange without a trusted third party. Technical report, Darmstadt (1999)"},{"key":"11_CR17","unstructured":"Perrig, A., Song, D.X.: A first step towards the automatic generation of security protocols. In: NDSS (2000)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. 18th IEEE Symp. Found. of Comp. Sci., pp. 46\u201357. IEEE Computer Society Press (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179\u2013190. ACM Press (1989)","DOI":"10.1145\/75277.75293"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Ramadge, P., Wonham, W.: Supervisory control of a class of discrete event processes. Siam J. Control and Optimization\u00a025(1) (1987)","DOI":"10.1137\/0325013"},{"key":"11_CR21","unstructured":"Sa\u00efdi, H.: Toward automatic synthesis of security protocols. AAAI Technical Report, SS-02-05 (2002)"},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/S0304-3975(01)00141-4","volume":"283","author":"V. Shmatikov","year":"2002","unstructured":"Shmatikov, V., Mitchell, J.C.: Finite-state analysis of two contract signing protocols. Theor. Comput. Sci.\u00a0283(2), 419\u2013450 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Song, D., Berezin, S., Perrig, A.: Athena: a novel approach to efficient automatic security protocol analysis. JCS\u00a09 (2001)","DOI":"10.3233\/JCS-2001-91-203"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Languages, automata, and logic, pp. 389\u2013455 (1997)","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"11_CR25","unstructured":"Zhou, J., Gollmann, D.: An efficient non-repudiation protocol. In: PCSFW, pp. 126\u2013132. IEEE Computer Society Press (1997)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27940-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T23:24:56Z","timestamp":1742340296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27940-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642279393","9783642279409"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27940-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}