{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:32:11Z","timestamp":1725478331193},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540363217"},{"type":"electronic","value":"9783540363224"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11795490_7","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T07:25:18Z","timestamp":1169537118000},"page":"61-72","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Randomized Fair Exchange with Secret Shared Coins"],"prefix":"10.1007","author":[{"given":"Felix","family":"Freiling","sequence":"first","affiliation":[]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[]},{"given":"Lucia Draque","family":"Penso","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2\u20133","key":"7_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-002-0081-5","volume":"16","author":"J. Aspnes","year":"2003","unstructured":"Aspnes, J.: Randomized protocols for asynchronous consensus. Distributed Computing\u00a016(2\u20133), 165\u2013175 (2003)","journal-title":"Distributed Computing"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11408901_5","volume-title":"Proceedings of the Fifth European Dependable Computing Conference","author":"G. Avoine","year":"2005","unstructured":"Avoine, G., G\u00e4rtner, F., Guerraoui, R., Vukolic, M.: Gracefully degrading fair exchange with security modules. In: Proceedings of the Fifth European Dependable Computing Conference, pp. 55\u201371. Springer, Heidelberg (2005)"},{"key":"7_CR3","first-page":"91","volume-title":"Proceedings of the Twenty-Fifth ACM Symposium on Theory of Computing","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP Impossibility Result for t-Resilient Asynchronous Computations. In: Proceedings of the Twenty-Fifth ACM Symposium on Theory of Computing, pp. 91\u2013100. ACM Press, New York (1993)"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"key":"7_CR5","first-page":"234","volume-title":"Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing","author":"S. Chaudhuri","year":"1990","unstructured":"Chaudhuri, S.: Agreement is harder than consensus: Set consensus problems in totally asynchronous systems. In: Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, pp. 234\u2013311. ACM Press, New York (1990)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/11560647_26","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"C. Delporte-Gallet","year":"2005","unstructured":"Delporte-Gallet, C., Fauconnier, H., Freiling, F.C.: Revisiting failure detection and consensus in omission failure environments. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol.\u00a03722, pp. 394\u2013408. Springer, Heidelberg (2005)"},{"issue":"10","key":"7_CR7","doi-asserted-by":"publisher","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":"7_CR8","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/62212.62225","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing","author":"P. Feldman","year":"1988","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 148\u2013161. ACM Press, New York (1988)"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"Fischer, M., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM)\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM (JACM)"},{"issue":"6","key":"7_CR10","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM (JACM)\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM (JACM)"},{"key":"7_CR11","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":"7_CR12","doi-asserted-by":"crossref","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":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreements in the presence of faults. Journal of the ACM (JACM)\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM (JACM)"},{"issue":"5","key":"7_CR14","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M. Saks","year":"2000","unstructured":"Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM Journal on Computing\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR15","unstructured":"Trusted Computing Group. Trusted computing group homepage. Internet (2003), https:\/\/www.trustedcomputinggroup.org\/"},{"key":"7_CR16","volume-title":"CDMA : Principles of Spread Spectrum Communication","author":"A.J. Viterbi","year":"1995","unstructured":"Viterbi, A.J.: CDMA: Principles of Spread Spectrum Communication. Prentice-Hall, Englewood Cliffs (1995)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795490_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T09:45:09Z","timestamp":1683711909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795490_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540363217","9783540363224"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11795490_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}