S/Kademlia: A practicable approach towards secure key-based routing

@article{Baumgart2007SKademliaAP,
  title={S/Kademlia: A practicable approach towards secure key-based routing},
  author={Ingmar Baumgart and Sebastian Mies},
  journal={2007 International Conference on Parallel and Distributed Systems},
  year={2007},
  volume={2},
  pages={1-8}
}
  • I. Baumgart, S. Mies
  • Published 5 December 2007
  • Computer Science
  • 2007 International Conference on Parallel and Distributed Systems
Security is a common problem in completely decentralized peer-to-peer systems. Although several suggestions exist on how to create a secure key-based routing protocol, a practicable approach is still unattended. In this paper we introduce a secure key-based routing protocol based on Kademlia that has a high resilience against common attacks by using parallel lookups over multiple disjoint paths, limiting free nodeld generation with crypto puzzles and introducing a reliable sibling broadcast… 
A survey of DHT security techniques
TLDR
An overview of techniques reported in the literature for making DHT-based systems resistant to the three most important attacks that can be launched by malicious nodes participating in the DHT: the Sybil attack, the Eclipse attack, and the routing and storage attacks is presented.
Message security in P2P network using distributed private key
  • P. Patil, D. R. Patil
  • Computer Science
    2012 Nirma University International Conference on Engineering (NUiCONE)
  • 2012
TLDR
A simple blinding technique is used to eliminate the need of secure channel and also multiple authorities approach to avoid the key distribution problem and the experimental results conducted on key distribution and peer registration protocol are shown.
Mitigating Routing Attacks with Local Trust in DHTs
Distributed Hash Tables (DHTs) have been used as a common building block in many distributed applications, including Peer-to-Peer (P2P), Cloud and Grid Computing. However, there are still important
Secure and Trustable Distributed Aggregation Based on Kademlia
TLDR
An aggregation algorithm, which supports a large spectrum of potential applications including complex voting protocols, relies on the distributed hash table Kademlia, used in BitTorrent, for pseudonymous communication between randomly predetermined peers to ensure a high degree of confidentiality which does not solely relies on cryptography.
An identity-based approach to secure P2P applications with Likir
TLDR
Likir (Layered Identity-based Kademlia-like Infrastructure) is the solution for implementing a secure Peer-to-Peer network based on a Distributed Hash Table and placing the emphasis on user identity results in a highly secure distributed framework which is very fitting for privacy-aware and efficient implementation of identity-based applications.
Sophia: Local Trust for Securing Routing in DHTs
TLDR
Sophia is presented, a novel generic security technique which combines iterative routing with local trust to fortify routing in DHTs and is believed to be the first work which exploits a local trust system to fortifying routing inDHTs.
SKIP: A Secure Key Issuing Scheme for Peer-to-Peer Networks
TLDR
This paper presents an IBC infrastructure setup phase, a peer registration solution using Shamir's (k, n) secret sharing scheme, and a secure key issuing scheme, which adopts key generate center (KGC) and key privacy authorities (KPAs) to issue private keys to peers securely.
Consistent authentication in disitrbuted networks
TLDR
The security of the Kademlia DHT, present in the Ericsson developed framework Calvin, was tested by performing a series of well-known attacks against an existing implementation, and security enhancements based on authentication were designed.
MPLEMENTING A SECURE KEY ISSUING SCHEME FOR COMMUNICATION IN P 2 P NETWORKS
Key issuing scheme focuses on the confidentiality maintained in using the secret key for communication in p2p networks. Identity based cryptography (IBC) was introduced into peer-to-peer (P2P)
Increasing structured P2P protocol resilience to localized attacks
TLDR
This dissertation provides the necessary background to understand the different types and inherent complexity of EAs, the susceptibility of many P2P protocols to EA, and a mitigation technique for the localized EA variant.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 18 REFERENCES
Towards a Scalable and Robust DHT
TLDR
It is shown that both of these threats can be handled in a scalable manner, even if a constant fraction of the peers in the system is adversarial, demonstrating that open systems for scalable distributed data storage that are robust against even massive adversarial behavior are feasible.
ID mapping attacks in P2P networks
TLDR
The paper analyzes the attacks that can be realized on the choice of identifiers by the nodes and proposes adequate countermeasures and uses as a reference the Kademlia protocol.
Defending the Sybil attack in P2P networks: taxonomy, challenges, and a proposal for self-registration
  • J. Dinger, H. Hartenstein
  • Computer Science
    First International Conference on Availability, Reliability and Security (ARES'06)
  • 2006
TLDR
This work proposes an identity registration procedure called self-registration that makes use of the inherent distribution mechanisms of a P2P network, as a starting point for a quantitative analysis of time-stability of P 2P networks under Sybil attacks.
Secure routing for structured peer-to-peer overlay networks
TLDR
This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks, and describes and evaluates techniques that allow nodes to join the overlay, to maintain routing state, and to forward messages securely in the presence of malicious nodes.
Vulnerabilities and security threats in structured overlay networks: a quantitative analysis
  • M. Srivatsa, Ling Liu
  • Computer Science
    20th Annual Computer Security Applications Conference
  • 2004
TLDR
This paper studies several serious security threats in DHT-based systems through two targeted attacks at the overlay network's protocol layer, which disclose that the malicious nodes can target any specific data item in the system; and corrupt/modify the data item to its favor.
Limiting Sybil Attacks in Structured Peer-to-Peer Networks
Structured peer-to-peer networks are highly scalable, efficient, and reliable. These characteristics are achieved by deterministically replicating and recalling content within a widely distributed
Security Considerations for Peer-to-Peer Distributed Hash Tables
TLDR
This paper looks at what sorts of security problems are inherent in large peer-to-peer systems based on distributed hash lookup systems, and proposes some design principles for detecting and preventing these problems.
Broose: a practical distributed hashtable based on the de-Bruijn topology
  • A. Gai, L. Viennot
  • Computer Science
    Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings.
  • 2004
TLDR
Broose is a peer-to-peer protocol based on the de Bruijn topology allowing a distributed hashtable to be maintained in a loose manner and allows load balancing of hotspot of requests for a given key as well as hotspots of key collisions.
The Sybil Attack
TLDR
It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
Making Chord Robust to Byzantine Attacks
TLDR
A variant of Chord is given which is robust with high probability for any time period during which there are always at least z total peers in the network for some integer z and the number of peer insertion and deletion events is no more than zk for some tunable parameter k.
...
1
2
...