Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 1 Tempering Kademlia with a robust identity based system.

Slides:



Advertisements
Similar presentations
You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advertisements

Using Matrices in Real Life
Chapter 10 Encryption: A Matter of Trust. Awad –Electronic Commerce 1/e © 2002 Prentice Hall 2 OBJECTIVES What is Encryption? Basic Cryptographic Algorithm.
Advanced Piloting Cruise Plot.
1 Security for Ad Hoc Network Routing. 2 Ad Hoc Networks Properties Mobile Wireless communication Medium to high bandwidth High variability of connection.
© Ravi Sandhu Security Issues in P2P Systems Prof. Ravi Sandhu Laboratory for Information Security Technology George Mason University.
Chapter 1 The Study of Body Function Image PowerPoint
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Trusted Query Network (TQN) A Novel Approach to Generating Information Security Data Vijay Vaishnavi Richard Baskerville Art Vandenberg Jack Zheng Department.
Document #07-12G 1 RXQ Customer Enrollment Using a Registration Agent Process Flow Diagram (Switch) Customer Supplier Customer authorizes Enrollment.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
My Alphabet Book abcdefghijklm nopqrstuvwxyz.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING Think Distributive property backwards Work down, Show all steps ax + ay = a(x + y)
Addition Facts
Year 6 mental test 5 second questions
Introduction to Relational Database Systems 1 Lecture 4.
Peer-to-peer and agent-based computing Freenet. peer-to-peer and agent-based computing 2 Plan of lecture Freenet Architecture –Goals and Properties Searching.
ZMQS ZMQS
Universitá degli Studi di LAquila Mälardalens Högskola, Västerås 10th September 2009 Integrating Wireless Systems into Process Industry and Business Management.
Tempering Kademlia with a Robust Identity-based System
George Anadiotis, Spyros Kotoulas and Ronny Siebes VU University Amsterdam.
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Chapter 18 Methodology – Monitoring and Tuning the Operational System Transparencies © Pearson Education Limited 1995, 2005.
ABC Technology Project
Distributed Hash Tables
1 Kerberos Anita Jones November, Kerberos * : Objective Assumed environment Assumed environment –Open distributed environment –Wireless and Ethernetted.
Countering DoS Attacks with Stateless Multipath Overlays Presented by Yan Zhang.
Copyright © The OWASP Foundation Permission is granted to copy, distribute and/or modify this document under the terms of the OWASP License. The OWASP.
IP Multicast Information management 2 Groep T Leuven – Information department 2/14 Agenda •Why IP Multicast ? •Multicast fundamentals •Intradomain.
VOORBLAD.
Luca Maria Aiello. Università degli Studi di Torino – Dipartimento di Informatica – SecNet Group 1 Secure distributed applications: a case study Luca Maria.
Embedding identity in DHT systems: security, reputation and social networking management 1 Embedding Identity in DHT Systems: Security, Reputation and.
Squares and Square Root WALK. Solve each problem REVIEW:
Chapter 5 Test Review Sections 5-1 through 5-4.
SIMOCODE-DP Software.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
25 seconds left…...
Week 1.
Chapter 10: The Traditional Approach to Design
Systems Analysis and Design in a Changing World, Fifth Edition
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Figure Essential Cell Biology (© Garland Science 2010)
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
VPN AND REMOTE ACCESS Mohammad S. Hasan 1 VPN and Remote Access.
1 PART 1 ILLUSTRATION OF DOCUMENTS  Brief introduction to the documents contained in the envelope  Detailed clarification of the documents content.
How Cells Obtain Energy from Food
McGraw-Hill©The McGraw-Hill Companies, Inc., 2001 Chapter 16 Integrated Services Digital Network (ISDN)
Securing Critical Unattended Systems with Identity Based Cryptography A Case Study Johannes Blömer, Peter Günther University of Paderborn Volker Krummel.
Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
Secure and Flexible Framework for Decentralized Social Network Services Luca Maria Aiello, Giancarlo Ruffo Università degli Studi di Torino Computer Science.
Vault: A Secure Binding Service Guor-Huar Lu, Changho Choi, Zhi-Li Zhang University of Minnesota.
 A P2P IRC Network Built on Top of the Kademlia Distributed Hash Table.
Freenet: A Distributed Anonymous Information Storage and Retrieval System Presenter: Chris Grier ECE 598nb Spring 2006.
1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)
Peer-to-Peer Name Service (P2PNS) Ingmar Baumgart Institute of Telematics, Universität Karlsruhe IETF 70, Vancouver.
Lecture 11 Overview. Digital Signature Properties CS 450/650 Lecture 11: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
Presentation transcript:

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 1 Tempering Kademlia with a robust identity based system

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 2 PeeR-to-peer beyOnd FILE Sharing Catania Firenze Parma Pavia Roma Torino Trento Security on p2p networks

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 3 Goal Design and implementation of a DHT middleware resistant to most known overlay attacks a.Scalability b.Complete decentralization c.Efficiency Preserving:

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 4 Steps a.Analysis of DHT security issues b.Overview on existing DHTs properties c.Secure protocol (and architecture) design d.Performance analisys e.Implementation + f. Identity Based Cryptography

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 5 Distributed Hash Tables b. Overlay network c. Keyspace d. Key-node binding e. Key-content binding f. Responsibility function g. Lookup in O(log(N)) steps a. Content storage

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 6 Attacks against DHTs a. Storage attacks b. Routing attacks c. DDoS attacks e. Man In The Middle d. Sybil attack

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 7 Applying countermeasures a.Random NodeIds b.Few nodes per user c.Verifiable node identity d.Secure communication protocol e.Safe bootstrap No existent DHT grants these features

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 8 Current DHT designs PastryChordTapestry Kademlia CAN Viceroy

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 9 Kademlia a.Simple protocol (ping, store, find-node, find-value) b.Routing messages piggybacking c.Lightweight join phase d.XOR metric e.Caching

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 10 Kademlia: applications VuzeBittorrenteMuleLimewireRetroshare

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 11 Likir Layered Id-based Kademlia InfRastructure Problema: loose binding between node and identity Soluzione: a certification service Sfida: preserving the p2p paradigm pureness

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 12 Likir: architecture

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 13 Likir: initialization

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 14 Likir: node session

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 15 Likir: content STORE All RPC used are the same defined in Kademlia. We customize only the STORE :

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 16 Likir: Security properties Routing Storage / DDOS Sybil MITM a. Random generated NodeIds b. Verifiable identity  No masquerading  Account binded to every node  ID-based applications integration c. Credentials binded to contents  Verifiable ownership  Reputation + Blacklisting d. Secure communication protocol  Resistant to interleaving attacks SPoF e. The Certification Service is contected only ONCE

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 17 Identity 2.0 +

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 18 V E R I F I E D Identity 2.0

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 19 1.Setup →2.Extract →3.Sign →4.Verify Identity Based Signature Schema IBS di Boneh Franklyn (2001)

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 20 Likir & IBS: evaluation Need of a Private Key Generator Key Escrow Signature generation and check is slower than RSA Identity 2.0 compliant The public key can be omitted Signatures are smaller than in RSA

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 21 Performance evaluation

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 22 Performance evaluation

a.JLikir, Java 1.6 b.Kademlia adhering c.CS implemented like a CA d.Index Side Filtering e.We used JLikir to develop LiCha −Privacy-aware instant messaging application −Fully decentralized service −Likir identity support is fully exploited −High privacy and security level Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 23 Implementation

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 24 Conclusions Kademlia + Identity support + Protection from attacks = ————————————— Likir__

Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 25 Likir monastery, Ladakh Questions?

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.