Fingerprinting long forgiving messages
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Finding smooth integers in short intervals using CRT decoding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Error- and Collusion-Secure Fingerprinting for Digital Data
IH '99 Proceedings of the Third International Workshop on Information Hiding
SP '83 Proceedings of the 1983 IEEE Symposium on Security and Privacy
Noisy polynomial interpolation and noisy chinese remaindering
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
An ID Coding Scheme for Fingerprinting, Randomized c-Secure CRT Code
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Dynamic graph-based software fingerprinting
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Efficient Anonymous Fingerprinting Protocol
Computational Intelligence and Security
Digital Watermarking and Steganography
Digital Watermarking and Steganography
Optimization and evaluation of randomized c-secure CRT code defined on polynomial ring
IH'04 Proceedings of the 6th international conference on Information Hiding
Dynamic fingerprinting over broadcast using revocation scheme
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Worst-case optimal fingerprinting codes for non-threshold collusion
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
| Hi-index | 0.00 |
A c-secure code with 驴-error is one of the fingerprinting codes robust against a collusion attack. The purpose of this study is to construct a new c-secure code which has a shorter code length for a large-scale collusion than ever proposed. We call this code a c-secure CRT code. Furthermore, we investigate possible approaches to make this code robust against random-error addition. Two approaches to this problem have already been proposed. One is a combination of an error-correcting code and a c-secure code. The other is to make inner codes of the c-secure code resilient against random-error addition. We propose a brand-new approach, called weak ID elimination, which is a modification of its outer code. We also propose a method to estimate whether the size of a coalition exceeds the traceability of this code.