Naming in Content-Oriented Architectures 1. select produce Data publishing RWINameKey Data own certify 2.

Slides:



Advertisements
Similar presentations
Holding the Internet Accountable David Andersen, Hari Balakrishnan, Nick Feamster, Teemu Koponen, Daekyeong Moon, Scott Shenker.
Advertisements

1 ABCs of PKI TAG Presentation 18 th May 2004 Paul Butler.
Giving and Receiving Feedback
1 Data-Oriented Network Architecture (DONA) Scott Shenker (M. Chowla, T. Koponen, K. Lakshminarayanan, A. Ramachandran, A. Tavakoli, I. Stoica)
Mobile Code Security Yurii Kuzmin. What is Mobile Code? Term used to describe general-purpose executables that run in remote locations. Web browsers come.
Chapter 14 – Authentication Applications
Location vs. Identities in Internet Content: Applying Information-Centric Principles in Today’s Networks Instructor: Assoc. Prof. Chung-Horng Lung Group.
Chord: A scalable peer-to- peer lookup service for Internet applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashock, Hari Balakrishnan.
Identity Management Based on P3P Authors: Oliver Berthold and Marit Kohntopp P3P = Platform for Privacy Preferences Project.
Authentication Cristian Solano. Cryptography is the science of using mathematics to encrypt and decrypt data. Public Key Cryptography –Problems with key.
xxx IEEE MEDIA INDEPENDENT HANDOVER DCN: LB1c-handover-issues.ppt Title: MIH Security – What is it? Date Submitted:
6/1/20151 Digital Signature and Public Key Infrastructure Course:COSC Instructor:Professor Anvari Student ID: Name:Xin Wen Date:11/25/00.
SIA: Secure Information Aggregation in Sensor Networks Bartosz Przydatek, Dawn Song, Adrian Perrig Carnegie Mellon University Carl Hartung CSCI 7143: Secure.
Slide 1 Client / Server Paradigm. Slide 2 Outline: Client / Server Paradigm Client / Server Model of Interaction Server Design Issues C/ S Points of Interaction.
An Operational Perspective on BGP Security Geoff Huston GROW WG IETF 63 August 2005.
1 BGP Security -- Zhen Wu. 2 Schedule Tuesday –BGP Background –" Detection of Invalid Routing Announcement in the Internet" –Open Discussions Thursday.
CMSC 414 Computer and Network Security Lecture 7 Jonathan Katz.
Edward Tsai – CS 239 – Spring 2003 Strong Security for Active Networks CS 239 – Network Security Edward Tsai Tuesday, May 13, 2003.
CMSC 414 Computer and Network Security Lecture 9 Jonathan Katz.
Peer-to-Peer Computing
Beyond the perimeter: the need for early detection of Denial of Service Attacks John Haggerty,Qi Shi,Madjid Merabti Presented by Abhijit Pandey.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
CMSC 414 Computer and Network Security Lecture 20 Jonathan Katz.
Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.
1 Freenet  Addition goals to file location: -Provide publisher anonymity, security -Resistant to attacks – a third party shouldn’t be able to deny the.
Application of Attribute Certificates in S/MIME Greg Colla & Michael Zolotarev Baltimore Technologies 47 th IETF Conference Adelaide, March 2000.
CSE 597E Fall 2001 PennState University1 Digital Signature Schemes Presented By: Munaiza Matin.
Team CMD Distributed Systems Team Report 2 1/17/07 C:\>members Corey Andalora Mike Adams Darren Stanley.
Programming Satan’s Computer
1 Internet Protocol: Forwarding IP Datagrams Chapter 7.
Network Layer (3). Node lookup in p2p networks Section in the textbook. In a p2p network, each node may provide some kind of service for other.
1 TAPAS Workshop Nicola Mezzetti - TAPAS Workshop Bologna Achieving Security and Privacy on the Grid Nicola Mezzetti.
Csci5233 Computer Security1 Bishop: Chapter 14 Representing Identity.
Information Security Fundamentals Major Information Security Problems and Solutions Department of Computer Science Southern Illinois University Edwardsville.
Network Security Lecture 26 Presented by: Dr. Munam Ali Shah.
Computer Science 725 – Software Security Presentation “Decentralized Trust Management” Decentralized Trust ManagementDecentralized Trust Management M.
Freenet: A Distributed Anonymous Information Storage and Retrieval System Presenter: Chris Grier ECE 598nb Spring 2006.
Unit 1: Protection and Security for Grid Computing Part 2
ComNets Tutorial: Future Internet with Information Centric Networks Asanga Udugama (1), Carmelita Goerg (1) and Andreas Timm-Giel (2) (1) Communications.
SECURITY MANAGEMENT Key Management in the case of public-key cryptosystems, we assumed that a sender of a message had the public key of the receiver at.
1 Some initial Design suggestions… Getting started… where to begin? Find out whether your design architecture will work… as soon as possible. If you need.
Key Management. Given a computer network with n hosts, for each host to be able to communicate with any other host would seem to require as many as n*(n-1)
SOS: An Architecture For Mitigating DDoS Attacks Angelos D. Keromytis, Vishal Misra, Dan Rubenstein ACM SIGCOMM 2002 Presented By : Tracy Wagner CDA 6938.
Lecture 16: Security CDK4: Chapter 7 CDK5: Chapter 11 TvS: Chapter 9.
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
Multimedia & Mobile Communications Lab.
How to use DNS during the evolution of ICN? Zhiwei Yan.
Networking Named Content Van Jacobson, Diana K. Smetters, James D. Thornton, Michael F. Plass, Nicholas H. Briggs, Rebecca L. Braynard.
Freenet “…an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity.
Network Protocols Network Systems Security Mort Anvari.
Computer Networking P2P. Why P2P? Scaling: system scales with number of clients, by definition Eliminate centralization: Eliminate single point.
Network Security Continued. Digital Signature You want to sign a document. Three conditions. – 1. The receiver can verify the identity of the sender.
Freenet: Anonymous Storage and Retrieval of Information
Lecture 11 Overview. Digital Signature Properties CS 450/650 Lecture 11: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
1 Is an Internet PKI the Right Approach? Eric Osterweil Join work with: Dan Massey and Lixia Zhang.
IP Security (IPSec) Matt Hermanson. What is IPSec? It is an extension to the Internet Protocol (IP) suite that creates an encrypted and secure conversation.
Skype.
Cryptography and Network Security Chapter 14 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
HUAWEI TECHNOLOGIES Co., Ltd. PID: A Generic Naming Schema for Information-centric Network Xinwen Zhang, Ravi Ravindran Haiyong Xie, Guoqiang Wang Huawei.
TAG Presentation 18th May 2004 Paul Butler
Key management issues in PGP
NDN (Named Data Networking)
TAG Presentation 18th May 2004 Paul Butler
Draft-forwarding-label-ccn-02.txt Ravi Ravindran, Asit Chakraborti, Aytac Azgin Huawei (IETF/ICNRG-95, Buenos Aires)
S/MIME T ANANDHAN.
You Lu, Zhiyang Wang, Yu-Ting Yu, Mario Gerla
Outline Using cryptography in networks IPSec SSL and TLS.
Outline Review of Quiz #1 Distributed File Systems 4/20/2019 COP5611.
Data-Oriented Network Architecture (DONA)
Tim Polk, NIST PKI Program Manager March 2000
Presentation transcript:

Naming in Content-Oriented Architectures 1

select produce Data publishing RWINameKey Data own certify 2

“If not, then the receiver doesn’t know which public key to use to verify the provenance of the data” “If not, then it is impossible to identify the principal of the object” “If not, then anyone could claim to be the principal associated with the data” “Basic bindings” RWINameKey 3 The ICN paper argued that RWI, Name, and Key should be bound together

Binding between RW and cyberspace 4 RWINameKey Data Real world Cyberspace Who should take care of the bindings associated with RWI? Network or users?

The paper argued “The purpose of human-readability is to establish an intrinsic binding between the name and the RWI” The paper argued “The binding (between the name and key) can be established using an external authority.” “NDN bindings” in the ICN paper RWINameKey 5

The true story about NDN security Security of NDN does not rely on human-readability –human-readability just provides contexts for consumers to understand and remember names NDN secure the binding between name and data –decision on which key is legitimate to certify the binding is left to consumers –consumers define their own trust management policies –the key can be derived from consumers’ own policies 6 NameKey Data certify

The paper argued that “The use of cryptographic hash … provides the binding between the name and the key, enabling the receiver to check the key” The paper said “the binding between the RWI and key must be established by an external authority” SCN bindings RWIKey 7 Label “Name”

Unresolved security issues in SCN It is more difficult to make SCN name correct –SCN name consist of two parts: producers’ key and data label. –both parts must be correct –NDN name is data name only, no requirement on producer’s key The ICN paper suggested several methods of getting the right key –search engine based trust –social network based trust –the ICN paper did not elaborate how to achieve the goal using these methods 8

DoS In content-oriented network, DoS means “consumer cannot get the requested data” The ICN paper argued that –DoS can be prevented if routers can reject false data –“content-oriented routing must be done on a name-key basis, not just on the name” –“this makes the key an essential part of the name” 9

Different views SCN trusts the network as a whole to return the correct data –in fact, given a name, network may not always return the correct data –consumer has no choice when receiving the false data NDN assumes it is possible to receive false data from the network –intelligent forwarding is used to avoid “bad” routers or hosts in the network –when receiving false data, consumer can notify routers to try some other paths 10

Scalability of SCN routing In order to fetch data C, concatenation of the form A.B.C is used A, B, and C are all self- certifying names Upon receiving a request for A.B.C, look up A, B, and C in routing table Take the deepest match 11 A B F nameout-if Router 1 ✔ B C F nameout-if Router 2 ✔ A.B.C

back to hierarchical name Concatenation in the ICN paper is actually hierarchical name –"The semantics of such concatenations (A.B.C) are that when following routing entries for A, you will eventually find one for B; and that when following routing entries for B, you will eventually find an entry for C.” in Section 3.1 The only difference is the component of a concatenation is flat name The ICN paper also admitted that the label part in SCN name could also be hierarchical –“This hybrid choice merely requires that the labels in the P:L format for self-certifying names be human readable and hierarchical.” in Section 2.2 Denial of Service 12

Flexibility of SCN The ICN paper was focused on the flexibility of trust model The paper argued that NDN has to rely on PKI, because –network must be able to verify data –without key as a part of name, decentralized trust is impossible 13

Flexibility is not just about trust model NDN is more flexible than SCN in trust model –NDN, from very beginning, allows decentralized trust consumers decide if the signing key can be trusted –given a binding between name and data NDN allows multiple signers SCN allows only one signer, which is bound to the name NDN is more flexible than SCN in naming –NDN does not restrict the format of names –SCN name can be represented as NDN name two-component NDN name: producer’s key and data name concatenation in SCN is also NDN name as well –several pairs of producers’ key and data name –NDN name cannot be represented as SCN name SCN name requires key which does not exist in NDN name 14

General process of data fetching NDN –given a data name –send an interest to network –get the data with signature and signer info –consumer determines whether the signer can be trusted –if so, accept the data –if not, notify router to try some other paths SCN –given a data label –consumer determines who is the producer –consumer gets producer’s key –construct a SCN name Hash(key) + label –send request –assume returned data is always correct 15

NDN vs. SCN 16 The goals of NDN 1 are –security: NDN is as secure as SCN NDN allows consumers to decide which key can be trusted NDN use intelligent forwarding to prevent against DoS –usability: NDN name is more useful Human-readable name is easier to use than flat name NDN name stays with data, while SCN name has to changes due to routine key replacement –flexibility: NDN is more flexible than SCN in general More flexible trust model More flexible naming mechanism The ICN paper also mentioned scalability –SCN resolved back to hierarchical name which has been used by NDN 1. Diana Smetters and Van Jacobson, “Securing Network Content”, NDN TR