{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:09:25Z","timestamp":1743080965163,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770473"},{"type":"electronic","value":"9783540770480"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77048-0_27","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T10:10:22Z","timestamp":1195207822000},"page":"350-361","source":"Crossref","is-referenced-by-count":2,"title":["Modeling Agreement Problems in the Universal Composability Framework"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Terada","sequence":"first","affiliation":[]},{"given":"Kazuki","family":"Yoneyama","sequence":"additional","affiliation":[]},{"given":"Sadayuki","family":"Hongo","sequence":"additional","affiliation":[]},{"given":"Kazuo","family":"Ohta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","volume-title":"Transaction Processing: Concepts and Techniques","author":"J. Gray","year":"1992","unstructured":"Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Francisco (1992)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-36108-1_2","volume-title":"Distributed Computing","author":"S. Goldwasser","year":"2002","unstructured":"Goldwasser, S., Lindell, Y.: Secure computation without agreement. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 17\u201332. Springer, Heidelberg (2002)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Programming Language and Systems\u00a04, 382\u2013401 (1982)","journal-title":"ACM Trans. Programming Language and Systems"},{"key":"27_CR4","unstructured":"Asokan, N.: Fairness in Electronic Commerce. PhD thesis, University of Waterloo (1998)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/comjnl\/46.1.55","volume":"46","author":"H. Pagnia","year":"2003","unstructured":"Pagnia, H., Vogt, H., G\u00e4rtner, F.C.: Fair exchange. The Computer Journal\u00a046, 55\u201375 (2003)","journal-title":"The Computer Journal"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Skeen, D.: Nonblocking commit protocols. In: Proc. 1981 ACM SIGMOD Intl. Conf. Management of Data, pp. 133\u2013142 (1981)","DOI":"10.1145\/582318.582339"},{"key":"27_CR7","unstructured":"Avoine, G., G\u00e4rtner, F.C., Guerraoui, R., Kursawe, K., Vaudenay, S., Vukolic, M.: Reducing fair exchange to atomic commit. Technical Report 200411, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland (2004)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/11733447_8","volume-title":"Smart Card Research and Advanced Applications","author":"M. Terada","year":"2006","unstructured":"Terada, M., Mori, K., Hongo, S.: An optimistic NBAC-based fair exchange method for arbitrary items. In: Domingo-Ferrer, J., Posegga, J., Schreckling, D. (eds.) CARDIS 2006. LNCS, vol.\u00a03928, pp. 105\u2013118. Springer, Heidelberg (2006)"},{"key":"27_CR9","unstructured":"Gray, J., Lamport, L.: Consensus on transaction commit. Technical Report MSR-TR-2003-96, Microsoft Research (2004)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/BFb0042322","volume-title":"Fault-Tolerant Distributed Computing","author":"J. Gray","year":"1990","unstructured":"Gray, J.: A comparison of byzantine agreement problem and the transaction commit problem. In: Simons, B., Spector, A. (eds.) Fault-Tolerant Distributed Computing. LNCS, vol.\u00a0448, pp. 10\u201317. Springer, Heidelberg (1990)"},{"key":"27_CR11","first-page":"461","volume-title":"Proc. 2nd IFIP Intl. Conf. Theoretical Computer Science (TCS)","author":"R. Guerraoui","year":"2002","unstructured":"Guerraoui, R., Kouznetsov, P.: On the weakest failure detector for non-blocking atomic commit. In: Proc. 2nd IFIP Intl. Conf. Theoretical Computer Science (TCS). IFIP Conference Proceedings, vol.\u00a0223, pp. 461\u2013473. Kluwer, Dordrecht (2002)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. 42nd Symp. Foundations of Computer Science (FOCS) Full version at Cryptology ePrint Archive 2000\/067, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: The weakest failure detector for solving consensus. J. ACM\u00a043, 225\u2013267 (1996)","journal-title":"J. ACM"},{"key":"27_CR14","unstructured":"Freiling, F.C., Guerraoui, R., Kouznetsov, P.: The failure detector abstraction. Technical Report 2006-003, Faculty of Mathematics and Computer Science, University of Mannheim (2006)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Lysyanskaya, A., Rabin, T.: On the composition of authenticated byzantine agreement. In: Proc. 34th Annual ACM Symp. Theory of Computing (STOC), pp. 514\u2013523 (2002)","DOI":"10.1145\/509907.509982"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/11681878_21","volume-title":"Theory of Cryptography","author":"J.A. Garay","year":"2006","unstructured":"Garay, J.A., MacKenzie, P.D., Prabhakaran, M., Yang, K.: Resource fairness and composability of cryptographic protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 404\u2013428. Springer, Heidelberg (2006)"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BFb0022140","volume-title":"Distributed Algorithms","author":"R. Guerraoui","year":"1995","unstructured":"Guerraoui, R.: Revisiting the relationship between non-blocking atomic commitment and consensus. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol.\u00a0972, pp. 87\u2013100. Springer, Heidelberg (1995)"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s446-002-8027-4","volume":"15","author":"R. Guerraoui","year":"2002","unstructured":"Guerraoui, R.: Non-blocking atomic commit in asynchronous distributed systems with failure detector. Distributed Computing\u00a015, 17\u201325 (2002)","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77048-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T20:04:50Z","timestamp":1566763490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77048-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770473","9783540770480"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77048-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}