A lookup tree based security for one-to-many communication

摘要

This paper proposes a scheme that optimizes overhead resulting from revocation and/or admission of participants in one-to-many secure group meetings. The scheme requires transmission of only the identifications of involved participants to settle changes. For added security, an automatic key refreshing mechanism with no transmission overhead is suggested. Periodical refreshing of the ciphering key is used as a countermeasure against hacking.