This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-05-04 Creation time: 05-00-59 --- Number of references 2 inproceedings Varj1112:Secure 2011 12 5 Many efforts of the network research community focus on the introduction ofa new identifier to relieve the IP address from its dual role of end-hostidentifier and routable locator. This identifier-locator split introduces anew identifier between human readable domain names and routable IPaddresses. Mapping between identifiers and locators requires additionalname mapping mechanisms because their relation is not trivial. Despite itspopularity and efficiency, the DNS system is not a perfect choice forperforming this mapping because identifiers are not hierarchicallystructured and mappings are frequently updated by users. In this paper wediscuss the features needed to resolve flat identifiers to locators in asecure manner. In particular, we focus on the features and the performancethat identifier-locator split protocols require from a mapping system. Tothis end, we consider a mapping system for an identifier-locator splitbased mobility solution and evaluate its performance. IndexTerms—Identifier-locator split, Name resolution, Host Identity Protocol,Security, DNS, DHT, OpenDHT DHT; DNS; Host Identity Protocol; Security; Identifier-locator split; Nameresolution fileadmin/papers/2011/2011-varjonen-secure.pdf Online IEEE

Piscataway, NJ, USA

IEEE GLOBECOM 2011 - Next Generation Networking Symposium (GC'11 - NGN), Awarded the NGN Best Paper Award accepted en 978-1-4244-9268-8 1930-529X 1 SamuVarjonen TobiasHeer KennethRimey AndreiGurtov inproceedings 201006GarciaIFIPTM 2010 ManyapplicationsrunningontheInternetoperateinfullyor semi-distributed fashion including P2P networks or social networks. Dis- tributed applications exhibit many advantages over classical client-server models regarding scalability, fault tolerance, and cost. Unfortunately, the distributed system operation also brings many security threats along that challenge their performance and reliability. In particular, faulty or mis- behaving nodes cannot collude to subvert the system operation. This paper addresses the above threats by applying cooperative security techniques to relevant distributed systems in the Internet. Our goal is to present methods that allow the peers to bootstrap basic trust relation- ships at the time of joining a distributed network and remove the peers if trust is lost. We consider the specific security caveats of the analyzed sys- tems, investigate the applicability of existing cooperative security-based protocols, and propose general design guidelines for cooperative-security protocol in described distributed systems. Print Springer

Berlin

Proceedings of IFIPTM 2010 - 4th International Conference on Trust Management Morioka, Japan 4th International Conference on Trust Management en 978-3-642-13445-6 1 DmitriyKuptsov OscarGarcia-Morchon KlausWehrle AndreiGurtov