BROWSE

Related Researcher

Author's Photo

Choi, Young-Ri
System Software Lab
Research Interests
  • Computer systems, system software, cloud computing, virtualization

ITEM VIEW & DOWNLOAD

Hop chains: Secure routing and the establishment of distinct identities

Cited 3 times inthomson ciCited 1 times inthomson ci
Title
Hop chains: Secure routing and the establishment of distinct identities
Author
Bazzi, Rida AChoi, Young-RiGouda, Mohamed G.
Issue Date
2006
Publisher
SPRINGER-VERLAG BERLIN
Citation
LECTURE NOTES IN COMPUTER SCIENCE, v.4305, no., pp.365 - 379
Abstract
We present a secure routing protocol that is immune to Sybil attacks, and that can tolerate initial collusion of Byzantine routers, or runtime collusion of non-adjacent Byzantine routers in the absence of collusion between adjacent routers. For these settings, the calculated distance from a destination to a node is not smaller than the actual shortest distance from the destination to the node. The protocol can also tolerate initial collusion of Byzantine routers and runtime collusion of adjacent Byzantine routers but in the absence of runtime collusion between non-adjacent routers. For this setting, there is a bound on how short the calculated distance is compared to the actual shortest distance. The protocol makes very weak timing assumptions and requires synchronization only between neighbors or second neighbors. We propose to use this protocol for secure localization of routers using hop-count distances, which can be then used as a proof of identity of nodes.
URI
https://scholarworks.unist.ac.kr/handle/201301/9943
ISSN
0302-9743
Appears in Collections:
EE_Journal Papers
Files in This Item:
There are no files associated with this item.

find_unist can give you direct access to the published full text of this article. (UNISTARs only)

Show full item record

qrcode

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

MENU