Reed-Solomon Codes and Their Applications
Reed-Solomon Codes and Their Applications
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
An Efficient Public Key Traitor Tracing Scheme
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Efficient Traitor Tracing Algorithms Using List Decoding
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
What's hot and what's not: tracking most frequent items dynamically
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition (Lecture Notes in Computer Science)
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Efficiently decodable non-adaptive group testing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Practical pay-TV scheme using traitor tracing scheme for multiple channels
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Efficient key distribution schemes for secure media delivery in pay-TV systems
IEEE Transactions on Multimedia
Nonrandom binary superimposed codes
IEEE Transactions on Information Theory
Efficiently Preserving Data Privacy Range Queries in Two-Tiered Wireless Sensor Networks
UIC-ATC '12 Proceedings of the 2012 9th International Conference on Ubiquitous Intelligence and Computing and 9th International Conference on Autonomic and Trusted Computing
| Hi-index | 0.00 |
In non-adaptive group testing (NAGT), the time for decoding is a crucial problem. Given an unknown string x∈{0, 1}N with at most d ones, the problem is how to determine xi=1 using as few tests as possible so that x can be decoded as fast as possible. A NAGT can be represented by a t ×N matrix. Although we do not know x, this matrix, which is called d-disjunct matrix, can reconstruct it exactly. In this paper, we consider a general problem, in which x is an array of N non-negative integer elements and has up to d positive integers. From nonrandom construction, we prove that we can decode a d-disjunct matrix, which is built from [n, k]q-Reed-Solomon codes and identity matrix Iq, and recover x defined above in poly(d) ·t log2t+O(d3n log(d logN)) with t=O(d2log2N). We also discuss this problem when x contains negative integer elements. Pay-Television internet-based can be applied these results directly. Since the number of customers is very large, our system must be prevented from illegal buyers. This problem is called traitor tracing. To the best of our knowledge, this is the first result that raises a variant of NAGT and gets how to trace traitors without using probability.