{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:45:13Z","timestamp":1725594313230},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642221361"},{"type":"electronic","value":"9783642221378"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22137-8_9","type":"book-chapter","created":{"date-parts":[[2011,7,4]],"date-time":"2011-07-04T04:41:54Z","timestamp":1309754514000},"page":"54-70","source":"Crossref","is-referenced-by-count":2,"title":["Cyberdice: Peer-to-Peer Gambling in the Presence of Cheaters"],"prefix":"10.1007","author":[{"given":"Frank","family":"Stajano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Clayton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Dolev, D.: Flipping Coins In Many Pockets (Byzantine Agreement On Uniformly Random Values). In: 25th Annual Symposium on Foundations of Computer Science, pp. 157\u2013170 (1984)","key":"9_CR1","DOI":"10.1109\/SFCS.1984.715912"},{"key":"9_CR2","first-page":"91","volume-title":"Randomness and Computation","author":"M. Ben-Or","year":"1989","unstructured":"Ben-Or, M., Linial, N.: Collective coin flipping. In: Micali, S. (ed.) Randomness and Computation, pp. 91\u2013115. Academic Press, New York (1989)"},{"doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Naor: Non-malleable cryptography. In: Annual ACM Symposium on Theory of Computing (STOC 1991), pp. 542\u2013552 (1991)","key":"9_CR3","DOI":"10.1145\/103418.103474"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"J.R. Douceur","year":"2002","unstructured":"Douceur, J.R.: The Sybil Attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 251\u2013260. Springer, Heidelberg (2002)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-78440-1_11","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"S. Faust","year":"2008","unstructured":"Faust, S., K\u00e4sper, E., Lucks, S.: Efficient Simultaneous Broadcast. In: Cramer, R. (ed.) PKC 2008. LNCS, vol.\u00a04939, pp. 180\u2013196. Springer, Heidelberg (2008)"},{"issue":"7","key":"9_CR6","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1109\/71.877748","volume":"11","author":"R. Gennaro","year":"2000","unstructured":"Gennaro, R.: A protocol to achieve independence in constant rounds. IEEE Transactions on Parallel Distribution Systems\u00a011(7), 636\u2013647 (2000)","journal-title":"IEEE Transactions on Parallel Distribution Systems"},{"issue":"3","key":"9_CR7","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 Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1086\/257177","volume":"LX","author":"H. Markowitz","year":"1952","unstructured":"Markowitz, H.: The Utility of Wealth. Journal of Political Economy\u00a0LX(2), 151\u2013158 (1952)","journal-title":"Journal of Political Economy"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"T. Rabin","year":"1998","unstructured":"Rabin, T.: A simplified approach to threshold and proactive RSA. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, p. 89. Springer, Heidelberg (1998)"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for Secure Computation. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pp. 160\u2013164 (1982)","key":"9_CR10","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Security Protocols XVI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22137-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T16:57:25Z","timestamp":1560358645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22137-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642221361","9783642221378"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22137-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}