{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T06:51:15Z","timestamp":1765608675122,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199548"},{"type":"electronic","value":"9783030199555"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_31","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"359-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Sybil-Resilient Conductance-Based Community Growth"],"prefix":"10.1007","author":[{"given":"Ouri","family":"Poupko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gal","family":"Shahaf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehud","family":"Shapiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"key":"31_CR1","unstructured":"Alon, N., Mossel, E., Pemantle, R.: Corruption detection on networks. arXiv preprint arXiv:1505.05637 (2015)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Alvisi, L., Clement, A., Epasto, A., Lattanzi, S., Panconesi, A.: Sok: the evolution of sybil defense via social networks. In: Proceedings of SP 2013, pp. 382\u2013396 (2013)","DOI":"10.1109\/SP.2013.33"},{"issue":"4\u20135","key":"31_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/0020-0190(81)90050-8","volume":"13","author":"M Blum","year":"1981","unstructured":"Blum, M., Karp, R.M., Vornberger, O., Papadimitriu, C.H., Yannakakis, M.: The complexity of testing whether a graph is a superconcentrator. Inf. Process. Lett. 13(4\u20135), 164\u2013167 (1981)","journal-title":"Inf. Process. Lett."},{"key":"31_CR4","unstructured":"Cao, Q., Sirivianos, M., Yang, X., Pregueiro, T.: Aiding the detection of fake accounts in large scale social online services. In: Proceedings of NSDI 2012, pp. 15\u201315 (2012)"},{"key":"31_CR5","unstructured":"Danezis, G., Mittal, P.: SybilInfer: detecting sybil nodes using social networks. In: Proceedings of NDSS 2009, pp. 1\u201315 (2009)"},{"key":"31_CR6","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":"JR Douceur","year":"2002","unstructured":"Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251\u2013260. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45748-8_24"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World (2010)","DOI":"10.1017\/CBO9780511761942"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Friedman, J.: A proof of Alon\u2019s second eigenvalue conjecture. In: Proceedings of STOC 2003, pp. 720\u2013724 (2003)","DOI":"10.1145\/780542.780646"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Jerrum, M., Sinclair, A.: Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved. In: Proceedings of STOC 1988, pp. 235\u2013244 (1988)","DOI":"10.1145\/62212.62234"},{"key":"31_CR11","unstructured":"Jerrum, M., Sinclair, A.: The Markov chain Monte Carlo method: an approach to approximate counting and integration. In: Approximation Algorithms for NP-hard Problems, pp. 482\u2013520 (1996)"},{"key":"31_CR12","unstructured":"Jin, Y., Mossel, E., Ramnarayan, G.: Being corrupt requires being clever, but detecting corruption doesn\u2019t. arXiv preprint arXiv:1809.10325 (2018)"},{"key":"31_CR13","unstructured":"Levine, B.N., Shields, C., Margolin, N.B.: A Survey of Solutions to the Sybil Attack, vol. 7, p. 224. University of Massachusetts Amherst (2006)"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Newsome, J., Shi, E., Song, D., Perrig, A.: The sybil attack in sensor networks: analysis & defenses. In: Proceedings of IPSN 2004, pp. 259\u2013268 (2004)","DOI":"10.1145\/984622.984660"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Shahaf, G., Shapiro, E., Talmon, N.: Sybil-resilient reality-aware social choice. arXiv preprint arXiv:1807.11105 (2019)","DOI":"10.24963\/ijcai.2019\/81"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Shapiro, E.: Global cryptodemocracy is possible and desirable. arXiv preprint arXiv:1804.02049 (2018)","DOI":"10.1007\/978-3-319-92719-0_60"},{"issue":"8","key":"31_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/3213766","volume":"61","author":"E Shapiro","year":"2018","unstructured":"Shapiro, E.: Point: foundations of e-democracy. Commun. ACM 61(8), 31\u201334 (2018)","journal-title":"Commun. ACM"},{"key":"31_CR18","unstructured":"Tran, D.N., Min, B., Li, J., Subramanian, L.: Sybil-resilient online content voting. In: Proceedings of NSDI 2009, pp. 15\u201328 (2009)"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Tran, N., Li, J., Subramanian, L., Chow, S.S.M.: Optimal sybil-resilient node admission control. In: Proceedings of IEEE INFOCOM 2011, pp. 3218\u20133226 (2011)","DOI":"10.1109\/INFCOM.2011.5935171"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Wei, W., Xu, F., Tan, C.C., Li, Q.: Sybildefender: defend against sybil attacks in large social networks. In: Proceedings of INFOCOM 2012, pp. 1951\u20131959 (2012)","DOI":"10.1109\/INFCOM.2012.6195572"},{"issue":"3","key":"31_CR21","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2034575.2034593","volume":"42","author":"H Yu","year":"2011","unstructured":"Yu, H.: Sybil defenses via social networks: a tutorial and survey. ACM SIGACT News 42(3), 80\u2013101 (2011)","journal-title":"ACM SIGACT News"},{"issue":"3","key":"31_CR22","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/TNET.2009.2034047","volume":"18","author":"H Yu","year":"2010","unstructured":"Yu, H., Gibbons, P.B., Kaminsky, M., Xiao, F.: Sybillimit: a near-optimal social network defense against sybil attacks. IEEE\/ACM Trans. Netw. (ToN) 18(3), 885\u2013898 (2010)","journal-title":"IEEE\/ACM Trans. Netw. (ToN)"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/1151659.1159945","volume":"36","author":"H Yu","year":"2006","unstructured":"Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.: Sybilguard: defending against sybil attacks via social networks. ACM SIGCOMM Comput. Commun. Rev. 36, 267\u2013278 (2006)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:03:54Z","timestamp":1710349434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}