{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:13:08Z","timestamp":1725541988359},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108761"},{"type":"electronic","value":"9783642108778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10877-8_13","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T07:11:04Z","timestamp":1259737864000},"page":"144-158","source":"Crossref","is-referenced-by-count":7,"title":["Decentralized Polling with Respectable Participants"],"prefix":"10.1007","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K\u00e9vin","family":"Huguenin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Monod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Kremsa Design, Inc. Facebook Poll, \n                    \n                      http:\/\/www.facebook.com\/apps\/application.php?id=20678178440"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","first-page":"251","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"J.C. Benaloh","year":"1987","unstructured":"Benaloh, J.C.: Secret sharing homomorphisms: Keeping shares of a secret secret. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 251\u2013260. Springer, Heidelberg (1987)"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M. Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical Byzantine Fault Tolerance and Proactive Recovery. TOCS\u00a020(4), 398\u2013461 (2002)","journal-title":"TOCS"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-77096-1_24","volume-title":"Principles of Distributed Systems","author":"C. Delporte-Gallet","year":"2007","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: Secretive birds: Privacy in population protocols. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol.\u00a04878, pp. 329\u2013342. Springer, Heidelberg (2007)"},{"key":"13_CR5","unstructured":"Doodle: Easy Scheduling, \n                    \n                      http:\/\/www.doodle.com"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36504-4_1","volume-title":"Financial Cryptography","author":"D. Malkhi","year":"2003","unstructured":"Malkhi, D., Margo, O., Pavlov, E.: E-Voting without \u2018Cryptography\u2019. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 1\u201315. Springer, Heidelberg (2003)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-36108-1","volume-title":"Financial Cryptography","author":"D. Malkhi","year":"2002","unstructured":"Malkhi, D., Pavlov, E.: Anonymity without \u2018Cryptography\u2019. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol.\u00a02339, pp. 108\u2013126. Springer, Heidelberg (2002)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In: STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"13_CR9","unstructured":"Richmond, R.: Facebook Tests the Power of Democracy, April 23 (2009)"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"R. Rivest","year":"1979","unstructured":"Rivest, R., Shamir, A., Tauman, Y.: How to Share a Secret. CACM\u00a022, 612\u2013613 (1979)","journal-title":"CACM"},{"key":"13_CR11","unstructured":"Rivest, R., Smith, W.: Three Vvoting Protocols: ThreeBallot, VAV, and twin. In: EVT, p. 16 (2007)"},{"key":"13_CR12","unstructured":"Stelter, B.: Facebook\u2019s Users Ask Who Owns Information, February, 17 (2009)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Yu, H., Gibbons, P., Kaminsky, M., Xiao, F.: SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks. In: SP, pp. 3\u201317 (2008)","DOI":"10.1109\/SP.2008.13"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10877-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:43:05Z","timestamp":1619782985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10877-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108761","9783642108778"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}