CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Generalized Beimal-Chor schemes for broadcast encryption and interactive key distribution
Theoretical Computer Science
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Key management for encrypted broadcast
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
How to prove where you are: tracking the location of customer equipment
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Some New Results on Key Distribution Patterns and BroadcastEncryption
Designs, Codes and Cryptography
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
A Secure Re-keying Scheme with Key Recovery Property
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
An optimal subset cover for broadcast encryption
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Broadcast encryption using efficient key distribution and renewal for ubiquitous environments
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
Practical pay-TV scheme using traitor tracing scheme for multiple channels
WISA'04 Proceedings of the 5th international conference on Information Security Applications
On the mean number of encryptions for tree-based broadcast encryption schemes
Journal of Discrete Algorithms
Hi-index | 0.00 |
The problem we address is how to communicate securely with a set of users (the target set) over an insecure broadcast channel. In order to solve this problem, several broadcast encryption schemes have been proposed. In these systems, the parameters of major concern are the length of transmission and number of keys held by each user's set top terminal (STT). Due to the need to withstand hardware tampering, the amount of secure memory available in the STTs is quite small, severely limiting the number of keys each user holds. In such cases, known theoretical bounds seem to indicate that non-trivial broadcast encryption schemes are only feasible when the number of users is small. In order to break away from these theoretical bounds, our approach is to allow a controlled number of users outside the target set to occasionally receive the multicast. This relaxation is appropriate for low-cost transmissions such as multicasting electronic coupons. For this purpose, we introduce f-redundant establishment key allocations, which guarantee that the total number of recipients is no more than f times the number of intended recipients. We measure the performance of such schemes by the number of transmissions they require, by their redundancy, and by their opportunity, which is the probability of a user outside the target set to be part of the multicast. We first prove a new lower bound and discuss the basic trade-offs associated with this new setting. Then we present several new f-redundant establishment key allocations. We evaluate the schemes' performance under all the relevant measures by extensive simulation. Our results indicate that, unlike previous solutions, it seems possible to design practical schemes in this new setting.