Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4954482 | Computer Communications | 2017 | 35 Pages |
Abstract
Our KeyDer-GKM scheme is very efficient since it can be implemented by using hash and XOR functions only. Our ReEnc-GKM scheme allows a member to reduce the cost of computing the up-to-date group key to one decryption by outsourcing logâN operations. Both of our schemes are shown immune to the collusion attacks. For KeyDer-GKM, a set of collusive members cannot recover an unauthorized group key. For ReEnc-GKM, a set of collusive members cannot distinguish an unauthorized group key from a random string.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Yi-Ruei Chen, Wen-Guey Tzeng,