{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:21Z","timestamp":1742913201546,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160226"},{"type":"electronic","value":"9783642160233"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16023-3_28","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T20:41:49Z","timestamp":1284928909000},"page":"332-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing in Social Networks"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Giurgiu","sequence":"first","affiliation":[]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"K\u00e9vin","family":"Huguenin","sequence":"additional","affiliation":[]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,20]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-47721-7_19","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"J. Benaloh","year":"1987","unstructured":"Benaloh, J.: 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)"},{"key":"28_CR2","doi-asserted-by":"publisher","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":"28_CR3","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for Secure Computations. In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"issue":"3","key":"28_CR4","first-page":"382","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine Generals Problem. ACM TPLS\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM TPLS"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Huguenin, K., Kermarrec, A.M., Monod, M.: Decentralized Polling with Respectable Participants. In: OPODIS, pp. 144\u2013158 (2009)","DOI":"10.1007\/978-3-642-10877-8_13"},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(87)90042-1","volume":"26","author":"Z. Galil","year":"1987","unstructured":"Galil, Z., Yung, M.: Partitioned Encryption and Achieving Simultaneity by Partitioning. Information Processing Letters\u00a026(2), 81\u201388 (1987)","journal-title":"Information Processing Letters"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-45172-3_15","volume-title":"Peer-to-Peer Systems II","author":"I. Gupta","year":"2003","unstructured":"Gupta, I., Birman, K., Linga, P., Demers, A., van Renesse, R.: Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, pp. 160\u2013169. Springer, Heidelberg (2003)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Vu, L.H., Aberer, K., Buchegger, S., Datta, A.: Enabling secure secret sharing in distributed online social networks. In: ACSAC, pp. 419\u2013428 (2009)","DOI":"10.1109\/ACSAC.2009.46"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"4","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in Networks of Passively Mobile Finite-state Sensors. Distributed Computing\u00a04, 235\u2013253 (2006)","journal-title":"Distributed Computing"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D. Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The Computational Power of Population Protocols. Distributed Computing\u00a020, 279\u2013304 (2007)","journal-title":"Distributed Computing"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11776178_4","volume-title":"Distributed Computing in Sensor Systems","author":"C. Delporte-Gallet","year":"2006","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: When Birds Die: Making Population Protocols Fault-tolerant. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol.\u00a04026, pp. 51\u201366. Springer, Heidelberg (2006)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-642-02930-1_40","volume-title":"Automata, Languages and Programming","author":"R. Guerraoui","year":"2009","unstructured":"Guerraoui, R., Ruppert, E.: Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 484\u2013495. Springer, Heidelberg (2009)"},{"key":"28_CR13","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":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C. Dwork","year":"2006","unstructured":"Dwork, C.: Differential Privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"28_CR15","first-page":"1010","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati, P.: Protecting Respondents\u2019 Identities in Microdata Release. TKDE\u00a013, 1010\u20131027 (2001)","journal-title":"TKDE"},{"key":"28_CR16","unstructured":"Roy, I., Setty, S.T., Kilzer, A., Shmatikov, V., Witchel, E.: Airavat: Security and Privacy for MapReduce. In: NSDI (2010)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16023-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T03:36:34Z","timestamp":1630726594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-16023-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160226","9783642160233"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16023-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"20 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}