Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
SIAM Journal on Discrete Mathematics
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Traitor Tracing with Constant Transmission Rate
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
All-or-Nothing Encryption and the Package Transform
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
New Constructions for IPP Codes
Designs, Codes and Cryptography
Recursive constructions of secure codes and hash families using difference function families
Journal of Combinatorial Theory Series A
Exposure-resilient functions and all-or-nothing transforms
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Tag-KEM/DEM: a new framework for hybrid encryption and a new analysis of kurosawa-desmedt KEM
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Public traceability in traitor tracing schemes
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory
Efficient Traitor Tracing from Collusion Secure Codes
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Traitors Collaborating in Public: Pirates 2.0
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Forgery attack to an asymptotically optimal traitor tracing scheme
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Pirate evolution: how to make the most of your traitor keys
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Improving the round complexity of traitor tracing schemes
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
On the effects of pirate evolution on the design of digital content distribution systems
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Attacking traitor tracing schemes using history recording and abrupt decoders
ISC'11 Proceedings of the 14th international conference on Information security
Traitor tracing for stateful pirate decoders with constant ciphertext rate
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
A public-key traitor tracing scheme with an optimal transmission rate
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Traitor tracing with optimal transmission rate
ISC'07 Proceedings of the 10th international conference on Information Security
| Hi-index | 0.00 |
In Eurocrypt 2005, Chabanne, Phan and Pointcheval introduced an interesting property for traitor tracing schemes called public traceability, which makes tracing a black-box public operation. However, their proposed scheme only worked for two users and an open question proposed by authors was to provide this property for multi-user systems In this paper, we give a comprehensive solution to this problem by giving a generic construction for a hybrid traitor tracing scheme that provides full-public-traceability. We follow the Tag KEM/DEM paradigm of hybrid encryption systems and extend it to multi-receiver scenario. We define Tag-Broadcast KEM/DEM and construct a secure Tag-BroadcastKEM from a CCA secure PKE and target-collision resistant hash function. We will then use this Tag-Broadcast KEM together with a semantically secure DEM to give a generic construction for Hybrid Public Key Broadcast Encryption. The scheme has a black box tracing algorithm that always correctly identifies a traitor. The hybrid structure makes the system very efficient, both in terms of computation and communication cost. Finally we show a method of reducing the communication cost by using codes with identifiable parent property