By Topic

Analyzing Euler-Fermat Theorem Based Multicast Key Distribution Schemes with Chinese Remainder Theorem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wen Tao Zhu ; State Key Lab. of Inf. Security Grad., Univ. of Chinese Acad. of Sci., Beijing

Many emerging network applications are based upon group communication models and are implemented with multicast communications. We address the problem of distributing a secret session key to a secure multicast group. In a pair of such key management schemes, the session key is distributed mathematically based upon the Euler-Fermat theorem, such that upon receiving the broadcast keying material known as the rekey message, each member in the privileged multicast group can derive with a modular operation this group oriented common shared secret. In this work, however, following the Chinese remainder theorem, we present some unusual analysis results concerning the two novel rekey schemes. We show that the first scheme is highly vulnerable to certain attacks, while the second one actually collapses on itself. Therefore, both schemes are revealed to have failed to effectively protect the multicast session key.

Published in:

Network and Parallel Computing, 2008. NPC 2008. IFIP International Conference on

Date of Conference:

18-21 Oct. 2008