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
Kertas kerja ini membentangkan skim pengurusan utama yang disusun sendiri sepenuhnya untuk rangkaian ad hoc mudah alih. Tidak seperti kebanyakan skim sebelumnya, tiada rahsia kongsi priori atau tiada hubungan kepercayaan priori dalam skim yang dicadangkan; setiap nod memainkan peranan yang sama dan menjalankan fungsi pengurusan kunci yang sama. Skim yang dicadangkan terdiri daripada (1) Berjabat tangan (HS) dan (2) prosedur permintaan/balas sijil (CRR). Dalam HS, nod memperoleh kunci awam nod yang menghampiri melalui saluran sisi selamat. Dalam CRR, nod meminta sijil nod jauh melalui saluran radio kepada nod yang telah HSed. Jika bilangan sijil sah yang diterima yang mengandungi kunci awam yang sama melebihi ambang tertentu, nod menerima kunci awam nod jauh sebagai sah. Keselamatan dianalisis dengan teliti terhadap pelbagai serangan yang diketahui dan kos rangkaian dianalisis secara intensif secara matematik. Menggunakan analisis ini, kami menyediakan garis panduan pemilihan parameter untuk mengoptimumkan prestasi dan untuk mengekalkan keselamatan untuk pelbagai kes. Keputusan simulasi menunjukkan bahawa setiap nod memperoleh kunci awam semua nod lain sekurang-kurangnya 5 kali lebih cepat daripada dalam skema sebelumnya.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -