This paper proposes a user revocation scheme for decentralized networks. User revocation is a method to distribute a group decryption key that is shared by n users in a group so that all but d revoked users can obtain the key. In decentralized networks such as ad-hoc networks, mesh networks, and Peer to Peer (P2P) networks, a sender should revoke the access of a dishonest user or an unauthorized user as soon as possible to protect the security of group communication. However, if the sender distributes the group key to all users aside from the revoked user, it would take a long time to revoke a user in a large group. In addition, users must set shared group keys for each user without a privileged center. We propose a scheme in which the amount of transmission and the key storage of each user are small.
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.
Copy
Jun ANZAI, Tsutomu MATSUMOTO, "A Distributed User Revocation Scheme for Ad-Hoc Networks" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 9, pp. 3635-3642, September 2005, doi: 10.1093/ietcom/e88-b.9.3635.
Abstract: This paper proposes a user revocation scheme for decentralized networks. User revocation is a method to distribute a group decryption key that is shared by n users in a group so that all but d revoked users can obtain the key. In decentralized networks such as ad-hoc networks, mesh networks, and Peer to Peer (P2P) networks, a sender should revoke the access of a dishonest user or an unauthorized user as soon as possible to protect the security of group communication. However, if the sender distributes the group key to all users aside from the revoked user, it would take a long time to revoke a user in a large group. In addition, users must set shared group keys for each user without a privileged center. We propose a scheme in which the amount of transmission and the key storage of each user are small.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.9.3635/_p
Copy
@ARTICLE{e88-b_9_3635,
author={Jun ANZAI, Tsutomu MATSUMOTO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Distributed User Revocation Scheme for Ad-Hoc Networks},
year={2005},
volume={E88-B},
number={9},
pages={3635-3642},
abstract={This paper proposes a user revocation scheme for decentralized networks. User revocation is a method to distribute a group decryption key that is shared by n users in a group so that all but d revoked users can obtain the key. In decentralized networks such as ad-hoc networks, mesh networks, and Peer to Peer (P2P) networks, a sender should revoke the access of a dishonest user or an unauthorized user as soon as possible to protect the security of group communication. However, if the sender distributes the group key to all users aside from the revoked user, it would take a long time to revoke a user in a large group. In addition, users must set shared group keys for each user without a privileged center. We propose a scheme in which the amount of transmission and the key storage of each user are small.},
keywords={},
doi={10.1093/ietcom/e88-b.9.3635},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - A Distributed User Revocation Scheme for Ad-Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3635
EP - 3642
AU - Jun ANZAI
AU - Tsutomu MATSUMOTO
PY - 2005
DO - 10.1093/ietcom/e88-b.9.3635
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2005
AB - This paper proposes a user revocation scheme for decentralized networks. User revocation is a method to distribute a group decryption key that is shared by n users in a group so that all but d revoked users can obtain the key. In decentralized networks such as ad-hoc networks, mesh networks, and Peer to Peer (P2P) networks, a sender should revoke the access of a dishonest user or an unauthorized user as soon as possible to protect the security of group communication. However, if the sender distributes the group key to all users aside from the revoked user, it would take a long time to revoke a user in a large group. In addition, users must set shared group keys for each user without a privileged center. We propose a scheme in which the amount of transmission and the key storage of each user are small.
ER -