Browsing by Author "R. Poovendran"
Results Per Page
Sort Options
Item Analysis and Design of Robust Key Schemes for Multicast Communications(1999) R. Poovendran; Baras, John S.; Baras, John S.; ISR; CSHCNRecent literature presents several rooted tree based member deletion/revocation schemes trying to simultaneously minimize the key storage whileproviding efficient member deletion/revocation. Many of these approaches have different solutions and provide different values for the number of keys to be stored and distributed.In this paper, we show that these problems can be systematically studied using basic concepts from information theory. In particular, we show that the entropy of member revocation event plays a major role in defining the key allocation requirements. We then relate the entropy of member revocation event to bounds on the key length.
We also show that the optimal Huffman coding strategy used in leads to security weaknesses. A method for generating key management schemes to withstand varying degrees of member collusion is also presented.
ATIRP 4th Annual Conference
Item An Information Theoretic Approach for Design and Analysis of Rooted-Tree Based Multicast Key Management Schemes(1999) R. Poovendran; Baras, John S.; Baras, John S.; ISR; CSHCNRecent literature presents several rooted tree based member deletion/ revocation schemes trying to simultaneously minimize the key storage while providing efficient member deletion/revocation. Many of these approaches have different solutions and provide different values for the number of keys to be stored and distributed.In this paper, we show that many of these papers can be systematically studied using basic concepts from information theory. In particular, we show that the entropy of member revocation event plays a major role in defining the key allocation requirements.
We then relate the entropy of member revocation event to provide bounds on the key length. We also show that the optimal Huffman coding strategy used leads to security weakness. A method for generating key management schemes with varying degrees of member collusion is also presented in this paper.
Journal of IEEE Transaction on Information Theory
Item On a Recent Problem of Communication-Storage Tradeoffs for Secure Multicast for Large Networks(1999) R. Poovendran; Baras, John S.; Baras, John S.; ISR; CSHCNA variety of rooted tree-based secure multicast networks with different efficiencies and storage requirements that are linear in group size have been proposed.Recently, Canetti et. al. presented a scheme based on clustering that had sub-linear storage requirements at the group controller. However, they were unable to prove or disprove that the scheme was optimal, and posed it as an open question.
In this paper we answer the question with affirmative NO! Additionally we use our results to show that the optimal clustering in this context is related to maximum entropy of member revocation event, and corresponding optimal strategy is to partition members such that each cluster has the same probability of being revoked.
Second Workshop on Security in Communication Networks
Item Optimal Scalable Security Architectures in the Presence of Colluding Mobile Traitors(1999) R. Poovendran; Baras, John S.; Baras, John S.; ISR; CSHCNWe present the issues related to secure muiticast communication in the presence of members who may collaborate to compromise the integrity of the system's security. We also show that the ability to compartmentalize the system compromise depends on the availability of trusted intermediate nodes.We also note that some variations of the recently proposed tree-based schemes don't provide the required level of security and may be compromised if two appropriate members are compromised. We present the analysis of the weakness of these schemes here.
We further note that the currently available tree-based key distribution schemes are not optimal, and choose the worst case solution for key assignment. We note that the claims, including the collusion, can be formally proved using basic concepts from source coding theory and entropy.
1999 IEEE Emerging Technologies Symposium on Wireless Communications and Systems
Item Security Analysis of a Distributed Common Secret Generation Procedure(1999) R. Poovendran; Baras, John S.; Baras, John S.; ISR; CSHCNIn a distributed scheme allowing any number of members to compute a commonsecret without revealing individual secret was proposed. We present asecurity weakness of this protocol. In doing so, we show that any twomembers can collude and obtain the secret contributed by middle memberin generating the common secret.Journal of Cryptology