{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:54:55Z","timestamp":1752674095720,"version":"3.40.3"},"publisher-location":"Cham","reference-count":158,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549206"},{"type":"electronic","value":"9783030549213"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-54921-3_2","type":"book-chapter","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T11:04:28Z","timestamp":1596020668000},"page":"19-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Resource Burning for Permissionless Systems (Invited Paper)"],"prefix":"10.1007","author":[{"given":"Diksha","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[]},{"given":"Maxwell","family":"Young","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/1064340.1064341","volume":"5","author":"M Abadi","year":"2005","unstructured":"Abadi, M., Burrows, M., Manasse, M., Wobber, T.: Moderately hard, memory-bound functions. ACM Trans. Internet Technol. (TOIT) 5(2), 299\u2013327 (2005)","journal-title":"ACM Trans. Internet Technol. (TOIT)"},{"key":"2_CR2","unstructured":"Abraham, I., Malkhi, D.: The Blockchain Consensus Layer and BFT. Bull. EATCS: Distrib. Comput. Column (2017)"},{"key":"2_CR3","unstructured":"Abraham, I., Malkhi, D., Dobzinski, O.: Land: stretch $$(1 + \\epsilon )$$ locality-aware networks for DHTs. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp. 550\u2013559 (2004)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Movahedi, M., Saia, J., Zamani, M.: Bootstrapping public blockchains without a trusted setup. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 366\u2013368. ACM (2019)","DOI":"10.1145\/3293611.3331570"},{"key":"2_CR5","unstructured":"Akoglu, L., Chandy, R., Faloutsos, C.: Opinion fraud detection in online reviews by network effects. In: Seventh International AAAI Conference on Weblogs and Social Media (2013)"},{"key":"2_CR6","unstructured":"Ali, I.M., Caprolu, M., Pietro, R.D.: Foundations, properties, and security applications of puzzles: a survey. CoRR abs\/1904.10164 (2019). http:\/\/arxiv.org\/abs\/1904.10164"},{"key":"2_CR7","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 IEEE Symposium on Security and Privacy, pp. 382\u2013396 (2013)","DOI":"10.1109\/SP.2013.33"},{"key":"2_CR8","unstructured":"Hertig, A.: Ethereum\u2019s big switch: the new roadmap to proof-of-stake (2017). urlwww.coindesk.com\/ethereums-big-switch-the-new-roadmap-to-proof-of-stake\/. Accessed 28 Nov 2019"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/972374.972382","volume":"34","author":"T Anderson","year":"2004","unstructured":"Anderson, T., Roscoe, T., Wetherall, D.: Preventing internet denial-of-service with capabilities. ACM SIGCOMM Comput. Commun. Rev. 34(1), 39\u201344 (2004)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-662-48000-7_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"M Andrychowicz","year":"2015","unstructured":"Andrychowicz, M., Dziembowski, S.: PoW-based distributed cryptography with no trusted setup. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 379\u2013399. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_19"},{"key":"2_CR11","unstructured":"Aspnes, J., Jackson, C., Krishnamurthy, A.: Exposing computationally-challenged byzantine impostors. Technical report, Technical Report YALEU\/DCS\/TR-1332, Yale University (2005). http:\/\/www.cs.yale.edu\/homes\/aspnes\/papers\/tr1332.pdf"},{"key":"2_CR12","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 384\u2013393 (2003)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-319-10879-7_31","volume-title":"Security and Cryptography for Networks","author":"G Ateniese","year":"2014","unstructured":"Ateniese, G., Bonacina, I., Faonio, A., Galesi, N.: Proofs of space: when space is of the essence. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 538\u2013557. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_31"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Augustine, J., Molla, A.R., Morsy, E., Pandurangan, G., Robinson, P., Upfal, E.: Storage and search in dynamic peer-to-peer networks. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 53\u201362 (2013)","DOI":"10.1145\/2486159.2486170"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Augustine, J., Pandurangan, G., Robinson, P.: Fast byzantine agreement in dynamic networks. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 74\u201383 (2013)","DOI":"10.1145\/2484239.2484275"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-662-48653-5_19","volume-title":"Distributed Computing","author":"J Augustine","year":"2015","unstructured":"Augustine, J., Pandurangan, G., Robinson, P.: Fast byzantine leader election in dynamic networks. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 276\u2013291. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48653-5_19"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Augustine, J., Pandurangan, G., Robinson, P., Roche, S., Upfal, E.: Enabling robust and efficient distributed computation in dynamic peer-to-peer networks. In: Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), pp. 350\u2013369 (2015)","DOI":"10.1109\/FOCS.2015.29"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Augustine, J., Pandurangan, G., Robinson, P., Upfal, E.: Towards robust and efficient computation in dynamic peer-to-peer networks. In: Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 551\u2013569 (2012)","DOI":"10.1137\/1.9781611973099.47"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44810-1_22","volume-title":"Security Protocols","author":"T Aura","year":"2001","unstructured":"Aura, T., Nikander, P., Leiwo, J.: DOS-resistant authentication with client puzzles. In: Christianson, B., Malcolm, J.A., Crispo, B., Roe, M. (eds.) Security Protocols 2000. LNCS, vol. 2133, pp. 170\u2013177. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44810-1_22"},{"key":"2_CR20","unstructured":"Awerbuch, B., Scheideler, C.: The hyperring: a low-congestion deterministic data structure for distributed environments. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 318\u2013327 (2004)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/11945529_20","volume-title":"Principles of Distributed Systems","author":"B Awerbuch","year":"2006","unstructured":"Awerbuch, B., Scheideler, C.: Robust random number generation for peer-to-peer systems. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 275\u2013289. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11945529_20"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Scheideler, C.: Towards a scalable and robust DHT. In: Proceedings of the 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 318\u2013327 (2006)","DOI":"10.1145\/1148109.1148163"},{"key":"2_CR23","unstructured":"Awerbuch, B., Scheideler, C.: Towards scalable and robust overlay networks. In: Proceedings of the 6th International Workshop on Peer-to-Peer Systems (IPTPS), p. n. pag. (2007)"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Baird, H.S., Moll, M.A., Wang, S.Y.: ScatterType: a legible but hard-to-segment CAPTCHA. In: Proceedings of the Eighth International Conference on Document Analysis and Recognition (ICDAR), pp. 935\u2013939 (2005)","DOI":"10.1109\/ICDAR.2005.205"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-319-96884-1_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"M Ball","year":"2018","unstructured":"Ball, M., Rosen, A., Sabin, M., Vasudevan, P.N.: Proofs of work from worst-case assumptions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 789\u2013819. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_26"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Bazzi, R.A., Konjevod, G.: On the establishment of distinct identities in overlay networks. In: Proceedings 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 312\u2013320 (2005)","DOI":"10.1145\/1073814.1073873"},{"issue":"3","key":"2_CR27","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/2695533.2695545","volume":"42","author":"I Bentov","year":"2014","unstructured":"Bentov, I., Lee, C., Mizrahi, A., Rosenfeld, M.: Proof of activity: extending bitcoin\u2019s proof of work via proof of stake [extended abstract] y. ACM SIGMETRICS Perform. Eval. Rev. 42(3), 34\u201337 (2014)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Beutel, A., Xu, W., Guruswami, V., Palow, C., Faloutsos, C.: CopyCatch: stopping group attacks by spotting lockstep behavior in social networks. In: Proceedings of the 22nd International Conference on World Wide Web (WWW), pp. 119\u2013130 (2013)","DOI":"10.1145\/2488388.2488400"},{"key":"2_CR29","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780195300574.001.0001","volume-title":"Playing for Real: A Text on Game Theory","author":"K Binmore","year":"2007","unstructured":"Binmore, K., et al.: Playing for Real: A Text on Game Theory. Oxford University Press, Oxford (2007)"},{"key":"2_CR30","unstructured":"BitcoinWiki: Bitcoinwiki network (2019). https:\/\/en.bitcoin.it\/wiki\/Network. Accessed 28 Nov 2019"},{"key":"2_CR31","unstructured":"Borisov, N.: Computational puzzles as sybil defenses. In: Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing (P2P), pp. 171\u2013176 (2006)"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure routing for structured peer-to-peer overlay networks. In: Proceedings of the 5th Usenix Symposium on Operating Systems Design and Implementation (OSDI), pp. 299\u2013314 (2002)","DOI":"10.1145\/844128.844156"},{"key":"2_CR33","unstructured":"CBS News, A.P.: Buyer beware: scourge of fake reviews hitting Amazon, Walmart and other major retailers (2019). https:\/\/www.cbsnews.com\/news\/buyer-beware-a-scourge-of-fake-online-reviews-is-hitting-amazon-walmart-and-other-major-retailers\/"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/11871637_14","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"DH Chau","year":"2006","unstructured":"Chau, D.H., Pandit, S., Faloutsos, C.: Detecting fraudulent personalities in networks of online auctioneers. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 103\u2013114. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871637_14"},{"key":"2_CR35","unstructured":"CoinDesk: Vulnerable? Ethereum\u2019s Casper Tech Takes Criticism at Curacao Event (2018). https:\/\/www.coindesk.com\/fundamentally-vulnerable-ethereums-casper-tech-takes-criticism-curacao"},{"key":"2_CR36","unstructured":"Cracked: I get paid to write fake reviews for amazon (2016). https:\/\/www.cracked.com\/personal-experiences-2376-i-get-paid-to-write-fake-reviews-amazon.html"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11555827_18","volume-title":"Computer Security \u2013 ESORICS 2005","author":"G Danezis","year":"2005","unstructured":"Danezis, G., Lesniewski-Laas, C., Kaashoek, M.F., Anderson, R.: Sybil-resistant DHT routing. In: di Vimercati, S.C., Syverson, P., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 305\u2013318. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11555827_18"},{"key":"2_CR38","unstructured":"Demirbas, M., Song, Y.: An RSSI-based scheme for sybil attack detection in wireless sensor networks. In: Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks (WOWMOM), pp. 564\u2013570 (2006)"},{"key":"2_CR39","unstructured":"Digiconomist: Bitcoin energy consumption index (2020). https:\/\/digiconomist.net\/bitcoin-energy-consumption"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Dinger, J., Hartenstein, H.: Defending the sybil attack in P2P networks: taxonomy, challenges, and a proposal for self-registration. In: Proceedings of the First International Conference on Availability, Reliability and Security (ARES), pp. 756\u2013763 (2006)","DOI":"10.1109\/ARES.2006.45"},{"key":"2_CR41","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":"2_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-45146-4_25","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"C Dwork","year":"2003","unstructured":"Dwork, C., Goldberg, A., Naor, M.: On memory-bound functions for fighting spam. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 426\u2013444. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_25"},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology \u2014 CRYPTO 1992","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via Processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_10"},{"key":"2_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-662-48000-7_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Dziembowski","year":"2015","unstructured":"Dziembowski, S., Faust, S., Kolmogorov, V., Pietrzak, K.: Proofs of space. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 585\u2013605. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_29"},{"key":"2_CR45","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J., et al.: Networks, Crowds, and Markets, vol. 8. Cambridge University Press, Cambridge (2010)"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Falkner, J., Piatek, M., John, J.P., Krishnamurthy, A., Anderson, T.: Profiling a million user DHT. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 129\u2013134 (2007)","DOI":"10.1145\/1298306.1298325"},{"key":"2_CR47","unstructured":"Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: Proceedings of the Thirteenth ACM Symposium on Discrete Algorithms (SODA), pp. 94\u2013103 (2002)"},{"key":"2_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11561071_71","volume-title":"Algorithms \u2013 ESA 2005","author":"A Fiat","year":"2005","unstructured":"Fiat, A., Saia, J., Young, M.: Making chord robust to byzantine attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 803\u2013814. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_71"},{"issue":"2","key":"2_CR49","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF00299889","volume":"23","author":"CD FitzGibbon","year":"1988","unstructured":"FitzGibbon, C.D., Fanshawe, J.H.: Stotting in Thomson\u2019s gazelles: an honest signal of condition. Behav. Ecol. Sociobiol. 23(2), 69\u201374 (1988)","journal-title":"Behav. Ecol. Sociobiol."},{"key":"2_CR50","unstructured":"Forbes: Amazon\u2019s fake review problem is getting worse (2019). https:\/\/www.forbes.com\/sites\/emmawoollacott\/2019\/04\/16\/amazons-fake-review-problem-is-getting-worse\/#f6988195f525"},{"issue":"1","key":"2_CR51","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2005.12.006","volume":"355","author":"P Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Gauron, P.: D2B: a de bruijn based content-addressable network. Theoret. Comput. Sci. 355(1), 65\u201379 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"2_CR53","doi-asserted-by":"crossref","unstructured":"Gil, S., Kumar, S., Mazumder, M., Katabi, D., Rus, D.: Guaranteeing spoof-resilient multi-robot networks. In: Proceedings of Robotics: Science and Systems, Rome, Italy, July 2015","DOI":"10.15607\/RSS.2015.XI.020"},{"key":"2_CR54","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles (SOSP), pp. 51\u201368 (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"2_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-662-45174-8_16","volume-title":"Distributed Computing","author":"S Gilbert","year":"2014","unstructured":"Gilbert, S., Newport, C., Zheng, C.: Who are you? Secure identities in ad hoc networks. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 227\u2013242. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45174-8_16"},{"key":"2_CR56","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Zheng, C.: SybilCast: broadcast on the open airwaves. In: Proceedings of the 25th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 130\u2013139 (2013)","DOI":"10.1145\/2486159.2486172"},{"key":"2_CR57","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Huc, F., Kermarrec, A.M.: Highly dynamic distributed computing with byzantine failures. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing (PODC), pp. 176\u2013183 (2013)","DOI":"10.1145\/2484239.2484263"},{"key":"2_CR58","doi-asserted-by":"crossref","unstructured":"Gupta, D., Saia, J., Young, M.: Proof of work without all the work. In: Proceedings of the 19th International Conference on Distributed Computing and Networking (ICDCN) (2018)","DOI":"10.1145\/3154273.3154333"},{"key":"2_CR59","doi-asserted-by":"crossref","unstructured":"Gupta, D., Saia, J., Young, M.: Peace through superior puzzling: an asymmetric sybil defense. In: Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1083\u20131094 (2019)","DOI":"10.1109\/IPDPS.2019.00115"},{"key":"2_CR60","unstructured":"Gupta, D., Saia, J., Young, M.: ToGCom: an asymmetric sybil defense. arXiv preprint arXiv:2006.02893 (2020)"},{"key":"2_CR61","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Optimal mechanism design and money burning. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 75\u201384 (2008)","DOI":"10.1145\/1374376.1374390"},{"key":"2_CR62","unstructured":"Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: a scalable overlay network with practical locality properties. In: USENIX Symposium on Internet Technologies and Systems (2003)"},{"key":"2_CR63","unstructured":"Heilman, E., Kendler, A., Zohar, A., Goldberg, S.: Eclipse attacks on bitcoin\u2019s peer-to-peer network. In: Proceedings of the 24th USENIX Conference on Security Symposium, pp. 129\u2013144 (2015)"},{"issue":"7","key":"2_CR64","doi-asserted-by":"publisher","first-page":"3634","DOI":"10.1016\/j.eswa.2014.12.029","volume":"42","author":"A Heydari","year":"2015","unstructured":"Heydari, A., AliTavakoli, M., Salim, N., Heydari, Z.: Detection of review spam: a survey. Expert Syst. Appl. 42(7), 3634\u20133642 (2015). https:\/\/doi.org\/10.1016\/j.eswa.2014.12.029. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417414008082","journal-title":"Expert Syst. Appl."},{"key":"2_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-540-39989-6_23","volume-title":"Distributed Computing","author":"K Hildrum","year":"2003","unstructured":"Hildrum, K., Kubiatowicz, J.: Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 321\u2013336. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39989-6_23"},{"key":"2_CR66","doi-asserted-by":"publisher","unstructured":"Hooi, B., Song, H.A., Beutel, A., Shah, N., Shin, K., Faloutsos, C.: FRAUDAR: bounding graph fraud in the face of camouflage. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 895\u2013904. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2939672.2939747","DOI":"10.1145\/2939672.2939747"},{"key":"2_CR67","doi-asserted-by":"crossref","unstructured":"Hou, R., Jahja, I., Luu, L., Saxena, P., Yu, H.: Randomized view reconciliation in permissionless distributed systems, pp. 2528\u20132536 (2018)","DOI":"10.1109\/INFOCOM.2018.8486394"},{"issue":"1","key":"2_CR68","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.geb.2004.03.006","volume":"51","author":"S Huck","year":"2005","unstructured":"Huck, S., M\u00fcller, W.: Burning money and (pseudo) first-mover advantages: an experimental study on forward induction. Games Econ. Behav. 51(1), 109\u2013127 (2005)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"2_CR69","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.clsr.2014.11.003","volume":"31","author":"KM Hunt","year":"2015","unstructured":"Hunt, K.M.: Gaming the system: fake online reviews v. consumer law. Comput. Law Secur. Rev. 31(1), 3\u201325 (2015). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0267364914001824","journal-title":"Comput. Law Secur. Rev."},{"key":"2_CR70","doi-asserted-by":"crossref","unstructured":"Hussain, A., Heidemann, J., Papadopoulos, C.: A framework for classifying denial of service attacks. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pp. 99\u2013110 (2003)","DOI":"10.1145\/863955.863968"},{"key":"2_CR71","unstructured":"Jagadish, H., Ooi, B.C., Vu, Q.H.: BATON: a balanced tree structure for peer-to-peer networks. In: Proceedings of the 31st International conference on Very Large Data Bases (VLDB), pp. 661\u2013672 (2005)"},{"key":"2_CR72","doi-asserted-by":"crossref","unstructured":"Jaiyeola, M.O., Patron, K., Saia, J., Young, M., Zhou, Q.M.: Tiny groups tackle byzantine adversaries. In: Proceedings of the IEEE International Parallel and Distributed Processing Symposium, IPDPS, pp. 1030\u20131039 (2018)","DOI":"10.1109\/IPDPS.2018.00112"},{"key":"2_CR73","doi-asserted-by":"crossref","unstructured":"Jindal, N., Liu, B.: Opinion spam and analysis. In: Proceedings of the 2008 International Conference on Web Search and Data Mining, pp. 219\u2013230 (2008)","DOI":"10.1145\/1341531.1341560"},{"key":"2_CR74","doi-asserted-by":"crossref","unstructured":"Johansen, H., Allavena, A., van Renesse, R.: Fireflies: scalable support for intrusion-tolerant network overlays. In: ACM SIGOPS Operating Systems Review, pp. 3\u201313 (2006)","DOI":"10.1145\/1218063.1217937"},{"key":"2_CR75","doi-asserted-by":"crossref","unstructured":"John, R., Cherian, J.P., Kizhakkethottam, J.J.: A survey of techniques to prevent sybil attacks. In: Proceedings of the International Conference on Soft-Computing and Networks Security (ICSNS), pp. 1\u20136 (2015)","DOI":"10.1109\/ICSNS.2015.7292385"},{"key":"2_CR76","unstructured":"Juels, A., Brainard, J.: Client puzzles: a cryptographic countermeasure against connection depletion attacks. In: Proceedings of the Network and Distributed System Security Symposium (NDSS), pp. 151\u2013165 (1999)"},{"key":"2_CR77","unstructured":"Kaiser, E., Feng, W.C.: Mod$$\\_$$kaPoW: mitigating DoS with transparent proof-of-work. In: Proceedings of the 2007 ACM CoNEXT Conference, pp. 74:1\u201374:2 (2007)"},{"key":"2_CR78","unstructured":"Kapadia, A., Triandopoulos, N.: Halo: High-assurance locate for distributed hash tables. In: Proceedings of the Network and Distributed System Security Symposium (NDSS) (2008)"},{"key":"2_CR79","unstructured":"Karami, A., Zhou, B.: Online review spam detection by new linguistic features. In: iConference 2015 Proceedings (2015)"},{"key":"2_CR80","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-45172-3_9","volume-title":"Peer-to-Peer Systems II","author":"MF Kaashoek","year":"2003","unstructured":"Kaashoek, M.F., Karger, D.R.: Koorde: a simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 98\u2013107. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45172-3_9"},{"key":"2_CR81","unstructured":"Katz, J., Miller, A., Shi, E.: Pseudonymous secure computation from time-lock puzzles. IACR Cryptol. ePrint Arch. 2014, 857 (2014). http:\/\/eprint.iacr.org\/2014\/857"},{"key":"2_CR82","first-page":"40","volume":"2","author":"SM Khan","year":"2010","unstructured":"Khan, S.M., Mallesh, N., Nambiar, A., Wright, M.K.: The dynamics of salsa: a robust structured P2P system. Netw. Protocols Algorithms 2, 40\u201360 (2010)","journal-title":"Netw. Protocols Algorithms"},{"key":"2_CR83","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-63688-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Kiayias","year":"2017","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 357\u2013388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12"},{"key":"2_CR84","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-03089-0_8","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"J Knockel","year":"2013","unstructured":"Knockel, J., Saad, G., Saia, J.: Self-healing of byzantine faults. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol. 8255, pp. 98\u2013112. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03089-0_8"},{"key":"2_CR85","unstructured":"Laurie, B., Clayton, R.: \u201cProof-of-work\u201d proves not to work. In: Proceedings of the 3rd Annual Workshop on Economics and Information Security (WEIS) (2004)"},{"key":"2_CR86","unstructured":"Lesniewski-Laas, C., Kaashoek, M.F.: Whanau: a sybil-proof distributed hash table. In: Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, NSDI 2010 , p. 8 (2010)"},{"key":"2_CR87","doi-asserted-by":"crossref","unstructured":"Li, D., Lu, X., Wu, J.: FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs. In: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1677\u20131688 (2005)","DOI":"10.1109\/INFCOM.2005.1498449"},{"key":"2_CR88","doi-asserted-by":"crossref","unstructured":"Li, F., Mittal, P., Caesar, M., Borisov, N.: SybilControl: practical sybil defense with computational puzzles. In: Proceedings of the Seventh ACM Workshop on Scalable Trusted Computing, pp. 67\u201378 (2012)","DOI":"10.1145\/2382536.2382548"},{"issue":"5","key":"2_CR89","first-page":"653","volume":"19","author":"IC Lin","year":"2017","unstructured":"Lin, I.C., Liao, T.C.: A survey of blockchain security issues and challenges. IJ Netw. Secur. 19(5), 653\u2013659 (2017)","journal-title":"IJ Netw. Secur."},{"key":"2_CR90","doi-asserted-by":"crossref","unstructured":"Liu, D., Camp, L.J.: Proof of work can work. In: Proceedings of the 5th Workshop on the Economics of Information Security (WEIS) (2006)","DOI":"10.2139\/ssrn.941190"},{"issue":"11","key":"2_CR91","doi-asserted-by":"publisher","first-page":"2376","DOI":"10.1109\/TMC.2015.2398425","volume":"14","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Bild, D.R., Dick, R.P., Mao, Z.M., Wallach, D.S.: The Mason test: a defense against sybil attacks in wireless networks without trusted authorities. IEEE Trans. Mob. Comput. 14(11), 2376\u20132391 (2015)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"2_CR92","doi-asserted-by":"crossref","unstructured":"Luu, L., Narayanan, V., Zheng, C., Baweja, K., Gilbert, S., Saxena, P.: A secure sharding protocol for open blockchains. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (CCS), pp. 17\u201330 (2016)","DOI":"10.1145\/2976749.2978389"},{"issue":"2","key":"2_CR93","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10603-012-9216-7","volume":"36","author":"J Malbon","year":"2013","unstructured":"Malbon, J.: Taking fake online consumer reviews seriously. J. Consum. Policy 36(2), 139\u2013157 (2013)","journal-title":"J. Consum. Policy"},{"key":"2_CR94","doi-asserted-by":"crossref","unstructured":"Malliga, S., Tamilarasi, A., Janani, M.: Filtering spoofed traffic at source end for defending against DoS\/DDoS attacks. In: Proceedings of the International Conference on Computing, Communication and Networking, pp. 1\u20135. IEEE (2008)","DOI":"10.1109\/ICCCNET.2008.4787695"},{"key":"2_CR95","doi-asserted-by":"crossref","unstructured":"Mankins, D., Krishnan, R., Boyd, C., Zao, J., Frentz, M.: Mitigating distributed denial of service attacks with dynamic resource pricing. In: Proceedings of the Seventeenth Annual Computer Security Applications Conference, pp. 411\u2013421. IEEE (2001)","DOI":"10.21236\/ADA406438"},{"key":"2_CR96","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45748-8_5","volume-title":"Peer-to-Peer Systems","author":"P Maymounkov","year":"2002","unstructured":"Maymounkov, P., Mazi\u00e8res, D.: Kademlia: a peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53\u201365. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45748-8_5"},{"key":"2_CR97","unstructured":"Miller, A., et al.: Discovering bitcoin\u2019s public topology and influential nodes (2015). http:\/\/cs.umd.edu\/projects\/coinscope\/coinscope.pdf"},{"key":"2_CR98","volume-title":"Spent: Sex, Evolution, and Consumer Behavior","author":"G Miller","year":"2009","unstructured":"Miller, G.: Spent: Sex, Evolution, and Consumer Behavior. Penguin, New York (2009)"},{"key":"2_CR99","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-05149-9_5","volume-title":"Information Security Applications","author":"A Mohaisen","year":"2014","unstructured":"Mohaisen, A., Hollenbeck, S.: Improving social network-based sybil defenses by rewiring and augmenting social graphs. In: Kim, Y., Lee, H., Perrig, A. (eds.) WISA 2013. LNCS, vol. 8267, pp. 65\u201380. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05149-9_5"},{"issue":"6","key":"2_CR100","doi-asserted-by":"publisher","first-page":"480","DOI":"10.6029\/smartcr.2013.06.009","volume":"3","author":"A Mohaisen","year":"2013","unstructured":"Mohaisen, A., Kim, J.: The sybil attacks and defenses: a survey. Smart Comput. Rev. 3(6), 480\u2013489 (2013)","journal-title":"Smart Comput. Rev."},{"key":"2_CR101","unstructured":"M\u00f3nica, D., Leitao, L., Rodrigues, L., Ribeiro, C.: On the use of radio resource tests in wireless ad-hoc networks. In: Proceedings of the 3rd Workshop on Recent Advances on Intrusion-Tolerant Systems, pp. 21\u201326 (2009)"},{"key":"2_CR102","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-030-26948-7_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"T Moran","year":"2019","unstructured":"Moran, T., Orlov, I.: Simple proofs of space-time and rational proofs of storage. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 381\u2013409. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_14"},{"key":"2_CR103","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). http:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"2_CR104","doi-asserted-by":"crossref","unstructured":"Nambiar, A., Wright, M.: Salsa: a structured approach to large-scale anonymity. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 17\u201326 (2006)","DOI":"10.1145\/1180405.1180409"},{"key":"2_CR105","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2003)","DOI":"10.1145\/777412.777421"},{"key":"2_CR106","doi-asserted-by":"crossref","unstructured":"Newsome, J., Shi, E., Song, D., Perrig, A.: The sybil attack in sensor networks: analysis & defenses. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN), pp. 259\u2013268 (2004)","DOI":"10.1145\/984622.984660"},{"key":"2_CR107","unstructured":"Nolan, C.: The Dark Knight. Quote from the scene where the Joker sets a large pile of money ablaze (2008)"},{"key":"2_CR108","doi-asserted-by":"crossref","unstructured":"Noureddine, M.A., et al.: Revisiting client puzzles for state exhaustion attacks resilience. In: Proceedings of the 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 617\u2013629 (2019)","DOI":"10.1109\/DSN.2019.00067"},{"key":"2_CR109","doi-asserted-by":"crossref","unstructured":"Oikonomou, G., Mirkovic, J.: Modeling human behavior for defense against flash-crowd attacks. In: Proceedings of the IEEE International Conference on Communications, pp. 1\u20136. IEEE (2009)","DOI":"10.1109\/ICC.2009.5199191"},{"key":"2_CR110","unstructured":"Ott, M., Choi, Y., Cardie, C., Hancock, J.T.: Finding deceptive opinion spam by any stretch of the imagination. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, pp. 309\u2013319. Association for Computational Linguistics, USA (2011)"},{"key":"2_CR111","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-58387-6_26","volume-title":"Financial Cryptography and Data Security","author":"S Park","year":"2018","unstructured":"Park, S., Kwon, A., Fuchsbauer, G., Ga\u017ei, P., Alwen, J., Pietrzak, K.: SpaceMint: a cryptocurrency based on proofs of space. In: Meiklejohn, S., Sako, K. (eds.) FC 2018. LNCS, vol. 10957, pp. 480\u2013499. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-58387-6_26"},{"issue":"4","key":"2_CR112","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/1282427.1282413","volume":"37","author":"B Parno","year":"2007","unstructured":"Parno, B., Wendlandt, D., Shi, E., Perrig, A., Maggs, B., Hu, Y.C.: Portcullis: protecting connection setup from denial-of-capability attacks. ACM SIGCOMM Comput. Commun. Rev. 37(4), 289\u2013300 (2007)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"3","key":"2_CR113","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1086\/377051","volume":"78","author":"DJ Penn","year":"2003","unstructured":"Penn, D.J.: The evolutionary roots of our environmental problems: toward a darwinian ecology. Q. Rev. Biol. 78(3), 275\u2013301 (2003)","journal-title":"Q. Rev. Biol."},{"issue":"3","key":"2_CR114","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1038\/scientificamerican0312-23","volume":"306","author":"D Pogue","year":"2012","unstructured":"Pogue, D.: Time to kill off captchas. Sci. Am. 306(3), 23\u201323 (2012)","journal-title":"Sci. Am."},{"key":"2_CR115","doi-asserted-by":"publisher","unstructured":"Rayana, S., Akoglu, L.: Collective opinion spam detection: bridging review networks and metadata. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2015, pp. 985\u2013994. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2783258.2783370","DOI":"10.1145\/2783258.2783370"},{"key":"2_CR116","doi-asserted-by":"crossref","unstructured":"Rowaihy, H., Enck, W., McDaniel, P., La Porta, T.: Limiting Sybil attacks in structured P2P networks. In: Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM), pp. 2596\u20132600 (2007)","DOI":"10.1109\/INFCOM.2007.328"},{"key":"2_CR117","doi-asserted-by":"crossref","unstructured":"Rowstron, A.I.T., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Proceedings of the IFIP\/ACM International Conference on Distributed Systems Platforms, pp. 329\u2013350 (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"2_CR118","doi-asserted-by":"crossref","unstructured":"Saad, G.: The Evolutionary Bases of Consumption. Psychology Press (2007)","DOI":"10.4324\/9780203936993"},{"issue":"2","key":"2_CR119","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.obhdp.2009.06.001","volume":"110","author":"G Saad","year":"2009","unstructured":"Saad, G., Vongas, J.G.: The effect of conspicuous consumption on men\u2019s testosterone levels. Organ. Behav. Hum. Decis. Process. 110(2), 80\u201392 (2009)","journal-title":"Organ. Behav. Hum. Decis. Process."},{"key":"2_CR120","doi-asserted-by":"crossref","unstructured":"Saad, G., Saia, J.: Self-healing computation. In: Proceedings of the International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 195\u2013210 (2014)","DOI":"10.1007\/978-3-319-11764-5_14"},{"issue":"6","key":"2_CR121","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00446-016-0290-y","volume":"30","author":"G Saad","year":"2017","unstructured":"Saad, G., Saia, J.: A theoretical and empirical evaluation of an algorithm for self-healing computation. Distrib. Comput. 30(6), 391\u2013412 (2017)","journal-title":"Distrib. Comput."},{"issue":"4","key":"2_CR122","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ipl.2007.11.004","volume":"106","author":"J Saia","year":"2008","unstructured":"Saia, J., Young, M.: Reducing communication costs in robust peer-to-peer networks. Inform. Process. Lett. 106(4), 152\u2013158 (2008)","journal-title":"Inform. Process. Lett."},{"issue":"22","key":"2_CR123","doi-asserted-by":"publisher","first-page":"8650","DOI":"10.1016\/j.eswa.2015.07.019","volume":"42","author":"D Savage","year":"2015","unstructured":"Savage, D., Zhang, X., Yu, X., Chou, P., Wang, Q.: Detection of opinion spam based on anomalous rating deviation. Expert Syst. Appl. 42(22), 8650\u20138657 (2015). https:\/\/doi.org\/10.1016\/j.eswa.2015.07.019. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417415004790","journal-title":"Expert Syst. Appl."},{"key":"2_CR124","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-642-02930-1_47","volume-title":"Automata, Languages and Programming","author":"C Scheideler","year":"2009","unstructured":"Scheideler, C., Schmid, S.: A distributed and oblivious heap. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 571\u2013582. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_47"},{"issue":"1","key":"2_CR125","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/2146382.2146389","volume":"46","author":"S Sen","year":"2012","unstructured":"Sen, S., Freedman, M.J.: Commensal cuckoo: secure group partitioning for large-scale services. ACM SIGOPS Oper. Syst. 46(1), 33\u201339 (2012)","journal-title":"ACM SIGOPS Oper. Syst."},{"key":"2_CR126","doi-asserted-by":"crossref","unstructured":"Shoker, A.: Sustainable blockchain through proof of exercise. In: 2017 IEEE 16th International Symposium on Network Computing and Applications (NCA), pp. 1\u20139. IEEE (2017)","DOI":"10.1109\/NCA.2017.8171383"},{"key":"2_CR127","doi-asserted-by":"crossref","unstructured":"Singh, A., Ngan, T.W., Druschel, P., Wallach, D.S.: Eclipse attacks on overlay networks: threats and defenses. In: Proceedings IEEE International Conference on Computer Communications (INFOCOM), pp. 1\u201312 (2006)","DOI":"10.1109\/INFOCOM.2006.231"},{"key":"2_CR128","doi-asserted-by":"crossref","unstructured":"Steiner, M., En-Najjary, T., Biersack, E.W.: A global view of KAD. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 117\u2013122 (2007)","DOI":"10.1145\/1298306.1298323"},{"key":"2_CR129","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pp. 149\u2013160 (2001)","DOI":"10.1145\/964723.383071"},{"issue":"1","key":"2_CR130","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I Stoica","year":"2003","unstructured":"Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans. Netw. 11(1), 17\u201332 (2003). https:\/\/doi.org\/10.1109\/TNET.2002.808407","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"4","key":"2_CR131","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1037\/a0021669","volume":"100","author":"JM Sundie","year":"2011","unstructured":"Sundie, J.M., Kenrick, D.T., Griskevicius, V., Tybur, J.M., Vohs, K.D., Beal, D.J.: Peacocks, porsches, and thorstein veblen: Conspicuous consumption as a sexual signaling system. J. Pers. Soc. Psychol. 100(4), 664 (2011)","journal-title":"J. Pers. Soc. Psychol."},{"key":"2_CR132","doi-asserted-by":"crossref","unstructured":"Tegeler, F., Fu, X.: SybilConf: computational puzzles for confining sybil attacks. In: Proceedings of the IEEE Conference on Computer Communications Workshops (INFOCOM), pp. 1\u20132 (2010)","DOI":"10.1109\/INFCOMW.2010.5466685"},{"key":"2_CR133","unstructured":"The Guardian, G.M.: The need to protect the internet from \u2018astroturfing\u2019 grows ever more urgent (2011). https:\/\/www.theguardian.com\/environment\/georgemonbiot\/2011\/feb\/23\/need-to-protect-internet-from-astroturfing"},{"key":"2_CR134","volume-title":"The Theory of the Leisure Class: An Economic Study of Institutions","author":"V Thorstein","year":"1912","unstructured":"Thorstein, V.: The Theory of the Leisure Class: An Economic Study of Institutions. BW Huebsch, New York (1912)"},{"issue":"2","key":"2_CR135","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1883612.1883615","volume":"43","author":"G Urdaneta","year":"2011","unstructured":"Urdaneta, G., Pierre, G., van Steen, M.: A survey of DHT security techniques. ACM Comput. Surv. 43(2), 1\u201353 (2011)","journal-title":"ACM Comput. Surv."},{"key":"2_CR136","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/3-540-39200-9_18","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2003","author":"L von Ahn","year":"2003","unstructured":"von Ahn, L., Blum, M., Hopper, N.J., Langford, J.: CAPTCHA: using hard AI problems for security. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 294\u2013311. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_18"},{"issue":"5895","key":"2_CR137","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1126\/science.1160379","volume":"321","author":"L Von Ahn","year":"2008","unstructured":"Von Ahn, L., Maurer, B., McMillen, C., Abraham, D., Blum, M.: reCAPTCHA: human-based character recognition via web security measures. Science 321(5895), 1465\u20131468 (2008)","journal-title":"Science"},{"key":"2_CR138","doi-asserted-by":"crossref","unstructured":"Walfish, M., Vutukuru, M., Balakrishnan, H., Karger, D., Shenker, S.: DDoS defense by offense. In: Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pp. 303\u2013314 (2006)","DOI":"10.1145\/1151659.1159948"},{"issue":"1","key":"2_CR139","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1731060.1731063","volume":"28","author":"M Walfish","year":"2010","unstructured":"Walfish, M., Vutukuru, M., Balakrishnan, H., Karger, D., Shenker, S.: DDoS defense by offense. ACM Trans. Comput. Syst. (TOCS) 28(1), 3 (2010)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"2_CR140","unstructured":"Wang, H., Zhu, Y., Hu, Y.: An efficient and secure peer-to-peer overlay network. In: Proceedings of the IEEE Conference on Local Computer Networks, pp. 764\u2013771 (2005)"},{"key":"2_CR141","doi-asserted-by":"crossref","unstructured":"Wang, L., Kangasharju, J.: Measuring large-scale distributed systems: case of BitTorrent mainline DHT. In: IEEE 13th International Conference on Peer-to-Peer Computing (P2P), pp. 1\u201310 (2013)","DOI":"10.1109\/P2P.2013.6688697"},{"key":"2_CR142","unstructured":"Wang, X., Reiter, M.K.: Defending against denial-of-service attacks with puzzle auctions. In: Proceedings of the 2003 IEEE Symposium on Security and Privacy, p. 78 (2003)"},{"issue":"12","key":"2_CR143","doi-asserted-by":"publisher","first-page":"2492","DOI":"10.1109\/TPDS.2013.9","volume":"24","author":"W Wei","year":"2013","unstructured":"Wei, W., Xu, F., Tan, C.C., Li, Q.: SybilDefender: a defense mechanism for sybil attacks in large social networks. IEEE Trans. Parallel Distrib. Syst. 24(12), 2492\u20132502 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2_CR144","doi-asserted-by":"publisher","first-page":"113280","DOI":"10.1016\/j.dss.2020.113280","volume":"132","author":"Y Wu","year":"2020","unstructured":"Wu, Y., Ngai, E.W., Wu, P., Wu, C.: Fake online reviews: literature review, synthesis, and directions for future research. Decis. Support Syst. 132, 113280 (2020). https:\/\/doi.org\/10.1016\/j.dss.2020.113280. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S016792362030035X","journal-title":"Decis. Support Syst."},{"key":"2_CR145","doi-asserted-by":"publisher","unstructured":"Xie, S., Wang, G., Lin, S., Yu, P.S.: Review spam detection via temporal pattern discovery. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 823\u2013831. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2339530.2339662","DOI":"10.1145\/2339530.2339662"},{"key":"2_CR146","doi-asserted-by":"publisher","unstructured":"Xie, S., Wang, G., Lin, S., Yu, P.S.: Review spam detection via time series pattern discovery. In: Proceedings of the 21st International Conference on World Wide Web, WWW 2012 Companion, pp. 635\u2013636. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2187980.2188164","DOI":"10.1145\/2187980.2188164"},{"issue":"2","key":"2_CR147","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/MC.2010.275","volume":"44","author":"J Yan","year":"2011","unstructured":"Yan, J., El Ahmad, A.S.: Captcha robustness: a security engineering perspective. Computer 44(2), 54\u201360 (2011)","journal-title":"Computer"},{"key":"2_CR148","doi-asserted-by":"publisher","unstructured":"Yan, J., El Ahmad, A.S.: Usability of CAPTCHAs or usability issues in CAPTCHA design. In: Proceedings of the 4th Symposium on Usable Privacy and Security, SOUPS 2008, pp. 44\u201352. Association for Computing Machinery, New York (2008). https:\/\/doi.org\/10.1145\/1408664.1408671","DOI":"10.1145\/1408664.1408671"},{"issue":"6","key":"2_CR149","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1109\/TNET.2007.914506","volume":"16","author":"X Yang","year":"2008","unstructured":"Yang, X., Wetherall, D., Anderson, T.: TVA: A DoS-limiting network architecture. IEEE\/ACM Trans. Netw. 16(6), 1267\u20131280 (2008)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"2_CR150","doi-asserted-by":"crossref","unstructured":"Ma, Y., Li, F.: Detecting review spam: challenges and opportunities. In: 8th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom), pp. 651\u2013654 (2012)","DOI":"10.4108\/icst.collaboratecom.2012.250640"},{"issue":"1","key":"2_CR151","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/TNET.2012.2195729","volume":"21","author":"M Young","year":"2013","unstructured":"Young, M., Kate, A., Goldberg, I., Karsten, M.: Towards practical communication in Byzantine-resistant DHTs. IEEE\/ACM Trans. Netw. 21(1), 190\u2013203 (2013)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"2_CR152","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. SIGACT News 42(3), 80\u2013101 (2011)","journal-title":"SIGACT News"},{"issue":"3","key":"2_CR153","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. 18(3), 885\u2013898 (2010)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"2_CR154","doi-asserted-by":"crossref","unstructured":"Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.: SybilGuard: defending against sybil attacks via social networks. In: Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) vol. 36, pp. 267\u2013278, August 2006","DOI":"10.1145\/1151659.1159945"},{"key":"2_CR155","doi-asserted-by":"crossref","unstructured":"Yu, S., Thapngam, T., Liu, J., Wei, S., Zhou, W.: Discriminating DDoS flows from flash crowds using information distance. In: Proceedings of the Third International Conference on Network and System Security, pp. 351\u2013356. IEEE (2009)","DOI":"10.1109\/NSS.2009.29"},{"issue":"1","key":"2_CR156","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-5193(75)90111-3","volume":"53","author":"A Zahavi","year":"1975","unstructured":"Zahavi, A.: Mate selection - a selection for a handicap. J. Theor. Biol. 53(1), 205\u2013214 (1975)","journal-title":"J. Theor. Biol."},{"issue":"4","key":"2_CR157","doi-asserted-by":"publisher","first-page":"2046","DOI":"10.1109\/SURV.2013.031413.00127","volume":"15","author":"ST Zargar","year":"2013","unstructured":"Zargar, S.T., Joshi, J., Tipper, D.: A survey of defense mechanisms against distributed denial of service (DDoS) flooding attacks. IEEE Commun. Surv. Tutor. 15(4), 2046\u20132069 (2013)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"2_CR158","unstructured":"Zatloukal, K.C., Harvey, N.J.A.: Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 308\u2013317 (2004)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54921-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T23:58:15Z","timestamp":1723334295000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54921-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549206","9783030549213"],"references-count":158,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54921-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2020.cs.uni-paderborn.de\/","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":"41","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":"19","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":"46% - 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":"11","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}