{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T23:07:36Z","timestamp":1760828856227,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206934"},{"type":"electronic","value":"9783540409816"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40981-6_9","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T19:17:45Z","timestamp":1277234265000},"page":"81-96","source":"Crossref","is-referenced-by-count":11,"title":["Analysis of Probabilistic Contract Signing"],"prefix":"10.1007","author":[{"given":"Gethin","family":"Norman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Shmatikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45605-8_3","volume-title":"Process Algebra and Probabilistic Methods. Performance Modeling and Verification","author":"A. Aldini","year":"2002","unstructured":"Aldini, A., Gorrieri, R.: Security analysis of a probabilistic non-repudiation protocol. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol.\u00a02399, pp. 17\u201336. Springer, Heidelberg (2002)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R. Alur","year":"1999","unstructured":"Alur, R., Henzinger, T.: Reactive modules. Formal Methods in System Design\u00a015, 7\u201348 (1999)","journal-title":"Formal Methods in System Design"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: Proc. 4th ACM Conference on Computer and Communications Security, pp. 7\u201317 (1997)","DOI":"10.1145\/266420.266426"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1109\/49.839935","volume":"18","author":"N. Asokan","year":"2000","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. IEEE Selected Areas in Communications\u00a018(4), 593\u2013610 (2000)","journal-title":"IEEE Selected Areas in Communications"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s004460050046","volume":"11","author":"C. Baier","year":"1998","unstructured":"Baier, C., Kwiatkowska, M.: Model checking for a probabilistic branching time logic with fairness. Distributed Computing\u00a011(3), 125\u2013155 (1998)","journal-title":"Distributed Computing"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.50372","volume":"36","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.: A fair protocol for signing contracts. IEEE Transactions on Information Theory\u00a036(1), 40\u201346 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/3-540-60692-0_70","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Bianco","year":"1995","unstructured":"Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.\u00a01026, pp. 499\u2013513. Springer, Heidelberg (1995)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"D. Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 236\u2013254. Springer, Heidelberg (2000)"},{"key":"9_CR9","unstructured":"Butty\u00e1n, L., Hubaux, J.-P.: Toward a formal model of fair exchange \u2014 a game theoretic approach. Technical Report SSC\/1999\/39, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland (1999)"},{"key":"9_CR10","unstructured":"Butty\u00e1n, L., Hubaux, J.-P., \u010capkun, S.: A formal analysis of Syverson\u2019s rational exchange protocol. In: Proc. 15th IEEE Computer Security Foundations Workshop, pp. 193\u2013205 (2002)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Chadha, R., Kanovich, M., Scedrov, A.: Inductive methods and contract-signing protocols. In: Proc. 8th ACM Conference on Computer and Communications Security, pp. 176\u2013185 (2001)","DOI":"10.1145\/501983.502008"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00191356","volume":"8","author":"I. Damg\u00e5rd","year":"1995","unstructured":"Damg\u00e5rd, I.: Practical and provably secure release of a secret and exchange of signatures. J. Cryptology\u00a08(4), 201\u2013222 (1995)","journal-title":"J. Cryptology"},{"key":"9_CR13","volume-title":"Finite-State Markovian Decision Processes","author":"C. Derman","year":"1970","unstructured":"Derman, C.: Finite-State Markovian Decision Processes. Academic Press, New York (1970)"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public key protocols. IEEE Transactions on Information Theory\u00a029(2), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR15","unstructured":"Even, S.: A protocol for signing contracts. Technical Report 231, Computer Science Dept., Technion, Israel (1982)"},{"issue":"6","key":"9_CR16","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"key":"9_CR17","unstructured":"Even, S., Yacobi, Y.: Relations among public key signature schemes. Technical Report 175, Computer Science Dept., Technion, Israel (1980)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/3-540-48405-1_29","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J. Garay","year":"1999","unstructured":"Garay, J., Jakobsson, M., MacKenzie, P.: Abuse-free optimistic contract signing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 449\u2013466. Springer, Heidelberg (1999)"},{"issue":"4","key":"9_CR19","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"issue":"3","key":"9_CR20","doi-asserted-by":"crossref","first-page":"255","DOI":"10.3233\/JCS-1992-13-405","volume":"1","author":"J. Gray","year":"1992","unstructured":"Gray, J.: Toward a mathematical foundation for information flow security. J. Computer Security\u00a01(3), 255\u2013294 (1992)","journal-title":"J. Computer Security"},{"issue":"5","key":"9_CR21","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and probability. Formal Aspects of Computing\u00a06(5), 512\u2013535 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/3-540-44685-0_37","volume-title":"CONCUR 2001 - Concurrency Theory","author":"S. Kremer","year":"2001","unstructured":"Kremer, S., Raskin, J.-F.: A game-based verification of non-repudiation and fair exchange protocols. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 551\u2013565. Springer, Heidelberg (2001)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Kremer, S., Raskin, J.-F.: Game analysis of abuse-free contract signing. In: Proc. 15th IEEE Computer Security Foundations Workshop, pp. 206\u2013220 (2002)","DOI":"10.1109\/CSFW.2002.1021817"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-46029-2_13","volume-title":"Computer Performance Evaluation","author":"M. Kwiatkowska","year":"2002","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic symbolic model checker. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol.\u00a02324, pp. 200\u2013204. Springer, Heidelberg (2002)"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/3-540-48119-2_43","volume-title":"FM\u201999 - Formal Methods","author":"P. Lincoln","year":"1999","unstructured":"Lincoln, P., Mitchell, J., Mitchell, M., Scedrov, A.: Probabilistic polynomial-time equivalence and security analysis. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol.\u00a01708, pp. 776\u2013793. Springer, Heidelberg (1999)"},{"key":"9_CR26","unstructured":"Markowitch, O., Roggeman, Y.: Probabilistic non-repudiation without trusted third party. In: Proc. 2nd Conference on Security in Communication Networks (1999)"},{"key":"9_CR27","unstructured":"Micali, S.: Certified e-mail with invisible post offices. Presented at RSA Security Conference (1997)"},{"key":"9_CR28","unstructured":"PRISM web page, http:\/\/www.cs.bham.ac.uk\/~dxp\/prism\/"},{"issue":"2","key":"9_CR29","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.: Finite-state analysis of two contract signing protocols. Theoretical Computer Science\u00a0283(2), 419\u2013450 (2002)","journal-title":"Theoretical Computer Science"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Syverson, P., Gray, J.: The epistemic representation of information flow security in probabilistic systems. In: Proc. 8th IEEE Computer Security Foundations Workshop, pp. 152\u2013166 (1995)","DOI":"10.1109\/CSFW.1995.518560"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Volpano, D., Smith, G.: Probabilistic non-interference in a concurrent language. In: Proc. 11th IEEE Computer Security Foundations Workshop, pp. 34\u201343 (1998)","DOI":"10.1109\/CSFW.1998.683153"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40981-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T04:49:39Z","timestamp":1740199779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40981-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206934","9783540409816"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40981-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}