Dynamic fingerprinting over broadcast using revocation scheme

Authors:
Mira Kim;Kazukuni Kobara;Hideki Imai
Affiliations:
Institute of Information Security, Yokohama, Japan;Institute of Industrial Science, The University of Tokyo, Tokyo, Japan;Institute of Industrial Science, The University of Tokyo, Tokyo, Japan
Venue:
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Year:
2004

Citing 9
Cited 0

Broadcast encryption

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Dynamic Traitor Training

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
The LSD Broadcast Encryption Scheme

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A Revocation Scheme with Minimal Storage at Receivers

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Trace and Revoke Schemes

FC '00 Proceedings of the 4th International Conference on Financial Cryptography
A Collusion-Secure Fingerprinting Code Reduced by Chinese Remaindering and Its Random-Error Resilience

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Collusion-secure fingerprinting for digital data

IEEE Transactions on Information Theory
Sequential traitor tracing

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we deal with the problem of how to embed unique fingerprints into broadcasted contents or packaged contents, such as CD and DVD, without giving the watermarking algorithm to the decoders at the receivers. We propose a new model using around-half-rate dynamic revocation scheme in broadcast encryption. Our model achieves the following properties: (1) No watermarking algorithm at the decoders; (2) Dynamic fingerprinting; and (3) Dynamic revocation. Revocation schemes allow a center to broadcast an encrypted message so that only a particular subset of the users can obtain the contents of the message. However, when dealing with around-half-rate revocation, most past proposed schemes failed to obtain a good efficiency, i.e. the message length that must be transmitted by the sender or the number of storage keys at a user is too large. In addition, we propose an efficient algorithm of revocation that reduces both the message length and the size of storage keys at a user while maintaining both collusion-freeness and a single decryption at a user.