Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Distributed hash tables (DHTs) provide efficient and scalable lookup mechanisms for locating data in peer-to-peer (p2p) networks. Several issues, hover, prevent DHT-based p2p networks from being widely deployed -- one of which is  security . Malicious peers may modify, drop, misroute lookup requests, or even collude to deny the availability of target data. To address these security concerns,  propose an extension to Chord named  Sechord . The main idea is that the source can determine whether the next hop is valid or invalid by estimating how far the next hop is from its finger pointer. If the next hop is too far away from the finger pointer, especially compared to the average distance beten two consecutive peers, the source can infer some ongoing malicious activities. Our modifications require no trust beten two nodes except node join. Moreover, each node utilizes locally available information to evaluate hops encountered during the lookup routing process for validity. These modifications have been implemented and evaluated in the presence of malicious nodes. Our results show that Sechord significantly enhances the security of structured p2p systems at the expense of slightly increased hop count.
['Keith Needels', 'Minseok Kwon']
I am writing a research paper on a idea Secure routing in peer-to-peer distributed hash tables
[{"from": "human", "value": "I am writing a research paper on a idea Secure routing in peer-to-peer distributed hash tables"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Distributed hash tables (DHTs) provide efficient and scalable lookup mechanisms for locating data in peer-to-peer (p2p) networks. Several issues, hover, prevent DHT-based p2p networks from being widely deployed -- one of which is  security . Malicious peers may modify, drop, misroute lookup requests, or even collude to deny the availability of target data. To address these security concerns,  propose an extension to Chord named  Sechord . The main idea is that the source can determine whether the next hop is valid or invalid by estimating how far the next hop is from its finger pointer. If the next hop is too far away from the finger pointer, especially compared to the average distance beten two consecutive peers, the source can infer some ongoing malicious activities. Our modifications require no trust beten two nodes except node join. Moreover, each node utilizes locally available information to evaluate hops encountered during the lookup routing process for validity. These modifications have been implemented and evaluated in the presence of malicious nodes. Our results show that Sechord significantly enhances the security of structured p2p systems at the expense of slightly increased hop count."}]