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
Key management for restricted multicast using broadcast encryption
IEEE/ACM Transactions on Networking (TON)
Communications of the ACM
Coding Constructions for Blacklisting Problems without Computational Assumptions
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
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
The LSD Broadcast Encryption Scheme
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Low Cost Attacks on Tamper Resistant Devices
Proceedings of the 5th International Workshop on Security Protocols
Efficient Trace and Revoke Schemes
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Efficient State Updates for Key Management
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Tamper resistance: a cautionary note
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Graceful service degradation (or, how to know your payment is late)
Proceedings of the 6th ACM conference on Electronic commerce
Remote revocation of smart cards in a private DRM system
ACSW Frontiers '05 Proceedings of the 2005 Australasian workshop on Grid computing and e-research - Volume 44
Communication-Computation Trade-off in Executing ECDSA in a Contactless Smartcard
Designs, Codes and Cryptography
An efficient secure communication between set-top box and smart card in DTV broadcasting
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
A practical revocation scheme for broadcast encryption using smartcards
ACM Transactions on Information and System Security (TISSEC)
Improved efficiency for revocation schemes via Newton interpolation
ACM Transactions on Information and System Security (TISSEC)
Wireless broadcast encryption based on smart cards
Wireless Networks
An efficient re-keying scheme for cluster based wireless sensor networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
| Hi-index | 0.00 |
We present an anti-pirate revocation scheme for broadcastencryption systems (e.g., pay TV), in which the data isencrypted to ensure payment by users. In the systems weconsider, decryption of keys is done on smartcards, and keymanagement is done in-band. Our starting point is a recentscheme of Naor and Pinkas. The basic scheme uses secretsharing to remove up to t parties, is information theoreticsecure against coalitions of size t, and is capable of creatinga new group key. However, with current smartcard technology,this scheme is only feasible for small system parameters,allowing up to about 100 pirates to be revoked beforeall the smartcards need to be replaced.We first present a novel implementation method of theirbasic scheme that distributes the work in novel ways amongthe smartcard, set-top terminal, and center. Based on this,we construct several improved schemes for many statefulrevocation rounds that scale to realistic system sizes. Weallow up to about 10000 pirates to be revoked using currentsmartcard technology before re-carding is needed. Thetransmission lengths of our constructions are on par withthose of the best tree-based schemes. However, our constructionshave much lower smartcard CPU complexity:only O (1) smartcard operations per revocation round, asopposed to a poly-logarithmic complexity of the best tree-basedschemes.We evaluate the system behavior via an exhaustive simulationstudy. Our simulations show that with mild assumptionson the piracy discovery rate, our constructions canperform effective pirate revocation for realistic broadcastencryption scenarios.