A provably-secure strongly-randomized cipher
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Conditionally-perfect secrecy and a provably-secure randomized cipher
Journal of Cryptology - Eurocrypt '90
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Nark: receiver-based multicast non-repudiation and key management
Proceedings of the 1st ACM conference on Electronic commerce
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Security Weaknesses in a Randomized Stream Cipher
ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
The LSD Broadcast Encryption Scheme
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Large Scale distributed watermarking of multicast media through encryption
Proceedings of the IFIP TC6/TC11 International Conference on Communications and Multimedia Security Issues of the New Century
Chameleon - A New Kind of Stream Cipher
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Watercasting: Distributed Watermarking of Multicast Media
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Tamper resistance: a cautionary note
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
A note on the limits of collusion-resistant watermarks
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
One-Way chain based broadcast encryption schemes
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Fingercasting—Joint fingerprinting and decryption of broadcast messages
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
New paradigms for effective multicasting and fingerprinting of entertainment media
IEEE Communications Magazine
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing
A chameleon encryption scheme resistant to known-plaintext attack
Proceedings of the tenth annual ACM workshop on Digital rights management
A novel JFE scheme for social multimedia distribution in compressed domain using SVD and CA
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
| Hi-index | 0.00 |
We propose a stream cipher that provides confidentiality, traceability and renewability in the context of broadcast encryption assuming that collusion-resistant watermarks exist. We prove it to be as secure as the generic pseudo-random sequence on which it operates. This encryption approach, termed fingercasting, achieves joint decryption and fingerprinting of broadcast messages in such a way that an adversary cannot separate both operations or prevent them from happening simultaneously. The scheme is a combination of a known broadcast encryption scheme, a well-known class of fingerprinting schemes and an encryption scheme inspired by the Chameleon cipher. It is the first to provide a formal security proof and a non-constant lower bound for resistance against collusion of malicious users, i.e., a minimum number of content copies needed to remove all fingerprints. To achieve traceability, the scheme fingerprints the receivers' key tables such that they embed a fingerprint into the content during decryption. The scheme is efficient and includes parameters that allow, for example, to trade-off storage size for computation cost at the receiving end.