{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:36Z","timestamp":1725564936750},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223795"},{"type":"electronic","value":"9783540278009"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27800-9_16","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:38Z","timestamp":1283727638000},"page":"176-187","source":"Crossref","is-referenced-by-count":22,"title":["Analysis and Improvement of Micali\u2019s Fair Contract Signing Protocol"],"prefix":"10.1007","author":[{"given":"Feng","family":"Bao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guilin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianying","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huafei","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Asynchronous protocols for optimistic fair exchange. In: 1998 IEEE Symposium on Security and Privacy, pp. 86\u201399 (1998)","key":"16_CR1","DOI":"10.1109\/SECPRI.1998.674826"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1007\/3-540-48224-5_73","volume-title":"Automata, Languages and Programming","author":"B. Baum-Waidner","year":"2001","unstructured":"Baum-Waidner, B.: Optimistic asynchronous multi-party contract signing with reduced number of rounds. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 898\u2013911. Springer, Heidelberg (2001)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption - How to encrypt with RSA. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"issue":"1","key":"16_CR4","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.L.: A fair protocol for signing contracts. IEEE Transactions on Information Theory\u00a036(1), 40\u201346 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00191356","volume":"8","author":"B. Damg\u00e5rd","year":"1995","unstructured":"Damg\u00e5rd, B.: Practical and provably secure release of a secret and exchange of signatures. Journal of Cryptology\u00a08(4), 201\u2013222 (1995)","journal-title":"Journal of Cryptology"},{"doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, D., Naor, N.: Non-meallleable cryptography. In: 1992 IEEE Symposium on Foundations of Computer Science (1992)","key":"16_CR7","DOI":"10.1145\/103418.103474"},{"issue":"6","key":"16_CR8","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"},{"unstructured":"Even, S., Yacobi, Y.: Relations among public key signature schemes. Technical Report 175, Computer Science Dept., Technion, Israel (1980)","key":"16_CR9"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/3-540-45439-X_27","volume-title":"Information Security","author":"J.L. Ferrer-Gomila","year":"2001","unstructured":"Ferrer-Gomila, J.L., Payeras-Capella, M., Huguet-Rotger, L.: Efficient optimistic n-party contract signing protocol. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol.\u00a02200, pp. 394\u2013407. Springer, Heidelberg (2001)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44647-8_16","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"E. Fujisaki","year":"2001","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP is secure under the RSA assumption. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 260\u2013274. Springer, Heidelberg (2001)"},{"key":"16_CR12","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)"},{"key":"16_CR13","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. Garay","year":"1999","unstructured":"Garay, J., MacKenzie, P.: Abuse-free multi-party contract signing. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol.\u00a01693, pp. 151\u2013165. Springer, Heidelberg (1999)"},{"key":"16_CR14","first-page":"133","volume-title":"Crypto 1983","author":"O. Goldreich","year":"1983","unstructured":"Goldreich, O.: A simple protocol for signing contracts. In: Crypto 1983, pp. 133\u2013136. Plenum Press, New York (1983)"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen-message attack. SIAM Journal of Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM Journal of Computing"},{"unstructured":"Micali, S.: Simultaneous electronic transactions. US Patent No. 5666420 (September 1997)","key":"16_CR16"},{"doi-asserted-by":"crossref","unstructured":"Micali, S.: Simple and fast optimistic protocols for fair electronic exchange. In: 2003 ACM Symposium on Principles of Distributed Computing, pp. 12\u201319 (2003)","key":"16_CR17","DOI":"10.1145\/872035.872038"},{"doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Schunter, M., Waidner, M.: Optimal efficiency of optimistic contract signing. In: 1998 ACM Symposium on Principles of Distributed Computing, pp. 113\u2013122 (1998)","key":"16_CR18","DOI":"10.1145\/277697.277717"},{"issue":"4","key":"16_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00145-002-0133-9","volume":"15","author":"V. Shoup","year":"2002","unstructured":"Shoup, V.: OAEP reconsidered. Journal of Cryptology\u00a015(4), 223\u2013249 (2002)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27800-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:15Z","timestamp":1605759675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27800-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223795","9783540278009"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27800-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}