Proceedings Article10.1109/ISIT.2011.6034061
Almost separating and almost secure frameproof codes
Marcel Fernandez,Grigory Kabatiansky,José Moreira +2 more
- 03 Oct 2011
- pp 2696-2700
7
TL;DR: A relaxed version of separating and secure frameproof codes is introduced and it is shown that for the relaxed definitions these two notions are different, as opposed to the original definitions when these notions coincide.
read more
Abstract: The theory of separating codes has been applied in several areas of science ranging from automata synthesis to the protection of distribution rights. In this paper, we introduce a relaxed version of separating and secure frameproof codes and show that for the relaxed definitions these two notions are different, as opposed to the original definitions when these notions coincide. Moreover, we also discuss how this new relaxed versions of the codes can be used to construct a family of fingerprinting codes.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Almost separating and almost secure frameproof codes over $$q$$q-ary alphabets
TL;DR: This paper shows how the original definition of separating code for alphabets of arbitrary size can be relaxed in two different ways, namely almost separating and almost secure frameproof codes, yielding two different concepts.
Lower bounds on almost-separating binary codes
José Moreira,Grigory Kabatiansky,Marcel Fernandez +2 more
- 29 Nov 2011
TL;DR: It is shown how almost separating codes can be used to construct a family of fingerprinting codes and the lower bounds on the rate are greater than the currently known lower bounds for ordinary separating codes.
3
Constructions of almost secure frameproof codes based on small-bias probability spaces
José Moreira,Marcel Fernandez,Grigory Kabatiansky +2 more
- 18 Nov 2013
TL;DR: This paper addresses the construction of almost secure frameproof codes based on small-bias probability spaces with a relaxed definition of the properties of separation and frameproofness.
2
•Dissertation
On codes for traceability schemes: constructions and bounds
José Moreira Sánchez
- 13 Nov 2013
TL;DR: This dissertation is about the study and analysis of codes for their use in traceability and fingerprinting schemes, under the presence of collusion attacks, and shows that there exist explicit constructions of fingerprinting codes based on almost secure frameproof codes with positive rate, small error and polynomial-time identification complexity.
2
Constructions of almost secure frameproof codes with applications to fingerprinting schemes
TL;DR: The construction of almost secure frameproof codes discussed here is based on weakly biased arrays, a class of combinatorial objects tightly related to weakly dependent random variables.
References
Collusion-secure fingerprinting for digital data
Dan Boneh,J M Shaw +1 more
TL;DR: This paper discusses methods for assigning code-words for the purpose of fingerprinting digital data, e.g., software, documents, music, and video, and presents a general fingerprinting solution which is secure in the context of collusion.
Improved decoding of Reed-Solomon and algebraic-geometry codes
Venkatesan Guruswami,Madhu Sudan +1 more
TL;DR: An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometry codes is presented and a solution to a weighted curve-fitting problem is presented, which may be of use in soft-decision decoding algorithms for Reed- Solomon codes.
1.1K
Combinatorial properties of frameproof and traceability codes
TL;DR: In this paper, the authors studied different notions of traceability (TA) for pirated data and discussed equivalent formulations using structures such as perfect hash families, and used methods from combinatorics and coding theory to provide bounds (necessary conditions) and constructions (sufficient conditions) for the objects of interest.
376
Digital fingerprinting codes: problem statements, constructions, identification of traitors
TL;DR: Binary fingerprinting codes secure against size-t coalitions are presented which enable the distributor (decoder) to recover at least one of the users from the coalition with probability of error exp(-/spl Omega/(n)) for M=exp(/spl omega/(n)).
Separating partition systems and locally different sequences
János Körner,Gábor Simonyi +1 more
TL;DR: The problem of perfect hashing is generalized and some initial results are obtained and an improvement on earlier results for $( i, j )$-separating systems of partitions is provided.
53