Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Efficient Sharing of Many Secrets
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Communication-Efficient Group Key Agreement
IFIP/Sec '01 Proceedings of the IFIP TC11 Sixteenth Annual Working Conference on Information Security: Trusted Information: The New Decade Challenge
CLIQUES: A New Approach to Group Key Agreement
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Secure multicast groups on ad hoc networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
A scalable multicast key management scheme for heterogeneous wireless networks
IEEE/ACM Transactions on Networking (TON)
Adding Confidentiality to Application-Level Multicast by Leveraging the Multicast Overlay
ICDCSW '05 Proceedings of the Fourth International Workshop on Assurance in Distributed Systems and Networks (ADSN) (ICDCSW'05) - Volume 01
Efficient security mechanisms for overlay multicast-based content distribution
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Linear multi-secret sharing schemes based on multi-party computation
Finite Fields and Their Applications
A multi-threshold secret image sharing scheme based on MSP
Pattern Recognition Letters
A New Secure Authenticated Group Key Transfer Protocol
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Wireless mesh networks (WMNs) have emerged as an increasingly important technology that offers low-cost community wireless services. The community-oriented nature of WMNs facilitates group applications, such as webcast, distance learning, online gaming, video conferencing, and multimedia broadcasting. Security is critical for the deployment of these services. Secure group communication has become an important component in WMNs. In order to provide secure and efficient group communication in WMNs, in this paper we consider an ideal linear multi-secret sharing scheme, in which each authorized subset may have different target secret. In particular, we put forward a general method of construction for such a scheme by using monotone span programs. The correctness and security of proposed scheme are proved.