A note on broadcast encryption key management with applications to large scale emergency alert systems

Authors:
Guoqiang Shu;David Lee;Mihalis Yannakakis
Affiliations:
The Ohio State University, Dept. of Computer Science and Engineering, Columbus, OH;The Ohio State University, Dept. of Computer Science and Engineering, Columbus, OH;Columbia University, Dept. of Computer Science, New York, NY
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 14
Cited 0

Secure Broadcasting Using the Secure Lock

IEEE Transactions on Software Engineering
Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
On the hardness of approximating minimization problems

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Broadcast encryption

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Computing a minimum biclique cover is polynomial for bipartite domino-free graphs

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Key management for encrypted broadcast

ACM Transactions on Information and System Security (TISSEC)
Covering edges by cliques with regard to keyword conflicts and intersection graphs

Communications of the ACM
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Characterisation of (k, n) Multi-receiver Authentication

ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
Long-Lived Broadcast Encryption

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Revocation and Tracing Schemes for Stateless Receivers

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Secure Broadcast Communication in Wired and Wireless Networks

Secure Broadcast Communication in Wired and Wireless Networks
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
How to broadcast a secret

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Emergency alerting capability is crucial for the prompt response to natural disasters and terrorist attacks. The emerging network infrastructure and secure broadcast techniques enable prompt and secure delivery of emergency notification messages. With the ubiquitous deployment of alert systems, scalability and heterogeneity pose new challenges for the design of secure broadcast schemes. In this paper we discuss the key generation problem with the goal of minimizing the total number of keys which need to be generated by the alert center and distributed to the users. Two encryption schemes, zero message scheme and extended header scheme, are modeled formally. For both schemes we show the equivalence of the general optimal key generation (OKG) problem and the bipartite clique cover (BCC) problem, and show that OKG problem is NPHard. The result is then generalized to the case with resource constraints, and we provide a heuristic algorithm for solving the restricted BCC (and OKG) problem.