The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article présente un schéma de gestion de clés entièrement auto-organisé pour les réseaux mobiles ad hoc. Contrairement à la plupart des schémas précédents, il n’y a pas de secret partagé a priori ni de relation de confiance a priori dans le schéma proposé ; chaque nœud joue le même rôle et remplit la même fonction de gestion des clés. Le système proposé comprend (1) des procédures de prise de contact (HS) et (2) des procédures de demande/réponse de certificat (CRR). Dans HS, un nœud acquiert la clé publique du nœud qui s'approche via un canal latéral sécurisé. Dans CRR, un nœud demande les certificats d'un nœud distant via un canal radio aux nœuds qu'il a HSed. Si le nombre de certificats valides reçus contenant la même clé publique dépasse un seuil donné, le nœud accepte la clé publique du nœud distant comme valide. La sécurité est rigoureusement analysée contre diverses attaques connues et les coûts du réseau sont intensivement analysés mathématiquement. À l’aide de cette analyse, nous fournissons des directives de sélection des paramètres pour optimiser les performances et maintenir la sécurité dans divers cas. Les résultats de la simulation montrent que chaque nœud acquiert les clés publiques de tous les autres nœuds au moins 5 fois plus rapidement que dans un schéma précédent.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Daeseon CHOI, Younho LEE, Yongsu PARK, Seung-hun JIN, Hyunsoo YOON, "Efficient and Secure Self-Organized Public Key Management for Mobile Ad Hoc Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 11, pp. 3574-3583, November 2008, doi: 10.1093/ietcom/e91-b.11.3574.
Abstract: This paper presents a fully self-organized key management scheme for mobile ad hoc networks. Unlike most previous schemes, there is no priori shared secret or no priori trust relationship in the proposed scheme; every node plays the same role and carries out the same function of key management. The proposed scheme consists of (1) Handshaking (HS) and (2) Certificate request/reply (CRR) procedures. In HS, a node acquires the public key of the approaching node via a secure side channel. In CRR, a node requests certificates of a remote node via a radio channel to the nodes that it has HSed. If the number of received valid certificates that contain the same public key exceeds a given threshold, the node accepts the remote node's public key as valid. Security is rigorously analyzed against various known attacks and network costs are intensively analyzed mathematically. Using this analysis, we provide parameter selection guideline to optimize performance and to maintain security for diverse cases. Simulation results show that every node acquires the public keys of all other nodes at least 5 times faster than in a previous scheme.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.11.3574/_p
Copier
@ARTICLE{e91-b_11_3574,
author={Daeseon CHOI, Younho LEE, Yongsu PARK, Seung-hun JIN, Hyunsoo YOON, },
journal={IEICE TRANSACTIONS on Communications},
title={Efficient and Secure Self-Organized Public Key Management for Mobile Ad Hoc Networks},
year={2008},
volume={E91-B},
number={11},
pages={3574-3583},
abstract={This paper presents a fully self-organized key management scheme for mobile ad hoc networks. Unlike most previous schemes, there is no priori shared secret or no priori trust relationship in the proposed scheme; every node plays the same role and carries out the same function of key management. The proposed scheme consists of (1) Handshaking (HS) and (2) Certificate request/reply (CRR) procedures. In HS, a node acquires the public key of the approaching node via a secure side channel. In CRR, a node requests certificates of a remote node via a radio channel to the nodes that it has HSed. If the number of received valid certificates that contain the same public key exceeds a given threshold, the node accepts the remote node's public key as valid. Security is rigorously analyzed against various known attacks and network costs are intensively analyzed mathematically. Using this analysis, we provide parameter selection guideline to optimize performance and to maintain security for diverse cases. Simulation results show that every node acquires the public keys of all other nodes at least 5 times faster than in a previous scheme.},
keywords={},
doi={10.1093/ietcom/e91-b.11.3574},
ISSN={1745-1345},
month={November},}
Copier
TY - JOUR
TI - Efficient and Secure Self-Organized Public Key Management for Mobile Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3574
EP - 3583
AU - Daeseon CHOI
AU - Younho LEE
AU - Yongsu PARK
AU - Seung-hun JIN
AU - Hyunsoo YOON
PY - 2008
DO - 10.1093/ietcom/e91-b.11.3574
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2008
AB - This paper presents a fully self-organized key management scheme for mobile ad hoc networks. Unlike most previous schemes, there is no priori shared secret or no priori trust relationship in the proposed scheme; every node plays the same role and carries out the same function of key management. The proposed scheme consists of (1) Handshaking (HS) and (2) Certificate request/reply (CRR) procedures. In HS, a node acquires the public key of the approaching node via a secure side channel. In CRR, a node requests certificates of a remote node via a radio channel to the nodes that it has HSed. If the number of received valid certificates that contain the same public key exceeds a given threshold, the node accepts the remote node's public key as valid. Security is rigorously analyzed against various known attacks and network costs are intensively analyzed mathematically. Using this analysis, we provide parameter selection guideline to optimize performance and to maintain security for diverse cases. Simulation results show that every node acquires the public keys of all other nodes at least 5 times faster than in a previous scheme.
ER -