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
Des schémas efficaces de partage de clés basés sur l'identification sont recherchés dans le monde entier afin d'obtenir des communications sécurisées sur Internet et d'autres réseaux associés, et le système de pré-distribution de clés (KPS) est l'un de la majorité de ces schémas de partage de clés. La propriété remarquable de KPS est que l'utilisateur n'a qu'à saisir l'identifiant du partenaire dans l'algorithme secret KPS afin de partager une clé entre eux. Bien que ce ne soit là qu'une petite partie des nombreux avantages de KPS en termes d'efficacité, une énorme quantité de mémoire est toujours nécessaire pour atteindre une sécurité parfaite. Alors que les méthodes KPS conventionnelles peuvent établir des liens de communication entre n'importe quelle paire d'entités dans un système de communication, dans la plupart des environnements de communication pratiques, comme dans un système de diffusion, toutes les liaisons ne seront pas requises. Dans cet article, nous avons mis au point une méthode souhaitable pour supprimer les liens de communication inutiles entre n’importe quelle paire d’entités dans un système de communication. Dans notre schéma, la taille de mémoire requise par entité était simplement proportionnelle au nombre d'entités du partenaire, alors que dans le KPS conventionnel, elle est proportionnelle au nombre d'entités de l'ensemble du système de communication. A titre d'exemple, si une entité communique avec seulement 1/r d'autres, le besoin en mémoire est réduit à 1/r des KPS conventionnels. De plus, il a été prouvé que la taille de mémoire obtenue était optimale. Dans l’ensemble, notre projet a confirmé une plus grande efficacité pour obtenir une communication sécurisée particulièrement adaptée aux réseaux à grande échelle.
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
Goichiro HANAOKA, Tsuyoshi NISHIOKA, Yuliang ZHENG, Hideki IMAI, "Optimal Unconditionally Secure ID-Based Key Distribution Scheme for Large-Scaled Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 1, pp. 222-230, January 2001, doi: .
Abstract: Efficient ID-based key sharing schemes are desired worldwide in order to obtain secure communications on the Internet and other related networks, and Key Pre-distribution System (KPS) is one of the majority of such key sharing schemes. The remarkable property of KPS, is that, user need only input the partner's identifier to the secret KPS-algorithm in order to share a key between them. Although this is just a small part of many advantages KPS has in terms of efficiency, an enormous amount of memory is always required to achieve perfect security. While the conventional KPS methods can establish communication links between any pair of entities in a communication system, in most of the practical communication environment, such as in a broadcast system, not all links will be required. In this article, we achieved a desirable method to remove the unnecessary communication links between any pair of entities in a communication system. In our scheme, required memory size per entity was just proportional to the number of entities of the partner's, while that in conventional KPS, it is proportional to the number of entities of the whole communication system. As an example, if an entity communicates with only 1/r others, the memory requirement is reduced to 1/r of the conventional KPS's. Furthermore, it was proven that the obtained memory size was optimum. Overall, our scheme confirmed greater efficiency to achieve secure communication particularly suited in large-scale networks.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_1_222/_p
Copier
@ARTICLE{e84-a_1_222,
author={Goichiro HANAOKA, Tsuyoshi NISHIOKA, Yuliang ZHENG, Hideki IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Optimal Unconditionally Secure ID-Based Key Distribution Scheme for Large-Scaled Networks},
year={2001},
volume={E84-A},
number={1},
pages={222-230},
abstract={Efficient ID-based key sharing schemes are desired worldwide in order to obtain secure communications on the Internet and other related networks, and Key Pre-distribution System (KPS) is one of the majority of such key sharing schemes. The remarkable property of KPS, is that, user need only input the partner's identifier to the secret KPS-algorithm in order to share a key between them. Although this is just a small part of many advantages KPS has in terms of efficiency, an enormous amount of memory is always required to achieve perfect security. While the conventional KPS methods can establish communication links between any pair of entities in a communication system, in most of the practical communication environment, such as in a broadcast system, not all links will be required. In this article, we achieved a desirable method to remove the unnecessary communication links between any pair of entities in a communication system. In our scheme, required memory size per entity was just proportional to the number of entities of the partner's, while that in conventional KPS, it is proportional to the number of entities of the whole communication system. As an example, if an entity communicates with only 1/r others, the memory requirement is reduced to 1/r of the conventional KPS's. Furthermore, it was proven that the obtained memory size was optimum. Overall, our scheme confirmed greater efficiency to achieve secure communication particularly suited in large-scale networks.},
keywords={},
doi={},
ISSN={},
month={January},}
Copier
TY - JOUR
TI - Optimal Unconditionally Secure ID-Based Key Distribution Scheme for Large-Scaled Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 222
EP - 230
AU - Goichiro HANAOKA
AU - Tsuyoshi NISHIOKA
AU - Yuliang ZHENG
AU - Hideki IMAI
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2001
AB - Efficient ID-based key sharing schemes are desired worldwide in order to obtain secure communications on the Internet and other related networks, and Key Pre-distribution System (KPS) is one of the majority of such key sharing schemes. The remarkable property of KPS, is that, user need only input the partner's identifier to the secret KPS-algorithm in order to share a key between them. Although this is just a small part of many advantages KPS has in terms of efficiency, an enormous amount of memory is always required to achieve perfect security. While the conventional KPS methods can establish communication links between any pair of entities in a communication system, in most of the practical communication environment, such as in a broadcast system, not all links will be required. In this article, we achieved a desirable method to remove the unnecessary communication links between any pair of entities in a communication system. In our scheme, required memory size per entity was just proportional to the number of entities of the partner's, while that in conventional KPS, it is proportional to the number of entities of the whole communication system. As an example, if an entity communicates with only 1/r others, the memory requirement is reduced to 1/r of the conventional KPS's. Furthermore, it was proven that the obtained memory size was optimum. Overall, our scheme confirmed greater efficiency to achieve secure communication particularly suited in large-scale networks.
ER -