Efficient Network Path Verification for Policy-routedQueries
Title | Efficient Network Path Verification for Policy-routedQueries |
Publication Type | Conference Paper |
Year of Publication | 2016 |
Authors | Karumanchi, Sushama, Li, Jingwei, Squicciarini, Anna |
Conference Name | Proceedings of the Sixth ACM Conference on Data and Application Security and Privacy |
Publisher | ACM |
Conference Location | New York, NY, USA |
ISBN Number | 978-1-4503-3935-3 |
Keywords | Collaboration, composability, control theory, Human Behavior, malicious node detection, Metrics, network routing, p2p security, path verification, peer to peer security, peer-to-peer security, privacy, pubcrawl, query routing, Resiliency, resource discovery, Scalability, security |
Abstract | Resource discovery in unstructured peer-to-peer networks causes a search query to be flooded throughout the network via random nodes, leading to security and privacy issues. The owner of the search query does not have control over the transmission of its query through the network. Although algorithms have been proposed for policy-compliant query or data routing in a network, these algorithms mainly deal with authentic route computation and do not provide mechanisms to actually verify the network paths taken by the query. In this work, we propose an approach to deal with the problem of verifying network paths taken by a search query during resource discovery, and detection of malicious forwarding of search query. Our approach aims at being secure and yet very scalable, even in the presence of huge number of nodes in the network. |
URL | http://doi.acm.org/10.1145/2857705.2857715 |
DOI | 10.1145/2857705.2857715 |
Citation Key | karumanchi_efficient_2016 |