Browsing by Author "Fernández Muñoz, Marcel"
Now showing items 1-16 of 16
-
A family of asymptotically good binary fingerprinting codes
(2010-10)
Article
Restricted access - publisher's policyA fingerprinting code is a set of codewords that are embedded in each copy of a digital object with the purpose of making each copy unique. If the fingerprinting code is c-secure with error, then the decoding of a pirate ... -
Almost IPP-codes or provably secure digital fingerprinting codes
(Institute of Electrical and Electronics Engineers (IEEE), 2015)
Conference report
Restricted access - publisher's policyCodes with the Identifiable Parent Property (IPP codes) form a very useful tool in traitor tracing schemes since they guarantee (with probability 1) identification of at least one of the traitors. We consider a natural ... -
Almost separating and almost secure frameproof codes
(2011)
Conference report
Restricted access - publisher's policyThe 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 ... -
Almost separating and almost secure frameproof codes over q-ary alphabets
(2015-03-27)
Article
Open AccessIn this paper we discuss some variations of the notion of separating code for alphabets of arbitrary size. We show how the original definition can be relaxed in two different ways, namely almost separating and almost secure ... -
A new class of codes for fingerprinting schemes
(Springer, 2005)
Conference report
Restricted access - publisher's policyIn this paper we discuss the problem of collusion secure fingerprinting. In the first part of our contribution we prove the existence of equidistant codes that can be used as fingerprinting codes. Then we show that by ... -
A note about the traceability properties of linear codes
(Springer, 2007)
Conference report
Restricted access - publisher's policyWe characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c 2¿<¿n/(n¿-¿d). In this paper, we show that a less restrictive condition can ... -
Códigos de fingerprinting binarios. Nuevos paradigmas de identificación
(2016)
Conference report
Open AccessLos códigos con la Identifiable Parent Property garantizan, con probabilidad 1, la identificación de como mínimo de uno de los traidores en sistemas de Traitor Tracing. Desafortunadamente, para el caso de códigos binarios ... -
Constructions of almost secure frameproof codes based on small-bias probability spaces
(Springer International Publishing, 2013)
Conference report
Restricted access - publisher's policySecure frameproof code is the name given to a separating code when studied in relation to fingerprinting schemes. Separating codes are combinatorial objects that have found to be useful in many areas such as technical ... -
Constructions of almost secure frameproof codes with applications to fingerprinting schemes
(2018-04)
Article
Open AccessThis paper presents explicit constructions of fingerprinting codes. The proposed constructions use a class of codes called almost secure frameproof codes. An almost secure frameproof code is a relaxed version of a secure ... -
Improved existence bounds on IPP codes using the Clique Lovász Local Lemma
(Institute of Electrical and Electronics Engineers (IEEE), 2017)
Conference report
Restricted access - publisher's policyNowadays, one of the biggest problems that challenges distributors of digital content is, precisely, protecting such content against redistribution. Those who trade with any of the multiple digital information formats ... -
Multimedia copyright protection platform demonstrator
(Springer, 2005)
Conference report
Restricted access - publisher's policyThe work presented in this paper consists in the development of a portable platform to protect the copyright and distribution rights of digital contents, and empirically demonstrate the capacity of several marking and ... -
Multimedia fingerprinting with noise via signature codes for weighted noisy adder channels and compressed sensing
(2017)
Conference report
Open AccessWe propose a new coding scheme for multimedia fingerprinting resistant to noise. Our scheme is based on signature codes for weighted noisy adder channel. The scheme (codes) can trace the entire coalition of pirates and ... -
New considerations about the correct design of turbo fingerprinting codes
(Springer, 2008)
Conference report
Restricted access - publisher's policySince the introduction of turbo codes in 1993, many new applications for this family of codes have been proposed. One of the latest, in the context of digital fingerprinting, is called turbo fingerprinting codes and was ... -
Parallelization of the interpolation process in the Koetter-Vardy soft-decision list decoding algorithm
(2012)
Conference lecture
Open AccessList decoding is a decoding strategy that provides a set of codewords at the output of the channel decoder. Since this technique corrects errors beyond the correcting bound of the code, upper layers in the application or ... -
Tracing traitors by guessing secrets. The q-ary case
(Springer, 2005)
Conference report
Restricted access - publisher's policyIn this paper we present, by solving a variant of the guessing secrets problem defined by Chung, Graham and Leighton [3], a sequential traitor tracing scheme equipped with an efficient identification algorithm. Sequential ... -
Use of Turbo Codes with Low-Rate Convolutional Constituent Codes in Fingerprinting Scenarios
(IEEE, 2011)
Conference lecture
Restricted access - publisher's policyWe discuss the use of turbo codes in fingerprinting schemes. More precisely, we present a family of turbo codes that are secure against attacking coalitions of size 2. This family is build upon a class of low-rate convolutional ...
