{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T10:56:27Z","timestamp":1769943387776,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642154966","type":"print"},{"value":"9783642154973","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15497-3_30","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:51:46Z","timestamp":1283338306000},"page":"488-507","source":"Crossref","is-referenced-by-count":17,"title":["Optimistic Fair Exchange with Multiple Arbiters"],"prefix":"10.1007","author":[{"given":"Alptekin","family":"K\u00fcp\u00e7\u00fc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Abd-El-Malek, M., Ganger, G., Goodson, G., Reiter, M., Wylie, J.: Fault-scalable byzantine fault-tolerant services. In: SOSP (2005)","DOI":"10.1145\/1095810.1095817"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: ACM CCS (1997)","DOI":"10.1145\/266420.266426"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BFb0054156","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"N. Asokan","year":"1998","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 591\u2013606. Springer, Heidelberg (1998)"},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"591","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, 591\u2013610 (2000)","journal-title":"IEEE Selected Areas in Communications"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Ateniese, G.: Efficient verifiable encryption (and fair exchange) of digital signatures. In: ACM CCS (1999)","DOI":"10.1145\/319709.319728"},{"key":"30_CR6","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":"30_CR7","unstructured":"Bao, F., Deng, R., Mao, W.: Efficient and practical fair exchange protocols with off-line TTP. In: IEEE Security and Privacy (1998)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Belenkiy, M., Chase, M., Erway, C., Jannotti, J., K\u00fcp\u00e7\u00fc, A., Lysyanskaya, A., Rachlin, E.: Making p2p accountable without losing privacy. In: ACM WPES (2007), \n                    \n                      http:\/\/www.cs.brown.edu\/research\/brownie\/p2p-ecash-wpes07.pdf","DOI":"10.1145\/1314333.1314339"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC, pp. 52\u201361 (1993)","DOI":"10.1145\/167088.167109"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-44448-3_25","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"J. Camenisch","year":"2000","unstructured":"Camenisch, J., Damg\u00e5rd, I.: Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, p. 331. Springer, Heidelberg (2000)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A., Meyerovich, M.: Endorsed e-cash. In: IEEE Security and Privacy (2007)","DOI":"10.1109\/SP.2007.15"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: STOC, pp. 42\u201351 (1993)","DOI":"10.1145\/167088.167105"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-71677-8_9","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"Y. Dodis","year":"2007","unstructured":"Dodis, Y., Lee, P., Yum, D.: Optimistic fair exchange in a multi-user setting. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, p. 118. Springer, Heidelberg (2007)"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"E. Fujisaki","year":"1998","unstructured":"Fujisaki, E., Okamoto, T.: A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 32\u201346. Springer, Heidelberg (1998)"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-11925-5_18","volume-title":"CT-RSA 2010","author":"A. K\u00fcp\u00e7\u00fc","year":"2010","unstructured":"K\u00fcp\u00e7\u00fc, A., Lysyanskaya, A.: Usable optimistic fair exchange. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol.\u00a05985, pp. 252\u2013267. Springer, Heidelberg (2010), \n                    \n                      http:\/\/eprint.iacr.org\/2008\/431"},{"key":"30_CR19","unstructured":"Micali, S.: Simultaneous electronic transactions with visible trusted parties. US Patent 5,553,145 (1996)"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Micali, S.: Simple and fast optimistic protocols for fair electronic exchange. In: PODC (2003)","DOI":"10.1145\/872035.872038"},{"key":"30_CR21","unstructured":"Pagnia, H., G\u00e4rtner, F.: On the impossibility of fair exchange without a trusted third party. Darmstadt University of Technology, TUD-BS-1999-02 (1999)"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15497-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:31:28Z","timestamp":1559507488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15497-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642154966","9783642154973"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15497-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}