CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Digital signets: self-enforcing protection of digital information (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Decoding algebraic-geometric codes beyond the error-correction bound
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
SIAM Journal on Discrete Mathematics
On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
A displacement approach to efficient decoding of algebraic-geometric codes
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Efficient dynamic traitor tracing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Introduction to Coding Theory
Algebraic-Geometric Codes
Decoding Hermitian Codes with Sudan's Algorithm
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Key Preassigned Traceability Schemes for Broadcast Encryption
SAC '98 Proceedings of the Selected Areas in Cryptography
An Efficient Public Key Traitor Tracing Scheme
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Coding Constructions for Blacklisting Problems without Computational Assumptions
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
Long-Lived Broadcast Encryption
CRYPTO '00 Proceedings of the 20th 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
Efficient Watermark Detection and Collusion Security
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Efficient Trace and Revoke Schemes
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Proceedings of the First International Workshop on Information Hiding
Efficient Methods for Integrating Traceability and Broadcast Encryption
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A Hypergraph Approach to the Identifying Parent Property: the Case of Multiple Parents
A Hypergraph Approach to the Identifying Parent Property: the Case of Multiple Parents
Algebraic Function Fields and Codes
Algebraic Function Fields and Codes
List decoding of algebraic-geometric codes
IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Efficient decoding of Reed-Solomon codes beyond half the minimum distance
IEEE Transactions on Information Theory
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
Efficient Traitor Tracing from Collusion Secure Codes
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Improving the Boneh-Franklin Traitor Tracing Scheme
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Tracing and Revoking Pirate Rebroadcasts
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Robust fingerprinting codes: a near optimal construction
Proceedings of the tenth annual 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
Collusion secure convolutional spread spectrum fingerprinting
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
Fingerprinting schemes. identifying the guilty sources using side information
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
Practical scenarios for the van trung-martirosyan codes
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
A traitor tracing scheme based on RSA for fast decryption
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Identification algorithms for sequential traitor tracing
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
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
Complete tree subset difference broadcast encryption scheme and its analysis
Designs, Codes and Cryptography
A variant of non-adaptive group testing and its application in pay-television via internet
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
| Hi-index | 0.00 |
We use powerful new techniques for list decoding errorcorrecting codes to efficiently trace traitors. Although much work has focusedon constructing traceability schemes, the complexity of the tracing algorithm has receivedlittle attention. Because the TA tracing algorithm has a runtime of O(N) in general, where N is the number of users, it is inefficient for large populations.We produce schemes for which the TA algorithm is very fast. The IPP tracing algorithm, though less efficient, can list all coalitions capable of constructing a given pirate. We give evidence that when using an algebraic structure, the ability to trace with the IPP algorithm implies the ability to trace with the TA algorithm. We also construct schemes with an algorithm that finds all possible traitor coalitions faster than the IPP algorithm. Finally, we suggest uses for other decoding techniques in the presence of additional information about traitor behavior.