Discovering credentials in the content centric network

In Kwan Yu; Bin Song; Jiseong Son; Doo Kwon Baik

doi:10.1109/ICOIN.2011.5723111

Discovering credentials in the content centric network

In Kwan Yu, Bin Song, Jiseong Son, Doo Kwon Baik

* Honorary professors

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Many trust management systems implicitly assume that the required credentials can be obtained without difficulty. In consequence, it is necessary to have a convenient way to discover desired credentials in the network for successful deployment of trust management systems. Obviously, in distributed environments, this assumption may not be easy to achieve due to failure of different components. In this paper, based on a content centric network architecture, we show that a simple naming convention can help to provide scalability, reliability and availability in retrieving desired credentials. Especially, our scheme utilizes the routing protocol provided by the content centric network, without constructing an overlay network as in Peer-to-Peer systems.

Original language	English
Title of host publication	International Conference on Information Networking 2011, ICOIN 2011
Pages	43-47
Number of pages	5
DOIs	https://doi.org/10.1109/ICOIN.2011.5723111
Publication status	Published - 2011
Event	International Conference on Information Networking 2011, ICOIN 2011 - Kuala Lumpur, Malaysia Duration: 2011 Jan 26 → 2011 Jan 28

Publication series

Name	International Conference on Information Networking 2011, ICOIN 2011

Other

Other	International Conference on Information Networking 2011, ICOIN 2011
Country/Territory	Malaysia
City	Kuala Lumpur
Period	11/1/26 → 11/1/28

ASJC Scopus subject areas

Computer Networks and Communications
Information Systems

Access to Document

10.1109/ICOIN.2011.5723111

Cite this

Yu, IK, Song, B, Son, J & Baik, DK 2011, Discovering credentials in the content centric network. in International Conference on Information Networking 2011, ICOIN 2011., 5723111, International Conference on Information Networking 2011, ICOIN 2011, pp. 43-47, International Conference on Information Networking 2011, ICOIN 2011, Kuala Lumpur, Malaysia, 11/1/26. https://doi.org/10.1109/ICOIN.2011.5723111

@inproceedings{34afd22a381546a0b555cd7c1d6299c2,

title = "Discovering credentials in the content centric network",

abstract = "Many trust management systems implicitly assume that the required credentials can be obtained without difficulty. In consequence, it is necessary to have a convenient way to discover desired credentials in the network for successful deployment of trust management systems. Obviously, in distributed environments, this assumption may not be easy to achieve due to failure of different components. In this paper, based on a content centric network architecture, we show that a simple naming convention can help to provide scalability, reliability and availability in retrieving desired credentials. Especially, our scheme utilizes the routing protocol provided by the content centric network, without constructing an overlay network as in Peer-to-Peer systems.",

author = "Yu, {In Kwan} and Bin Song and Jiseong Son and Baik, {Doo Kwon}",

year = "2011",

doi = "10.1109/ICOIN.2011.5723111",

language = "English",

isbn = "9781612846613",

series = "International Conference on Information Networking 2011, ICOIN 2011",

pages = "43--47",

booktitle = "International Conference on Information Networking 2011, ICOIN 2011",

note = "International Conference on Information Networking 2011, ICOIN 2011 ; Conference date: 26-01-2011 Through 28-01-2011",

}

TY - GEN

T1 - Discovering credentials in the content centric network

AU - Yu, In Kwan

AU - Song, Bin

AU - Son, Jiseong

AU - Baik, Doo Kwon

PY - 2011

Y1 - 2011

N2 - Many trust management systems implicitly assume that the required credentials can be obtained without difficulty. In consequence, it is necessary to have a convenient way to discover desired credentials in the network for successful deployment of trust management systems. Obviously, in distributed environments, this assumption may not be easy to achieve due to failure of different components. In this paper, based on a content centric network architecture, we show that a simple naming convention can help to provide scalability, reliability and availability in retrieving desired credentials. Especially, our scheme utilizes the routing protocol provided by the content centric network, without constructing an overlay network as in Peer-to-Peer systems.

AB - Many trust management systems implicitly assume that the required credentials can be obtained without difficulty. In consequence, it is necessary to have a convenient way to discover desired credentials in the network for successful deployment of trust management systems. Obviously, in distributed environments, this assumption may not be easy to achieve due to failure of different components. In this paper, based on a content centric network architecture, we show that a simple naming convention can help to provide scalability, reliability and availability in retrieving desired credentials. Especially, our scheme utilizes the routing protocol provided by the content centric network, without constructing an overlay network as in Peer-to-Peer systems.

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

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

U2 - 10.1109/ICOIN.2011.5723111

DO - 10.1109/ICOIN.2011.5723111

M3 - Conference contribution

AN - SCOPUS:79952968777

SN - 9781612846613

T3 - International Conference on Information Networking 2011, ICOIN 2011

SP - 43

EP - 47

BT - International Conference on Information Networking 2011, ICOIN 2011

T2 - International Conference on Information Networking 2011, ICOIN 2011

Y2 - 26 January 2011 through 28 January 2011

ER -

Discovering credentials in the content centric network

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this