CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
SIAM Journal on Computing
Balanced allocations: the heavily loaded case
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Randomized initialization protocols for radio networks
Handbook of wireless networks and mobile computing
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Light Weight Broadcast Exclusion Using Secret Sharing
ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
Coding Constructions for Blacklisting Problems without Computational Assumptions
CRYPTO '99 Proceedings of the 19th 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
On Balls and Bins with Deletions
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
A Quick Group Key Distribution Scheme with "Entity Revocation"
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Efficient Trace and Revoke Schemes
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
How Asymmetry Helps Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Group rekeying with limited unicast recovery
Computer Networks: The International Journal of Computer and Telecommunications Networking
Practical pay-TV scheme using traitor tracing scheme for multiple channels
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Coalition resistant anonymous broadcast encryption scheme based on PUF
TRUST'11 Proceedings of the 4th international conference on Trust and trustworthy computing
A revocation scheme preserving privacy
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
| Hi-index | 0.00 |
We consider distribution of encryption keys for “pay-per-view” broadcasting systems with a dynamic set of users. We assume that the active recipients in such a system (i.e. those who pay for the current transmission) obtain a key necessary for decoding the transmission. If the set of recipients changes, the system has to update the key and inform the legitimate users about the change. Communication medium we consider here is an ad hoc network of users organized in the same way as GSM or UMTS: the service area is divided into cells, each cell serves a limited number of users. Communication with the users in a cell is through a shared communication channel of this cell. We present a procedure for distributing a new key to a new set of active users. We pursue three goals: communication volume related to a change of the encryption key should be kept as small as possible, the energy cost for each legitimate user should be low, the update process should not reveal any information about users behavior. Our scheme is based on balanced allocation algorithms. It is simple, easy to implement, preserves anonymity. It has small communication overhead and low energy cost for the users. It works very well for a practical parameter size.