Distributed mapping management of identifiers and locators in mobile‐oriented Internet environment

Gohar, Moneeb; Jung, Heeyoung; Koh, Seok Joo

doi:10.1002/dac.2346

Cited by 6 publications

(5 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Discussion 6: Security Of Key Exchange Functionmentioning

confidence: 99%

“…Finally, we summarize the security and the functionality of our protocols and make comparisons with these aspects of related works [8][9][10][11][12][13][14][15][16][17][18][19] in Table I. S1: Protect user and server secret parameters; S2: No password table and verification table; S3: Mutual authentication; S4: Fairness in key agreement; S5: Withstanding the replay attack; S6: Withstanding the insider attack; S7: Initiator anonymity; and S8: High security of the session key.…”

Section: Discussion 6: Security Of Key Exchange Functionmentioning

confidence: 99%

“…Therefore, many entity authentication protocols are proposed through verified servers, or different public key systems [1][2][3][4][5][6][7]. As most identification methods are designed to prevent replay attacks by making use of time stamps, in real network system, time stamp is really hard to realize, and each protocol has its advantages and disadvantages, which still needs improvements [8][9][10][11][12][13].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Enhancement authentication protocol using zero‐knowledge proofs and chaotic maps

Chain

Chang

Kuo

et al. 2015

Int J Communication

View full text Add to dashboard Cite

Application of authentication protocol and key exchange scheme are major research issues in current internet, and entity identification (users or servers) accuracy and security are thereby safeguarded by various types of verification programs. Therefore, in the last 10 years, it was accompanied with productive discussions, but those discussions mainly focus on single issues, and because of the lack of security, there still existed improvements. The concept of zero-knowledge proofs is well suited for the identification and signing within network system, which has been widely used since proposed in 1985. However, common identification methods are only fit for individual user. In an increasingly complex network environment of today, information is usually conveyed through many unidentified servers, as a result, we have to encrypt messages by adopting different kinds of session keys. As for the chaotic maps technology, it also serves as a new encryption technology, widely adopted in communication protocols and key agreements over the years. As a consequence, in this study, we are going to propose an authentication protocol with key exchange function by taking advantage of characters of zero-knowledge proofs and chaotic maps, as well as adopt the BAN-logic to prove the security of this protocol. This study also compares the results of the security analysis of our protocol and related works. As a result, our proposed protocol has more security than others. owner of this secret message. And applications of zero-knowledge proofs may save the authenticator from conveying any secret message, which effectively prevents eavesdropping or replay attacks. Application scope of zero-knowledge proofs shall include user identification [16][17][18][19], electronic voting [20,21], digital cash [22,23], blind signature [24,25], and so on. In order to extend its application scope, Schnorr [19] had proposed an improved zero-knowledge proofs in the year 1989, which is perceived as a more effective verification method suitable for using smart cards.Since 1990s, chaotic system [18,[26][27][28][29][30] has been widely used in designing a secure communication protocol. And in the past 10 years, encryption system based on chaos theory has been studied extensively. Chaotic maps include the design of symmetric encryption protocol [31-34] and hashing function [35][36][37]. Lately, chaotic system is also applied in signature scheme [38].Traditional authentication protocols do not have key exchange function, or parts of authentication protocols have key exchange function, but because of the lack of security, for this purpose, we have proposed an enhancement authentication protocol with key exchange function applied in network system by making use of characters of zero-knowledge proofs and chaotic maps, and attached it with higher security, stronger anonymity, faster efficiency, and better integrity. Moreover, we have also adopted the BAN-logic to prove the security of this protocol. In chapter 2, we have first introduced some concepts related to z...

show abstract

Section: Discussion 6: Security Of Key Exchange Functionmentioning

confidence: 99%

Section: Discussion 6: Security Of Key Exchange Functionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Enhancement authentication protocol using zero‐knowledge proofs and chaotic maps

Chain

Chang

Kuo

et al. 2015

Int J Communication

View full text Add to dashboard Cite

show abstract

“…It is worth noticing that many concepts and ideas explained in this section are explicitly inherited from the IP world, especially the notion of host identifiers (see for a full discussion on the use of node identifiers in mobility environments). However, their applicability to CCN has never been discussed because this new network architecture is exactly aimed at abandoning this approach based on a host‐centric vision of the network.…”

Section: Architecture Designsmentioning

confidence: 99%

Push applications and dynamic content generation over content‐centric networking

Virgilio

Marchetto

Sisto

2015

Int J Communication

View full text Add to dashboard Cite

SUMMARYContent-Centric Networking (CCN) represents an established candidate for the future Internet, proposing a routing architecture designed to elevate content to first class entity. Starting from the fact that the network usage has dramatically evolved towards content retrieval, CCN relies on an on-demand pull based mechanism to transfer data from the different sources to the heterogeneous consumers. This paradigm enhances the network in a number of ways, ranging from the newly introduced in-network caching capabilities to the benefits provided by the symmetric data routing adopted by CCN. In this renewed network scenario, we place our attention to those applications that do not perfectly fit the pull paradigm, stating that they need to be supported as well and proposing an effective way to achieve scalability on large scale push applications. We provide the following contributions: (i) we identify the functions that a data-centric architecture should support; (ii) propose and compare our solution with the state of the art framework designed for the specific problem of pushing data to content requesters; and (iii) evaluate their performance in terms of traffic generated and scalability achieved by simulating a real Internet Service Provider (ISP) topology and the realistic workload of a generic social network application.

show abstract

“…With the advent of smart phones and various smart devices, the number of mobile users on the Internet is increasing explosively. This mobile trend has caused the rapid growth of the routing table size in routers [1,2]. To tackle the routing scalability issue, the Internet Engineering Task Force (IETF) has proposed the Identifier Locator Network Protocol (ILNP) protocol [3,4], which operates based on the address rewriting scheme.…”

Section: Introductionmentioning

confidence: 99%

Distributed Identifier-Locator Mapping Management in Mobile ILNP Networks

Gohar

Choi

Ahmed³

et al. 2019

Electronics

Self Cite

View full text Add to dashboard Cite

In the Identifier Locator Network Protocol (ILNP) networks, the existing mobility control schemes based on the centralized entity, called the Dynamic Domain Name Service (DDNS) server, such that all the control traffic is processed at the DDNS server. However, the centralized mobility schemes have significant limitations, such as control traffic overhead at the server and large handover delay. In order to resolve these issues, we propose a new mobility control scheme for ILNP networks, which manages the identifier-locators (ID-LOCs) in the fully distributed manner. In our scheme, each domain has a dedicated mobile DDNS (m-DDNS) server at the site border router (SBR). The m-DDNS server maintains two databases; i.e., home host register (HHR) and visiting host register (VHR), to support the roaming of mobile hosts. When a mobile host roams into a domain, the m-DDNS server in the visiting domain registers the host’s ID-LOC in the VHR and requests the update of HHR to the m-DDNS server in the home domain. Since the m-DDNS servers communicate each other directly, the ID-LOC mappings are managed without involvement of any central entities. We analyzed our proposed mobility scheme via numerical analysis and compared its performance with those of existing schemes. Numerical results showed that our scheme outperforms the existing mobility control schemes substantially in terms of control traffic overhead at the servers, total transmission delay and handover delay.

show abstract

Distributed mapping management of identifiers and locators in mobile‐oriented Internet environment

Cited by 6 publications

References 19 publications

Enhancement authentication protocol using zero‐knowledge proofs and chaotic maps

Enhancement authentication protocol using zero‐knowledge proofs and chaotic maps

Push applications and dynamic content generation over content‐centric networking

Distributed Identifier-Locator Mapping Management in Mobile ILNP Networks

Contact Info

Product

Resources

About