CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
An Efficient Public Key Traitor Tracing Scheme
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
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
Self Protecting Pirates and Black-Box Traitor Tracing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
On Crafty Pirates and Foxy Tracers
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Efficient Methods for Integrating Traceability and Broadcast Encryption
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Scalable public-key tracing and revoking
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A fully collusion resistant broadcast, trace, and revoke system
Proceedings of the 13th ACM conference on Computer and communications security
Traitor tracing with constant size ciphertext
Proceedings of the 15th ACM conference on Computer and communications security
Breaking Two k-Resilient Traitor Tracing Schemes with Sublinear Ciphertext Size
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
On the security of a public-key traitor tracing scheme with sublinear ciphertext size
Proceedings of the nineth ACM workshop on Digital rights management
Improving the round complexity of traitor tracing schemes
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Generic construction of hybrid public key traitor tracing with full-public-traceability
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Public traceability in traitor tracing schemes
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Fully collusion resistant traitor tracing with short ciphertexts and private keys
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing
Fully collusion resistant black-box traitor revocable broadcast encryption with short private keys
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.01 |
In ACM-DRM 2001, Kiayias and Yung [19] introduced a classification of pirate decoders in the context of traitor tracing that put forth traceability against history recording and abrupt pirate decoders. History recording pirate decoders are able to maintain state during the traitor tracing process while abrupt decoders can terminate the tracing operation at will based on the value of a "React" predicate. Beyond this original work, subsequently a number of other works tackled the problem of designing traitor tracing schemes against such decoders but with very limited success. In this work, we present a new attack that can be mounted by abrupt and resettable decoders. Our attack defeats the tracing algorithm that was presented in [19] (which would continue to hold only for deterministic pirate decoders). Thus we show that contrary to what is currently believed there do not exist any known tracing procedures against abrupt decoders for general plaintext distributions. We also describe an attack that can be mounted by history recording (and available) decoders.