TY - GEN
T1 - Identity-based registry for secure interdomain routing
AU - Kim, E. Yong
AU - Nahrstedt, Klara
AU - Xiao, Li
AU - Park, Kunsoo
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2006
Y1 - 2006
N2 - The current Internet has no secure way to validate the correctness of the routing information. We suggest a mechanism that supports secure validation of routing information in the interdomain routing protocol of the Internet. Our mechanism focuses on alleviating obstacles which previously prevent the complete and correct construction of the Internet routing information. In particular, we propose an identity-based Registry with Authorized and Verifiable Search (RAVS) so that routing information can bo constructed securely. We construct an efficient RAVS scheme and prove its securities in the random oracle model. By our scheme, the routing information can be securely stored and tested without revealing contents of both the registry and the search query. Furthermore, our registry is verifiable and its correctness is guaranteed. Only the legal autonomous system (AS) can construct the valid registry and the single compromised AS can be detected. Our experiment shows that our RAVS scheme can be implemented efficiently and the incurred overhead, in terms of time and space, is acceptable in practice.
AB - The current Internet has no secure way to validate the correctness of the routing information. We suggest a mechanism that supports secure validation of routing information in the interdomain routing protocol of the Internet. Our mechanism focuses on alleviating obstacles which previously prevent the complete and correct construction of the Internet routing information. In particular, we propose an identity-based Registry with Authorized and Verifiable Search (RAVS) so that routing information can bo constructed securely. We construct an efficient RAVS scheme and prove its securities in the random oracle model. By our scheme, the routing information can be securely stored and tested without revealing contents of both the registry and the search query. Furthermore, our registry is verifiable and its correctness is guaranteed. Only the legal autonomous system (AS) can construct the valid registry and the single compromised AS can be detected. Our experiment shows that our RAVS scheme can be implemented efficiently and the incurred overhead, in terms of time and space, is acceptable in practice.
KW - Authorized search
KW - Identity-based registry
KW - Verifiable search
UR - http://www.scopus.com/inward/record.url?scp=34247362891&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34247362891&partnerID=8YFLogxK
U2 - 10.1145/1128817.1128866
DO - 10.1145/1128817.1128866
M3 - Conference contribution
AN - SCOPUS:34247362891
SN - 1595932720
SN - 9781595932723
T3 - Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06
SP - 321
EP - 331
BT - Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06
T2 - 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06
Y2 - 21 March 2007 through 24 March 2007
ER -