CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Multicast over wireless networks
Communications of the ACM
Secure Anonymous Group Infrastructure for Common and Future Internet Applications
ACSAC '01 Proceedings of the 17th Annual Computer Security Applications Conference
Ciphertext-Policy Attribute-Based Encryption
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Provably secure ciphertext policy ABE
Proceedings of the 14th ACM conference on Computer and communications security
Attribute-based on-demand multicast group setup with membership anonymity
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Collusion resistant broadcast encryption with short ciphertexts and private keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Privacy in encrypted content distribution using private broadcast encryption
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
Multicast over wireless mobile ad hoc networks: present and future directions
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
In many applications, it is desired to dynamically establish temporary multicast groups for secure message delivery. It is also often the case that the group membership information itself is sensitive and needs to be well protected. However, existing solutions either fail to address the issue of membership anonymity or do not scale well for dynamically established groups. In this paper, we propose a highly scalable solution for dynamical multicast group setup with group membership anonymity. In the proposed solution, scalability and membership anonymity are achieved via a novel design that integrates techniques such as ciphertext-policy attribute-based encryption (CP-ABE). In our design, multicast groups are specified through group member attributes. As these attributes are potentially able to be shared by unlimited number of group members, our proposed scheme scales well. Also, high level of membership anonymity is guaranteed such that every group member knows nothing but his own group membership only. The complexity of our proposed scheme in terms of computational overhead and ciphertext size is O(n), where n is the number of attributes and independent to the group size.