A quick group key distribution scheme with ‘entity revocation’

43Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper proposes a group key distribution scheme with an "entity revocation", which renews a group key of all the entities except one (or more) specific entity (ies). In broadcast systems such as Pay-TV, Internet multicast and mobile telecommunication for a group, amanager should revoke a dishonest entity or an unauthorized terminal as soon as possible to protect the secrecy of the group communication. However, it takes a long time for the "entity revocation" on a large group, if the manager distributes a group key to each entity except the revoked one. A recently published paper proposed a group key distribution scheme in which the amount of transmission and the delay do not rely on the number of entities of the group, using a type of secret sharing technique. This paper devises a novel key distribution scheme with "entity revocation" that makes frequent key distribution a practical reality. This scheme uses a technique similar to "threshold cryptosystems" and the one-pass Diffie-Hellman key exchange scheme.

Cite

CITATION STYLE

APA

Anzai, J., Matsuzaki, N., & Matsumoto, T. (1999). A quick group key distribution scheme with ‘entity revocation.’ In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1716, pp. 1–15). Springer Verlag. https://doi.org/10.1007/978-3-540-48000-6_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free