EM3 A: Efficient mutual multi-hop mobile authentication scheme for PMIP networks
In this paper, we propose EM3 A, a novel scheme that guarantees the authenticity of a mobile node (MN) and a relay node (RN) in a multi-hop-enabled Proxy Mobile IP (PMIP) network. EM3 A works in conjunction with a proposed scheme for key establishment, based on symmetric polynomials, to generate a s...
- Autores:
-
Taha, Sanaa
Xuemin, Shen
Cespedes Umaña, Sandra Lorena
- Tipo de recurso:
- http://purl.org/coar/resource_type/c_c94f
- Fecha de publicación:
- 2012
- Institución:
- Universidad ICESI
- Repositorio:
- Repositorio ICESI
- Idioma:
- eng
- OAI Identifier:
- oai:repository.icesi.edu.co:10906/82844
- Acceso en línea:
- http://ieeexplore.ieee.org/document/6363975/
http://repository.icesi.edu.co/biblioteca_digital/handle/10906/82844
http://dx.doi.org/10.1109/ICC.2012.6363975
- Palabra clave:
- Telecomunicaciones
Redes celulares
Redes IP
Dominios (Internet)
Telecommunication
- Rights
- openAccess
- License
- https://creativecommons.org/licenses/by-nc-nd/4.0/
Summary: | In this paper, we propose EM3 A, a novel scheme that guarantees the authenticity of a mobile node (MN) and a relay node (RN) in a multi-hop-enabled Proxy Mobile IP (PMIP) network. EM3 A works in conjunction with a proposed scheme for key establishment, based on symmetric polynomials, to generate a shared secret key between MN and RN. This scheme achieves lower revocation overhead than that achieved by existing symmetric polynomial-based schemes. For a PMIP domain with n points of attachment, EM 3 A achieves t×2n-secrecy, whereas the existing authentication schemes achieve only t-secrecy. Computation and communication overhead analysis, as well as simulation results, demonstrate that EM 3 A achieves low authentication delay and is suitable for seamless multi-hop IP communications. © 2012 IEEE. |
---|