{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:10:47Z","timestamp":1748751047558,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271361"},{"type":"electronic","value":"9783319271378"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-27137-8_38","type":"book-chapter","created":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T11:24:23Z","timestamp":1447673063000},"page":"517-531","source":"Crossref","is-referenced-by-count":1,"title":["Sky: Opinion Dynamics Based Consensus for P2P Network with Trust Relationships"],"prefix":"10.1007","author":[{"given":"Houwu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jiwu","family":"Shu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,16]]},"reference":[{"key":"38_CR1","unstructured":"Mean Field Theory (2005). http:\/\/en.wikipedia.org\/wiki\/Mean_field_theory"},{"key":"38_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 the 2013 IEEE Symposium on Security and Privacy, SP\u201913, pp. 382\u2013396. IEEE Computer Society, Washington, DC (2013)","DOI":"10.1109\/SP.2013.33"},{"key":"38_CR3","unstructured":"Aspnes, J., Jackson, C., Krishnamurthy, A.: Exposing computationally-challenged Byzantine impostors. Technical report YALEU\/DCS\/TR-1332, Yale University, Department of Computer Science (2005)"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Augustine, J., Pandurangan, G., Robinson, P.: Fast Byzantine agreement in dynamic networks. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013, pp. 74\u201383. ACM, New York (2013)","DOI":"10.1145\/2484239.2484275"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Bazzi, R.A., Konjevod, G.: On the establishment of distinct identities in overlay networks. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, pp. 312\u2013320. ACM, New York (2005)","DOI":"10.1145\/1073814.1073873"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Borisov, N.: Computational puzzles as sybil defenses. In: Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing, P2P 2006, pp. 171\u2013176. IEEE Computer Society, Washington, DC (2006)","DOI":"10.1109\/P2P.2006.10"},{"issue":"2","key":"38_CR7","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1103\/RevModPhys.81.591","volume":"81","author":"C Castellano","year":"2009","unstructured":"Castellano, C., Fortunato, S., Loreto, V.: Statistical physics of social dynamics. Rev. Mod. Phys. 81(2), 591\u2013646 (2009)","journal-title":"Rev. Mod. Phys."},{"issue":"SI","key":"38_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/844128.844156","volume":"36","author":"M Castro","year":"2002","unstructured":"Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure routing for structured peer-to-peer overlay networks. SIGOPS Oper. Syst. Rev. 36(SI), 299\u2013314 (2002)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"38_CR9","unstructured":"Cawrey, D.: Are 51\u00a0% attacks a real threat to bitcoin? 20 June 2014. http:\/\/www.coindesk.com\/51-attacks-real-threat-bitcoin\/"},{"issue":"2","key":"38_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"key":"38_CR11","unstructured":"Courtois, N.T., Bahack, L.: On subversive miner strategies and block withholding attack in bitcoin digital currency. CoRR abs\/1402.1718 (2014)"},{"key":"38_CR12","unstructured":"Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M.F., Morris, R.: Designing a DHT for low latency and high throughput. In: Proceedings of the 1st Conference on Symposium on Networked Systems Design and Implementation, NSDI 2004, vol. 1, pp. 7\u20137. USENIX Association, Berkeley (2004)"},{"key":"38_CR13","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, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251\u2013260. Springer, Heidelberg (2002)"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC 1986, pp. 370\u2013379. ACM, New York (1986)","DOI":"10.1145\/12130.12169"},{"issue":"2","key":"38_CR15","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"5","key":"38_CR16","doi-asserted-by":"publisher","first-page":"58004","DOI":"10.1209\/0295-5075\/91\/58004","volume":"91","author":"F Gargiulo","year":"2010","unstructured":"Gargiulo, F., Huet, S.: Opinion dynamics in a group-based society. EPL (Europhys. Lett.) 91(5), 58004 (2010)","journal-title":"EPL (Europhys. Lett.)"},{"key":"38_CR17","unstructured":"Kim, J.: Safety, liveness and fault tolerance\u2014the consensus choices stellar (2014). https:\/\/www.stellar.org\/blog\/safety_liveness_and_fault_tolerance_consensus_choice\/"},{"key":"38_CR18","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"key":"38_CR19","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2009). http:\/\/www.bitcoin.org\/bitcoin.pdf"},{"key":"38_CR20","unstructured":"Poelstra, A.: A treatise on altcoins (2014). https:\/\/download.wpsoftware.net\/bitcoin\/alts.pdf"},{"key":"38_CR21","unstructured":"Schwartz, D., Youngs, N., Britto, A.: The Ripple protocol consensus algorithm (2014). https:\/\/ripple.com\/files\/ripple_consensus_whitepaper.pdf"},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"Singh, A., Castro, M., Druschel, P., Rowstron, A.: Defending against eclipse attacks on overlay networks. In: Proceedings of the 11th Workshop on ACM SIGOPS European Workshop, EW 2011. ACM, New York (2004)","DOI":"10.1145\/1133572.1133613"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27137-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T12:04:46Z","timestamp":1748693086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27137-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271361","9783319271378"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27137-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}