Efficient network path verification for policy-routed queries

Sushama Karumanchi, Jingwei Li, Anna Squicciarini

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationCODASPY 2016 - Proceedings of the 6th ACM Conference on Data and Application Security and Privacy
PublisherAssociation for Computing Machinery, Inc
Pages319-328
Number of pages10
ISBN (Electronic)9781450339353
DOIs
StatePublished - Mar 9 2016
Event6th ACM Conference on Data and Application Security and Privacy, CODASPY 2016 - New Orleans, United States
Duration: Mar 9 2016Mar 11 2016

Publication series

NameCODASPY 2016 - Proceedings of the 6th ACM Conference on Data and Application Security and Privacy

Other

Other6th ACM Conference on Data and Application Security and Privacy, CODASPY 2016
CountryUnited States
CityNew Orleans
Period3/9/163/11/16

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems
  • Software

Fingerprint Dive into the research topics of 'Efficient network path verification for policy-routed queries'. Together they form a unique fingerprint.

Cite this