2007 IEEE International Conference on Communications 2007
DOI: 10.1109/icc.2007.195
|View full text |Cite
|
Sign up to set email alerts
|

Wheel of Trust: A Secure Framework for Overlay-Based Services

Abstract: Abstract-The recent advances of distributed hash tables (DHTs) facilitate the development of highly scalable and robust network applications and services. However, with applications and services each employing their own DHTs that perform essentially the same tasks, an open infrastructure providing the core DHT functionalities for these applications and services would represent a cost-effective solution. In this paper we present a generic secure framework for deploying secure overlay-based applications/services… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 8 publications
(11 reference statements)
0
5
0
Order By: Relevance
“…A previous generation P2P architectures addressed scalability problems outside the serverless computing domain-e.g., Chord [34,39], Kademlia [27]. The distributed nature of these architectures exposes them inherently to important attacks [36,37], and thus many extensions provide authentication in distributed systems using a single root of trust [13,14] or identity-based cryptography [12,25]. Other works try to overcome single points of failure by using threshold cryptography [6,33], consensus protocols [30,31] and reputation mechanisms [11,17].…”
Section: Related Workmentioning
confidence: 99%
“…A previous generation P2P architectures addressed scalability problems outside the serverless computing domain-e.g., Chord [34,39], Kademlia [27]. The distributed nature of these architectures exposes them inherently to important attacks [36,37], and thus many extensions provide authentication in distributed systems using a single root of trust [13,14] or identity-based cryptography [12,25]. Other works try to overcome single points of failure by using threshold cryptography [6,33], consensus protocols [30,31] and reputation mechanisms [11,17].…”
Section: Related Workmentioning
confidence: 99%
“…So far, many studies are centered on introducing IBC into P2P security applications. Lu et al in [7] combined distributed hash tables (DHTs [8]) and identity-based encryption (IBE) to defend against man-in-the-middle attacks, however, the scheme assumed that each noble had a pre-assigned distinctive identifier, and has obtained the corresponding nonpublic key through a secure offline channel. This is often costly and troublesome to attain on a large scale P2P overlay network.…”
Section: Related Workmentioning
confidence: 99%
“…Lu et al in [7] combined distributed hash tables (DHTs [8]) and identity based encryption (IBE) to defend against man-in-the-middle attacks, however, the scheme assumed that each node has had a pre-assigned unique identifier, and has obtained the corresponding private key through a secure offline channel. This is expensive and difficult to achieve in a large scale P2P overlay network.…”
Section: Related Workmentioning
confidence: 99%
“…In this paper, a secure key issuing scheme for P2P networks, which addresses the shortcomings of [7], [9], [10], [11], and makes IBC more applicable in the real world is presented.…”
Section: Related Workmentioning
confidence: 99%