Securing resource discovery in content hosting networks

Sushama Karumanchi, Jingwei Li, Anna Squicciarini

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

Abstract

Secure search query routing is a long-standing problem in distributed networks, which has often been addressed using “all-ornothing” approaches, that require either full anonymity and encrypted routing or full trust on the routing nodes. An important problem with secure routing is how to guarantee the search query is transmitted in an expected way. In this paper, we tackle the problem of secure routing by considering a generic policy-driven routing approach, and focus on the steps required to verify in a fully distributed manner that a search query is routed in accordance to a requester’s preferences and detect cheating nodes. We present an efficient and effective verification method for query routes, that is agnostic to the specific routing algorithm being used and achieves strong security guarantees. We cast our approach in the context of content dissemination networks (CDN) and show through experimental evaluations the performance of our approach.

Original languageEnglish (US)
Title of host publicationLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
PublisherSpringer Verlag
Pages153-173
Number of pages21
DOIs
StatePublished - Jan 1 2015

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
Volume152
ISSN (Print)1867-8211

Fingerprint

Routing algorithms

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Karumanchi, S., Li, J., & Squicciarini, A. (2015). Securing resource discovery in content hosting networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (pp. 153-173). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 152). Springer Verlag. https://doi.org/10.1007/978-3-319-23829-6_12
Karumanchi, Sushama ; Li, Jingwei ; Squicciarini, Anna. / Securing resource discovery in content hosting networks. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST. Springer Verlag, 2015. pp. 153-173 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST).
@inbook{00f0d1e0e0e848608c884214bc1c118a,
title = "Securing resource discovery in content hosting networks",
abstract = "Secure search query routing is a long-standing problem in distributed networks, which has often been addressed using “all-ornothing” approaches, that require either full anonymity and encrypted routing or full trust on the routing nodes. An important problem with secure routing is how to guarantee the search query is transmitted in an expected way. In this paper, we tackle the problem of secure routing by considering a generic policy-driven routing approach, and focus on the steps required to verify in a fully distributed manner that a search query is routed in accordance to a requester’s preferences and detect cheating nodes. We present an efficient and effective verification method for query routes, that is agnostic to the specific routing algorithm being used and achieves strong security guarantees. We cast our approach in the context of content dissemination networks (CDN) and show through experimental evaluations the performance of our approach.",
author = "Sushama Karumanchi and Jingwei Li and Anna Squicciarini",
year = "2015",
month = "1",
day = "1",
doi = "10.1007/978-3-319-23829-6_12",
language = "English (US)",
series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",
publisher = "Springer Verlag",
pages = "153--173",
booktitle = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",
address = "Germany",

}

Karumanchi, S, Li, J & Squicciarini, A 2015, Securing resource discovery in content hosting networks. in Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, vol. 152, Springer Verlag, pp. 153-173. https://doi.org/10.1007/978-3-319-23829-6_12

Securing resource discovery in content hosting networks. / Karumanchi, Sushama; Li, Jingwei; Squicciarini, Anna.

Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST. Springer Verlag, 2015. p. 153-173 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 152).

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Securing resource discovery in content hosting networks

AU - Karumanchi, Sushama

AU - Li, Jingwei

AU - Squicciarini, Anna

PY - 2015/1/1

Y1 - 2015/1/1

N2 - Secure search query routing is a long-standing problem in distributed networks, which has often been addressed using “all-ornothing” approaches, that require either full anonymity and encrypted routing or full trust on the routing nodes. An important problem with secure routing is how to guarantee the search query is transmitted in an expected way. In this paper, we tackle the problem of secure routing by considering a generic policy-driven routing approach, and focus on the steps required to verify in a fully distributed manner that a search query is routed in accordance to a requester’s preferences and detect cheating nodes. We present an efficient and effective verification method for query routes, that is agnostic to the specific routing algorithm being used and achieves strong security guarantees. We cast our approach in the context of content dissemination networks (CDN) and show through experimental evaluations the performance of our approach.

AB - Secure search query routing is a long-standing problem in distributed networks, which has often been addressed using “all-ornothing” approaches, that require either full anonymity and encrypted routing or full trust on the routing nodes. An important problem with secure routing is how to guarantee the search query is transmitted in an expected way. In this paper, we tackle the problem of secure routing by considering a generic policy-driven routing approach, and focus on the steps required to verify in a fully distributed manner that a search query is routed in accordance to a requester’s preferences and detect cheating nodes. We present an efficient and effective verification method for query routes, that is agnostic to the specific routing algorithm being used and achieves strong security guarantees. We cast our approach in the context of content dissemination networks (CDN) and show through experimental evaluations the performance of our approach.

UR - http://www.scopus.com/inward/record.url?scp=84948130523&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84948130523&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-23829-6_12

DO - 10.1007/978-3-319-23829-6_12

M3 - Chapter

AN - SCOPUS:84948130523

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

SP - 153

EP - 173

BT - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

PB - Springer Verlag

ER -

Karumanchi S, Li J, Squicciarini A. Securing resource discovery in content hosting networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST. Springer Verlag. 2015. p. 153-173. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST). https://doi.org/10.1007/978-3-319-23829-6_12