{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:23:35Z","timestamp":1725542615932},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649519"},{"type":"electronic","value":"9783540539186"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055475","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:10:06Z","timestamp":1153991406000},"page":"90-102","source":"Crossref","is-referenced-by-count":36,"title":["Secure group barter: Multi-party fair exchange with semi-trusted neutral parties"],"prefix":"10.1007","author":[{"given":"Matt","family":"Franklin","sequence":"first","affiliation":[]},{"given":"Gene","family":"Tsudik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"7_CR1","unstructured":"N. Asokan, V. Schoup, and M. Waidner. Optimistic fair exchange of digital signatures. Research Report RZ 2892 (# 90840), IBM Research, December 1997."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for multi-party fair exchange. Research Report RZ 2892 (# 90840), IBM Research, December 1996.","DOI":"10.1145\/266420.266426"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In ACM Conference on Computer and Communication Security, April 1997.","DOI":"10.1145\/266420.266426"},{"key":"7_CR4","unstructured":"D. Beaver. Security, fault tolerance and communication complexity in distributed systems. Ph.D. Thesis, Harvard University, May 1990."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault tolerant distributed computation. In Proceedings of ACM STOC 1988, 1988.","DOI":"10.1145\/62212.62213"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M. Blum","year":"1983","unstructured":"M. Blum. How to exchange (secret) keys. ACM Transactions on Computer Systems, 1:175\u2013193, 1983.","journal-title":"ACM Transactions on Computer Systems"},{"key":"7_CR7","unstructured":"J. Camp, M. Harkavy, J. Tygar, and B. Yee. Anonymous atomic transactions. In 2nd USENIX Workshop on Electronic Commerce, pages 123\u2013134, November 1996."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. Multiparty unconditionally secure protocols. In Proceedings of ACM STOC 1988, 1988.","DOI":"10.1145\/62212.62214"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In IEEE Fondations of Computer Science, 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In IEEE Fondations of Computer Science, 1987.","DOI":"10.1109\/SFCS.1987.4"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Reiter. Fair exchange with a semi-trusted third party. In ACM Conference on Computer and Communication Security, April 1997.","DOI":"10.1145\/266420.266424"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of ACM STOC 1987, 1987.","DOI":"10.1145\/28395.28420"},{"key":"7_CR13","unstructured":"S. Ketchpel and H. Garcia-Molina. Making trust explicit in distributed commerce transactions. In IEEE ICDCS, 1996."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"M. Luby, S. Micali, and C. Rackoff. How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In IEEE Symposium on Foundations of Computer Science, pages 11\u201321, November 1984.","DOI":"10.1109\/SFCS.1983.25"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"J. Tygar. Atomicity in electronic commerce. In ACM Symposium on Principles of Distributed Computing, pages 8\u201326, 1996.","DOI":"10.1145\/248052.248054"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"U. Vazirani and V. Vazirani. Trapdoor pseudo-random number generators, with applications to protocol design. In IEEE Symposium on Foundations of Computer Science, pages 23\u201330, 1983.","DOI":"10.1109\/SFCS.1983.78"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T06:58:43Z","timestamp":1683529123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649519","9783540539186"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0055475","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}