{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:26:58Z","timestamp":1742401618796},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540257233"},{"type":"electronic","value":"9783540320197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11408901_5","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T09:04:14Z","timestamp":1279011854000},"page":"55-71","source":"Crossref","is-referenced-by-count":18,"title":["Gracefully Degrading Fair Exchange with Security Modules"],"prefix":"10.1007","author":[{"given":"Gildas","family":"Avoine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"G\u00e4rtner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marko","family":"Vukoli\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","first-page":"8","volume-title":"4th ACM Conference on Computer and Communications Security","author":"N. Asokan","year":"1997","unstructured":"Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: Matsumoto, T. (ed.) 4th ACM Conference on Computer and Communications Security, Zurich, Switzerland, pp. 8\u201317. ACM Press, New York (1997)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Avoine, G., G\u00e4rtner, F., Guerraoui, R., Vukoli\u0107, M.: Gracefully degrading fair exchange with security modules. Technical Report IC\/2004\/26, EPFL, Switzerland (2004)","DOI":"10.1007\/11408901_5"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-24591-9_15","volume-title":"Information Security Applications","author":"G. Avoine","year":"2004","unstructured":"Avoine, G., Vaudenay, S.: Fair exchange with guardian angels. In: Chae, K.-J., Yung, M. (eds.) WISA 2003. LNCS, vol.\u00a02908, pp. 188\u2013202. Springer, Heidelberg (2004)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-27800-9_7","volume-title":"Information Security and Privacy","author":"G. Avoine","year":"2004","unstructured":"Avoine, G., Vaudenay, S.: Optimistic fair exchange based on publicly verifiable secret sharing. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol.\u00a03108, pp. 74\u201385. Springer, Heidelberg (2004)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/CSFW.2002.1021814","volume-title":"15th IEEE Computer Security Foundations Workshop \u2013 CSFW","author":"M. Backes","year":"2002","unstructured":"Backes, M., Pfitzmann, B., Steiner, M., Waidner, M.: Polynomial fairness and liveness. In: 15th IEEE Computer Security Foundations Workshop \u2013 CSFW, Cape Breton, Nova Scotia, Canada, pp. 160\u2013174. IEEE, IEEE Computer Society, Los Alamitos (2002)"},{"key":"5_CR6","first-page":"77","volume-title":"Proceedings of the IEEE Symposium on Research in Security and Privacy","author":"F. Bao","year":"1998","unstructured":"Bao, F., Deng, R., Mao, W.: Efficient and practical fair exchange protocols with off-line TTP. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, California, USA, pp. 77\u201385. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"5_CR7","first-page":"858","volume-title":"Proceedings of the 10th International Workshop on Database & Expert Systems Applications","author":"F. Bao","year":"1999","unstructured":"Bao, F., Deng, R., Nguyen, K.Q., Varadharajan, V.: Multi-party fair exchange with an off-line trusted neutral party. In: Proceedings of the 10th International Workshop on Database & Expert Systems Applications, Florence, Italy, pp. 858\u2013862. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-45022-X_44","volume-title":"Automata, Languages and Programming","author":"B. Baum-Waidner","year":"2000","unstructured":"Baum-Waidner, B., Waidner, M.: Round-optimal and abuse-free multi-party contract signing. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 524\u2013535. Springer, Heidelberg (2000)"},{"key":"5_CR9","volume-title":"Concurrency Control and Recovery in Database Systems","author":"P. Bernstein","year":"1987","unstructured":"Bernstein, P., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading (1987)"},{"key":"5_CR10","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":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-49649-1_22","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"C. Boyd","year":"1998","unstructured":"Boyd, C., Foo, E.: Off-line fair payment protocols using convertible signatures. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 271\u2013285. Springer, Heidelberg (1998)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-44456-4_16","volume-title":"Information Security","author":"C. Boyd","year":"2000","unstructured":"Boyd, C., Kearney, P.: Exploring fair exchange protocols using specification animation. In: Okamoto, E., Pieprzyk, J.P., Seberry, J. (eds.) ISW 2000. LNCS, vol.\u00a01975, pp. 209\u2013223. Springer, Heidelberg (2000)"},{"issue":"8","key":"5_CR13","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/0167-4048(90)90114-9","volume":"9","author":"H. B\u00fcrk","year":"1990","unstructured":"B\u00fcrk, H., Pfitzmann, A.: Value exchange systems enabling security and unobservability. Computers & Security\u00a09(8), 715\u2013721 (1990)","journal-title":"Computers & Security"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-49649-1_23","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"L. Chen","year":"1998","unstructured":"Chen, L.: Efficient fair exchange with verifiable confirmation of signatures. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 286\u2013299. Springer, Heidelberg (1998)"},{"issue":"10","key":"5_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/2.955100","volume":"34","author":"J.G. Dyer","year":"2001","unstructured":"Dyer, J.G., Lindemann, M., Perez, R., Sailer, R., van Doorn, L., Smith, S.W., Weingart, S.: Building the IBM 4758 secure coprocessor. IEEE Computer\u00a034(10), 57\u201366 (2001)","journal-title":"IEEE Computer"},{"key":"5_CR16","unstructured":"Even, S., Yacobi, Y.: Relations amoung public key signature systems. Technical Report 175, Computer Science Department, Technicon, Haifa, Israel (1980)"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"5_CR18","first-page":"482","volume-title":"Proceedings of the 21st annual symposium on the Theory and Applications of Cryptographic Techniques","author":"M. Fitzi","year":"2002","unstructured":"Fitzi, M., Gisin, N., Maurer, U.M., von Rotz, O.: Unconditional Byzantine agreement and multi-party computation secure against dishonest minorities from scratch. In: Proceedings of the 21st annual symposium on the Theory and Applications of Cryptographic Techniques, pp. 482\u2013501. Springer, Heidelberg (2002)"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/571825.571841","volume-title":"Proceedings of the twenty-first annual symposium on Principles of distributed computing","author":"M. Fitzi","year":"2002","unstructured":"Fitzi, M., Gottesman, D., Hirt, M., Holenstein, T., Smith, A.: Detectable Byzantine agreement secure against faulty majorities. In: Proceedings of the twenty-first annual symposium on Principles of distributed computing, pp. 118\u2013126. ACM Press, New York (2002)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BFb0055475","volume-title":"Financial Cryptography","author":"M.K. Franklin","year":"1998","unstructured":"Franklin, M.K., Tsudik, G.: Secure group barter: Multi-party fair exchange with semi-trusted neutral parties. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol.\u00a01465, pp. 90\u2013102. Springer, Heidelberg (1998)"},{"key":"5_CR21","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.: Abuse-free multi-party contract signing. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol.\u00a01693, pp. 151\u2013166. Springer, Heidelberg (1999)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game \u2014 a completeness theorem for protocols with honest majority. In: Proceedings of the 19th ACM Symposium on the Theory of Computing (STOC), pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"5_CR23","first-page":"17","volume-title":"Proceedings of the 16th International Conference on Distributed Computing","author":"S. Goldwasser","year":"2002","unstructured":"Goldwasser, S., Lindell, Y.: Secure computation without agreement. In: Proceedings of the 16th International Conference on Distributed Computing, pp. 17\u201332. Springer, Heidelberg (2002)"},{"key":"5_CR24","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Mateo (1996)"},{"key":"5_CR25","unstructured":"Markowitch, O., Roggeman, Y.: Probabilistic non-repudiation without trusted third party. In: Proceedings of the 2nd Workshop on Security in Communication Networks (1999)"},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/32.481534","volume":"22","author":"J. McLean","year":"1996","unstructured":"McLean, J.: A general theory of composition for a class of \u201cpossibilistic\u201d properties. IEEE Transactions on Software Engineering\u00a022(1), 53\u201367 (1996); Special Section\u2014Best Papers of the IEEE Symposium on Security and Privacy (1994)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Pagnia, H., Vogt, H., G\u00e4rtner, F.C.: Fair exchange. The Computer Journal\u00a046(1) (2003)","DOI":"10.1093\/comjnl\/46.1.55"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/1007912.1007963","volume-title":"Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures","author":"P.R. Parv\u00e9dy","year":"2004","unstructured":"Parv\u00e9dy, P.R., Raynal, M.: Optimal early stopping uniform consensus in synchronous systems with process omission failures. In: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 302\u2013310. ACM Press, New York (2004)"},{"issue":"3","key":"5_CR29","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"12","author":"K.J. Perry","year":"1986","unstructured":"Perry, K.J., Toueg, S.: Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering\u00a012(3), 477\u2013482 (1986)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Skeen, D.: Non-blocking commit protocols. In: Proc. ACM SIGMOD Conf., Ann Arbor, MI, p. 133 (April-May1981)","DOI":"10.1145\/582338.582339"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/3-540-39568-7_34","volume-title":"Advances in Cryptology","author":"T. Tedrick","year":"1985","unstructured":"Tedrick, T.: Fair exchange of secrets. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 434\u2013438. Springer, Heidelberg (1985)"},{"key":"5_CR32","unstructured":"Trusted Computing Group. Trusted computing group homepage. Internet (2003), https:\/\/www.trustedcomputinggroup.org\/"},{"issue":"1","key":"5_CR33","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1996.0063","volume":"128","author":"G. Varghese","year":"1996","unstructured":"Varghese, G., Lynch, N.A.: A tradeoff between safety and liveness for randomized coordinated attack. Information and Computation\u00a0128(1), 57\u201371 (1996)","journal-title":"Information and Computation"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Vogt, H., G\u00e4rtner, F.C., Pagnia, H.: Supporting fair exchange in mobile environments. ACM\/Kluwer Journal on Mobile Networks and Applications (MONET)\u00a08(2) (April 2003)","DOI":"10.1023\/A:1022276913209"}],"container-title":["Lecture Notes in Computer Science","Dependable Computing - EDCC 5"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11408901_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T05:46:02Z","timestamp":1635659162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11408901_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540257233","9783540320197"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11408901_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}