Visible to the public Efficient Network Path Verification for Policy-routedQueries

TitleEfficient Network Path Verification for Policy-routedQueries
Publication TypeConference Paper
Year of Publication2016
AuthorsKarumanchi, Sushama, Li, Jingwei, Squicciarini, Anna
Conference NameProceedings of the Sixth ACM Conference on Data and Application Security and Privacy
Conference LocationNew York, NY, USA
ISBN Number978-1-4503-3935-3
KeywordsCollaboration, 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

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.

Citation Keykarumanchi_efficient_2016