{"title":"KarmaNET:利用可信的社会路径创建明智的转发器","authors":"M. Spear, Xiaoming Lu, N. Matloff, S. F. Wu","doi":"10.1109/ICFIN.2009.5339559","DOIUrl":null,"url":null,"abstract":"Many existing problems in distributed systems can be linked to routing being orthogonal to trust and ignoring the social connectivity. This paper introduces a novel and economical protocol, entitled KarmaNET, which binds any routing protocol with trust to build a trusted social path and create judicious forwarders. This creates incentives for nodes to build good karma, and excises any node that has accumulated too much bad karma. KarmaNET requires only local knowledge, cuts off malicious nodes at the source, adapts to dynamic changes in behavior, bounds the number of unwanted messages a node can generate in its lifetime (even in the presence of collusion, part-time spammers, and errors in marking the outcome), and achieves an expected 0 spams received per node in the limit. KarmaNET ostracizes spammers, freeloaders, and minimizes Sybil attacks with negligible false positive and negative rates (less than 0.5%). We theoretically prove bounds on the damage an attacker can cause, that KarmaNET achieves exponentially fast adaptation to a node's dynamic behavior, and show that our simulation matches the theory.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"KarmaNET: Leveraging trusted social paths to create judicious forwarders\",\"authors\":\"M. Spear, Xiaoming Lu, N. Matloff, S. F. Wu\",\"doi\":\"10.1109/ICFIN.2009.5339559\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many existing problems in distributed systems can be linked to routing being orthogonal to trust and ignoring the social connectivity. This paper introduces a novel and economical protocol, entitled KarmaNET, which binds any routing protocol with trust to build a trusted social path and create judicious forwarders. This creates incentives for nodes to build good karma, and excises any node that has accumulated too much bad karma. KarmaNET requires only local knowledge, cuts off malicious nodes at the source, adapts to dynamic changes in behavior, bounds the number of unwanted messages a node can generate in its lifetime (even in the presence of collusion, part-time spammers, and errors in marking the outcome), and achieves an expected 0 spams received per node in the limit. KarmaNET ostracizes spammers, freeloaders, and minimizes Sybil attacks with negligible false positive and negative rates (less than 0.5%). We theoretically prove bounds on the damage an attacker can cause, that KarmaNET achieves exponentially fast adaptation to a node's dynamic behavior, and show that our simulation matches the theory.\",\"PeriodicalId\":123746,\"journal\":{\"name\":\"2009 First International Conference on Future Information Networks\",\"volume\":\"109 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 First International Conference on Future Information Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICFIN.2009.5339559\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 First International Conference on Future Information Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFIN.2009.5339559","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
KarmaNET: Leveraging trusted social paths to create judicious forwarders
Many existing problems in distributed systems can be linked to routing being orthogonal to trust and ignoring the social connectivity. This paper introduces a novel and economical protocol, entitled KarmaNET, which binds any routing protocol with trust to build a trusted social path and create judicious forwarders. This creates incentives for nodes to build good karma, and excises any node that has accumulated too much bad karma. KarmaNET requires only local knowledge, cuts off malicious nodes at the source, adapts to dynamic changes in behavior, bounds the number of unwanted messages a node can generate in its lifetime (even in the presence of collusion, part-time spammers, and errors in marking the outcome), and achieves an expected 0 spams received per node in the limit. KarmaNET ostracizes spammers, freeloaders, and minimizes Sybil attacks with negligible false positive and negative rates (less than 0.5%). We theoretically prove bounds on the damage an attacker can cause, that KarmaNET achieves exponentially fast adaptation to a node's dynamic behavior, and show that our simulation matches the theory.