Generalized secret sharing and monotone functions
CRYPTO '88 Proceedings on Advances in cryptology
Communications of the ACM
Digital image watermarking for joint ownership
Proceedings of the tenth ACM international conference on Multimedia
A Secure, Robust Watermark for Multimedia
Proceedings of the First International Workshop on Information Hiding
A Novel Watermarking Framework for Joint-Creatorship Protection
CW '05 Proceedings of the 2005 International Conference on Cyberworlds
Digital image watermarking for joint ownership verification without a trusted dealer
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1
MM&Sec '01 Proceedings of the 2001 workshop on Multimedia and security: new challenges
If one watermark is good, are more better?
ICASSP '99 Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04
Efficient secret sharing without a mutually trusted authority
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
A DWT blind image watermarking strategy with secret sharing
PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing
A wavelet-based watermarking algorithm for ownership verification of digital images
IEEE Transactions on Image Processing
RST-invariant digital image watermarking based on log-polar mapping and phase correlation
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
In digital rights management, there are many instances where there is more than one user involved, with each user having different level of rights. In this paper, we develop a novel approach to the multi-user, multi-right problem, where users are tied to various rights in an arbitrary access structure. Our approach is applicable to all kinds of media and can be used with any watermarking algorithm, provided that keys are used to generate the watermarks. This flexibility also enables it to benefit from future progress in the development of watermarking algorithms, in particular that of multiple watermarking. The proposed technique uses the generalized secret sharing scheme of Benaloh and Leichter, and builds on the earlier work of Guo on the joint ownership problem. By noting that the number of rights is likely much smaller than the number of users in most practical situations, and by generating the watermarks independently, the proposed approach achieves greater fidelity and detection capability than Guo's schemes while remaining secure against colluding users.