Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 50 of 97 results
  • On codes for Traceability Schemes: Constructions and Bounds  Open access

     Moreira Sanchez, Jose
    Defense's date: 2013-11-13
    Universitat Politècnica de Catalunya
    Theses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Un sistema de trazabilidad o de fingerprinting es un mecanismo criptográfico que permite identificar el origen de información filtrada. En un entorno de fingerprinting, un distribuidor entrega copias de un determinado contenido a un conjunto de usuarios autorizados. Si existen miembros deshonestos (traidores) entre ellos, el distribuidor puede disuadir que realicen una redistribución ingenua del contenido entregando copias personalizadas (marcadas) a cada uno de los usuarios. El conjunto de todas las marcas de usuario se llama código de fingerprinting.No obstante, existe otra amenaza más grave. Si diversos traidores confabulan para crear una copia, combinando sus copias del contenido, entonces la copia pirata generada contendrá una marca corrompida que dificultará la identificación de traidores.Esta tesis versa sobre el estudio y análisis de códigos para su uso en sistemas de fingerprinting bajo la presencia de ataques de confabulación, y del diseño de algoritmos de identificación eficientes, es decir, en tiempo polinómico en la longitud del código.En los Capítulos 1 y 2 presentamos el tema e introducimos la notación utilizada. También presentamos algunas propiedades que caracterizan los códigos de fingerprinting, como la propiedad de separación, propiedad identificadora de padres (IPP) y propiedad de trazabilidad (TA), sujetas a estudio en este trabajo.El Capítulo 3 está dedicado al estudio del algoritmo de decodificación de lista de Kötter-Vardy y su aplicación en sistemas de fingerprinting. Empleando el algoritmo de Kötter-Vardy como parte central de los algoritmos de identificación, se analizan tres propuestas en el capítulo: identificación en códigos TA, identificación en códigos IPP e identificación en códigos de fingerprinting binarios concatenadosEn el Capítulo 4 presentamos una versión relajada de los códigos separables. Esta relajación nos lleva a obtener dos nociones diferentes: códigos cuasi separables y códigos cuasi seguros contra incriminaciones. De los resultados principales se observa que las cotas inferiores de las tasas asintóticas para códigos cuasi separables y cuasi seguros contra incriminaciones son mayores que las cotas inferiores actualmente conocidas para códigos separables ordinarios. También estudiamos como estas nuevas familias de códigos pueden utilizarse para demostrar la existencia de familias de códigos de fingerprinting de baja probabilidad de error y con un algoritmo de identificación en tiempo polinómico.En el Capítulo 5 presentamos construcciones explícitas de códigos cuasi seguros contra incriminaciones, basadas en matrices de bajo sesgo. Poniendo en común los resultados de este capítulo con los del Capítulo 4, podemos ver que, basándonos en códigos cuasi seguros contra incriminaciones, existen construcciones explícitas de códigos de fingerprinting de tasa positiva, baja probabilidad de error y con un proceso de identificación en tiempo polinómico. Demostrar que existen dichas construcciones explícitas era una de los principales objetivos de este trabajo.Finalmente, en el Capítulo 6, estudiamos la relación que existe entre las propiedades de separación y trazabilidad de los códigos de Reed-Solomon. Es un resultado bien conocido el hecho que un código TA es un código IPP, y que un código IPP es un código separable. Las implicaciones en el sentido opuesto son falsas en general. No obstante, existe una conjetura acerca de la equivalencia de estas tres propiedades en el caso de códigos de Reed-Solomon. Obtener una respuesta a esta conjetura es de una importancia relevante en el campo del fingerprinting, puesto que la caracterización de estas propiedades está directamente relacionada con el número de usuarios que puede gestionar un sistema de fingerprinting. En este capítulo investigamos esta equivalencia y proporcionamos una respuesta afirmativa para un gran número de familias de códigos de Reed-Solomon.

    A traceability or fingerprinting scheme is a cryptographic scheme that facilitates the identification of the source of leaked information. In a fingerprinting setting, a distributor delivers copies of a given content to a set of authorized users. If there are dishonest members (traitors) among them, the distributor can deter plain redistribution of the content by delivering a personalized, i.e., marked, copy to each user. The set of all user marks is known as a fingerprinting code. There is, however, another threat. If several traitors collude to create a copy that is a combination of theirs, then the pirated copy generated will contain a corrupted mark, which may obstruct the identification of traitors. This dissertation is about the study and analysis of codes for their use in traceability and fingerprinting schemes, under the presence of collusion attacks. Moreover, another of the main concerns in the present work will be the design of identification algorithms that run efficiently, i.e., in polynomial time in the code length. In Chapters 1 and 2, we introduce the topic and the notation used. We also discuss some properties that characterize fingerprinting codes known under the names of separating, traceability (TA), and identifiable parent property (IPP), which will be subject of research in the present work. Chapter 3 is devoted to the study of the Kötter-Vardy algorithm to solve a variety of problems that appear in fingerprinting schemes. The concern of the chapter is restricted to schemes based on Reed-Solomon codes. By using the Kötter-Vardy algorithm as the core part of the identification processes, three different settings are approached: identification in TA codes, identification in IPP codes and identification in binary concatenated fingerprinting codes. It is also discussed how by a careful setting of a reliability matrix, i.e., the channel information, all possibly identifiable traitors can be found. In Chapter 4, we introduce a relaxed version of separating codes. Relaxing the separating property lead us to two different notions, namely, almost separating and almost secure frameproof codes. From one of the main results it is seen that the lower bounds on the asymptotical rate for almost separating and almost secure frameproof codes are greater than the currently known lower bounds for ordinary separating codes. Moreover, we also discuss how these new relaxed versions of separating codes can be used to show the existence of families of fingerprinting codes of small error, equipped with polynomial-time identification algorithms. In Chapter 5, we present explicit constructions of almost secure frameproof codes based on weakly biased arrays. We show how such arrays provide us with a natural framework to construct these codes. Putting the results obtained in this chapter together with the results from Chapter 4, 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. We remark that showing the existence of such explicit constructions was one of the main objectives of the present work. Finally, in Chapter 6, we study the relationship between the separating and traceability properties of Reed-Solomon codes. It is a well-known result that a TA code is an IPP code, and that an IPP code is a separating code. The converse of these implications is in general false. However, it has been conjectured for some time that for Reed-Solomon codes all three properties are equivalent. Giving an answer to this conjecture has importance in the field of fingerprinting, because a proper characterization of these properties is directly related to an upper bound on the code rate i.e., the maximum users that a fingerprinting scheme can allocate. In this chapter we investigate the equivalence between these properties, and provide a positive answer for a large number of families of Reed-Solomon codes.

    Un sistema de trazabilidad o de fingerprinting es un mecanismo criptogr afi co que permite identi car el origen de informaci on que ha sido fi ltrada. En el modelo de aplicación de estos sistemas, un distribuidor entrega copias de un determinado contenido a un conjunto de usuarios autorizados. Si existen miembros deshonestos (traidores) entre ellos, el distribuidor puede disuadir que realicen una redistribuci on ingenua del contenido entregando copias personalizadas, es decir, marcadas, a cada uno de los usuarios. El conjunto de todas las marcas de usuario se conoce como c ódigo de fingerprinting. No obstante, existe otra amenaza m as grave. Si diversos traidores confabulan para crear una copia que es una combinación de sus copias del contenido, entonces la copia pirata generada contendr a una marca corrompida que di ficultar a el proceso de identificaci on de traidores. Esta tesis versa sobre el estudio y an alisis de c odigos para su uso en sistemas de trazabilidad o de fi ngerprinting bajo la presencia de ataques de confabulaci on. Otra de las cuestiones importantes que se tratan es el diseño de algoritmos de identi caci on e ficientes, es decir, algoritmos que se ejecuten en tiempo polin omico en la longitud del c odigo. En los Cap tulos 1 y 2 presentamos el tema e introducimos la notaci on que utilizaremos. Tambi en presentaremos algunas propiedades que caracterizan los c odigos de fi ngerprinting, conocidas bajo los nombres de propiedad de separaci on, propiedad identi cadora de padres (IPP) y propiedad de trazabilidad (TA), que est an sujetas a estudio en este trabajo. El Cap tulo 3 est a dedicado al estudio del algoritmo de decodi caci on de lista con informaci on de canal de Kötter-Vardy en la resoluci on de determinados problemas que aparecen en sistemas de fingerprinting. El ambito de estudio del cap ítulo son sistemas basados en c odigos de Reed-Solomon. Empleando el algoritmo de Kötter-Vardy como parte central de los algoritmos de identifi caci on, se analizan tres propuestas en el cap ítulo: identi caci on en c odigos TA, identifi caci on en c odigos IPP e identifi caci on en c odigos de fingerprinting binarios concatenados. Tambi en se analiza c omo mediante un cuidadoso ajuste de una matriz de abilidad, es decir, de la informaci on del canal, se pueden encontrar a todos los traidores que es posible identi car e ficientemente. En el Capí tulo 4 presentamos una versi on relajada de los c odigos separables. Relajando la propiedad de separaci on nos llevar a a obtener dos nociones diferentes: c odigos cuasi separables y c odigos cuasi seguros contra incriminaciones. De los resultados principales se puede observar que las cotas inferiores de las tasas asint oticas para c odigos cuasi separables y cuasi seguros contra incriminaciones son mayores que las cotas inferiores actualmente conocidas para c odigos separables ordinarios. Adem as, tambi en estudiamos como estas nuevas familias de c odigos pueden utilizarse para demostrar la existencia de familias de c odigos de ngerprinting de baja probabilidad de error y dotados de un algoritmo de identi caci on en tiempo polin omico. En el Capí tulo 5 presentamos construcciones expl citas de c odigos cuasi seguros contra incriminaciones, basadas en matrices de bajo sesgo. Mostramos como tales matrices nos proporcionan una herramienta para construir dichos c odigos. Poniendo en com un los resultados de este cap tulo con los del Capí tulo 4, podemos ver que, bas andonos en c odigos cuasi seguros contra incriminaciones, existen construcciones expl ícitas de c odigos de fi ngerprinting de tasa positiva, baja probabilidad de error y con un proceso de identi caci on en tiempo polin omico. Demostrar que existen dichas construcciones expl citas era uno de los principales objetivos de este trabajo. Finalmente, en el Capí tulo 6, estudiamos la relaci on existente entre las propiedades de separaci on y trazabilidad de los c odigos de Reed-Solomon. Es un resultado bien conocido el hecho que un c odigo TA es un c odigo IPP, y que un c odigo IPP es un c odigo separable. Las implicaciones en el sentido opuesto son falsas en general. No obstante, existe una conjetura acerca de la equivalencia de estas tres propiedades en el caso de cóodigos de Reed-Solomon. Obtener una respuesta a esta conjetura es de una importancia relevante en el campo del fi ngerprinting, puesto que la caracterización de estas propiedades est a directamente relacionada con una cota superior en la tasa del c odigo, es decir, con el n umero de usuarios que puede gestionar un sistema de fi ngerprinting. En este cap ítulo investigamos esta equivalencia y proporcionamos una respuesta afirmativa para un gran n umero de familias de c odigos de Reed-Solomon. Los resultados obtenidos parecen sugerir que la conjetura es cierta.

  • Constructions of almost secure frameproof codes based on small-bias probability spaces

     Moreira Sanchez, Jose; Fernandez Muñoz, Marcel; Kabatiansky, Grigory
    International Workshop on Security
    Presentation's date: 2013-11
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Secure 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 diagnosis and the protection of distribution rights. A relaxed definition of the properties of separation and frameproofness, in the sense of only requiring the properties to hold with high probability, shows that for the relaxed definitions these notions are different. In this paper we address the construction of almost secure frameproof codes based on small-bias probability spaces.

    Secure 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 diagnosis and the protection of distribution rights. A relaxed definition of the properties of separation and frameproofness, in the sense of only requiring the properties to hold with high probability, shows that for the relaxed definitions these notions are different. In this paper we address the construction of almost secure frameproof codes based on small-bias probability spaces.

  • On the relationship between the traceability properties of Reed-Solomon codes

     Moreira Sanchez, Jose; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    Advances in mathematics of communications
    Date of publication: 2012-11
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Códigos para la protección de la propiedad industrial

     Rico Novella, Francisco Jose; Soriano Ibáñez, Miguel; Fernandez Muñoz, Marcel
    Participation in a competitive project

     Share

  • Access to the full text
    Parallelization of the interpolation process in the Koetter-Vardy soft-decision list decoding algorithm  Open access

     Moreira Sanchez, Jose; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    International Conference on Computational and Mathematical Methods in Science and Engineering
    Presentation's date: 2012-07-02
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    List 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 in the communications protocol can choose the appropriate candidate codeword among the elements of the set. The Koetter-Vardy algorithm is a soft-decision decoding algorithm for Reed-Solomon codes. It is based on two sequential processes: interpolation and factorization. In most applications it is interesting to efficiently decode in real time. This paper discusses some parallelization results about the interpolation process, which is the highest time-consuming part of the Koetter-Vardy algorithm.

  • Identifying traitors using the Koetter - Vardy algorithm

     Fernandez Muñoz, Marcel; Moreira Sanchez, Jose; Soriano Ibáñez, Miguel
    IEEE transactions on information theory
    Date of publication: 2011-02
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • C/033194/10 Cooperación Institucional entre las universidades AAU y UPC y académica en el ámbito de las TIC

     Vidal Lopez, Eva Maria; Torres Urgell, Luis; Vidal Manzano, Jose; Serrat Fernandez, Juan; Aguilar Igartua, Mónica; Fernandez Muñoz, Marcel
    Participation in a competitive project

     Share

  • Almost separating and almost secure frameproof codes

     Fernandez Muñoz, Marcel; Kabatiansky, Grigory; Moreira Sanchez, Jose
    IEEE International Symposium on Information Theory
    Presentation's date: 2011
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Use of turbo codes with low-rate convolutional constituent codes in fingerprinting scenarios

     Tomas Buliart, Joan; Gómez Muro, Ana; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    Information Forensics and Security
    Presentation's date: 2011-11-29
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    We 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 codes with maximum free distance. Low rate convolutional codes are commonly used in code-spread CDMA applications. Moreover, we show how efficient traitor tracing can be performed by means of the turbo decoding algorithm.

  • A family of asymptotically good binary fingerprinting codes

     Cotrina Navau, Josep; Fernandez Muñoz, Marcel
    IEEE transactions on information theory
    Date of publication: 2010-10
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    A 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 word created by a coalition of at most c dishonest users, will expose at least one of the guilty parties with probability 1-ϵ. The Boneh-Shaw fingerprinting codes are n-secure codes with ϵB error, where n also denotes the number of authorized users. Unfortunately, the length the Boneh-Shaw codes should be of order O(n3 log(n/ϵB)), which is prohibitive for practical applications. In this paper, we prove that the Boneh-Shaw codes are (c<; n)-secure for lengths of order O(nc2 log(n/ϵB)). Moreover, in this paper it is also shown how to use these codes to construct binary fingerprinting codes of length L=O(c6 log(c/ϵ) log n), with probability of error ϵ<;ϵB and an identification algorithm of complexity poly(log n)=poly(L). These results improve in some aspects the best known schemes and with a much more simple construction.

  • A note about the identifier parent property in Reed-Solomon codes

     Fernandez Muñoz, Marcel; Cotrina Navau, Josep; Soriano Ibáñez, Miguel; Domingo, Neus
    Computers and security
    Date of publication: 2010-07
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Traitor tracing over YouTube video service-proof of concept

     Tomas Buliart, Joan; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    Telecommunication systems
    Date of publication: 2010-09
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Identificació de punts de col·laboració amb la Wollo University

     Vidal Lopez, Eva Maria; Torres Urgell, Luis; Aguilar Igartua, Mónica; Prat Viñas, Luis; Muñoz Lopez, Francisco Javier; Fernandez Muñoz, Marcel; Hesselbach Serra, Xavier; Aragones Cervera, Xavier
    Participation in a competitive project

     Share

  • 12th International Conference on Information and Comunications Security

     Forné, Jordi; Pegueroles Valles, Josep Rafel; Fernandez Muñoz, Marcel; Muñoz Tapia, Jose Luis; Soriano Ibáñez, Miguel
    Participation in a competitive project

     Share

  • On the IPP Properties of Reed-Solomon Codes

     Fernandez Muñoz, Marcel; Cotrina Navau, Josep; Soriano Ibáñez, Miguel; Domingo, N
    IFIP Advances in Information and Communication Technology
    Date of publication: 2009-01
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Improvement of Collusion Secure Convolutional Fingerprinting Information Codes

     Tomas Buliart, Joan; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    Lecture notes in computer science
    Date of publication: 2009
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • GRUP SEGURETAT DE LA INFORMACIÓ (ISG)

     Pegueroles Valles, Josep Rafel; Hernández Serrano, Juan Bautista; Pallares Segarra, Esteve; Fernandez Muñoz, Marcel; León Abarca, Olga; Forné, Jordi; Esparza Martin, Oscar; Muñoz Tapia, Jose Luis; Parra Arnau, Javier; Soriano Ibáñez, Miguel
    Participation in a competitive project

     Share

  • PROVISION SEGURA DE SERVICIOS SOBRE EL P2P (P2PSEC)

     Mata Diaz, Jorge; Cruz Llopis, Luis Javier de La; Alins Delgado, Juan Jose; Pegueroles Valles, Josep Rafel; León Abarca, Olga; Rico Novella, Francisco Jose; Fernandez Muñoz, Marcel; Martin Faus, Isabel Victoria; Esparza Martin, Oscar; Forga Alberich, Jordi; Hernández Serrano, Juan Bautista; Muñoz Tapia, Jose Luis; Soriano Ibáñez, Miguel
    Participation in a competitive project

     Share

  • On the IPP properties of Reed-Solomon codes

     Fernandez Muñoz, Marcel; Cotrina Navau, Josep; Soriano Ibáñez, Miguel; Domingo, Neus
    International Information Security Conference
    Presentation's date: 2009-05
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Codes with traceability properties are used in schemes where the identification of users that illegally redistribute content is required. For any code with traceability properties, the Identifiable Parent Property (c-IPP) seems to be less restrictive than the Traceability (c-TA) property. In this paper, we show that for Reed-Solomon codes both properties are in many cases equivalent. More precisely, we show that for an [n,k,d] Reed-Solomon code, defined over a field that contains the n¿-¿d roots of unity, both properties are equivalent. This answers a question posted by Silverberg et al. in [10,11], for a large family of Reed-Solomon codes.

  • New Considerations about the Correct Design of Turbo Fingerprinting Codes

     Tomas Buliart, Joan; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    Lecture notes in computer science
    Date of publication: 2008-01
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • New considerations about the correct design of turbo fingerprinting codes

     Tomas Buliart, Joan; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    European Symposium on Research in Computer Security
    Presentation's date: 2008-10
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Since 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 proposed by Zhang et al.. The main idea is a new fingerprinting code composed of an outer turbo code and an inner code based on the Boneh-Shaw model. The major contribution of this paper is a new analysis of this new family of codes that shows its drawbacks. These drawbacks must be considered in order to perform a correct design of a turbo fingerprinting scheme otherwise the scheme cannot retrieve the traitor users which is the main goal of digital fingerprinting scheme. Moreover, the identification of these drawbacks allows to discuss an entirely new construction of fingerprinting codes based on turbo codes.

    Since 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 proposed by Zhang et al.. The main idea is a new fingerprinting code composed of an outer turbo code and an inner code based on the Boneh-Shaw model. The major contribution of this paper is a new analysis of this new family of codes that shows its drawbacks. These drawbacks must be considered in order to perform a correct design of a turbo fingerprinting scheme otherwise the scheme cannot retrieve the traitor users which is the main goal of digital fingerprinting scheme. Moreover, the identification of these drawbacks allows to discuss an entirely new construction of fingerprinting codes based on turbo codes.

  • A class of non-linear asymptotic fingerprinting codes with epsilon-error

     Fernandez Muñoz, Marcel; Cotrina Navau, Josep; Soriano Ibáñez, Miguel
    Online information review
    Date of publication: 2007-01
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • A Note About the Traceability Properties of Linear Codes

     Fernandez Muñoz, Marcel; Cotrina Navau, Josep; Soriano Ibáñez, Miguel; Domingo, N
    Lecture notes in computer science
    Date of publication: 2007-11
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Using Informed Coding and Informed Embedding to Design Robust Fingerprinting Embedding Systems

     Tomàs, Joan; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    Lecture notes in computer science
    Date of publication: 2007-09
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Tracing illegal redistribution using errors-and-erasures and side information decoding algorithms

     Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel; Cotrina Navau, Josep
    IET information security
    Date of publication: 2007-06
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Ares. team for Advanced REsearch on information Security and privacy

     Soriano Ibáñez, Miguel; Domingo Ferrer, Josep; Muñoz Tapia, Jose Luis; Forné, Jordi; Pegueroles Valles, Josep Rafel; Hernández Serrano, Juan Bautista; Pallares Segarra, Esteve; Fernandez Muñoz, Marcel
    Participation in a competitive project

     Share

  • On the traceability properties of linear and Chinese Remainder Theorem codes

     Cotrina Navau, Josep; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel; Domingo, N
    10th International Conference on Information Security and Cryptology
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Improvement of Collusion Secure Convolutional Fingerprinting Information Codes

     Tomas, Joan; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    Second International Conference on Information Theoretic Security
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Using informed coding and informed embedding to design robust fingerprinting embedding systems

     Tomas Buliart, Joan; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    International Conference on Knowledge-Based and Intelligent Information and Engineering Systems
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Several new video and image watermarking proposals are based on Informed Coding and Informed Embedding. However, these systems can be not easily used in fingerprinting schemes because they do not satisfy the marking assumption defined in [1]. In this paper we discuss some guidelines to adapt a watermarking system based on informed coding and informed embedding to a generic fingerprinting code, while keeping up with the marking assumption, that is to say, when as a result of one collusion attack of two users, that have different marks that represent the value 0 in the nth position, we have a pirate mark wich represents the 0 value in this same nth position. This can be achieved modifying the work of Miller, Do¨er and Cox in

  • A note about the traceability properties of linear codes

     Fernandez Muñoz, Marcel; Cotrina Navau, Josep; Soriano Ibáñez, Miguel; Domingo, Neus
    International Conference on Information Security and Cryptology
    Presentation's date: 2007-11
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    We 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 be derived. In other words, there exists a value Z C , with n¿-¿d¿=¿Z C ¿=¿c(n¿-¿d), such that any linear code is c-TA if c¿<¿n/Z C . We also prove that in many cases this condition is also necessary. These results are applied to cyclic and Reed-Solomon codes.

    We 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 be derived. In other words, there exists a value Z C , with n¿-¿d¿=¿Z C ¿=¿c(n¿-¿d), such that any linear code is c-TA if c¿<¿n/Z C . We also prove that in many cases this condition is also necessary. These results are applied to cyclic and Reed-Solomon codes.

  • Soft Decision Decoding of Boneh-Shaw Fingerprinting Codes

     Schaatun, H G; Fernandez Muñoz, Marcel
    IEICE transactions on fundamentals of electronics communications and computer
    Date of publication: 2006-10
    Journal article

     Share Reference managers Reference managers Open in new window

  • Obtaining Asymptotic Fingerprint Codes Through a New Analysis of the Boneh-Shaw Codes

     Fernandez Muñoz, Marcel; Cotrina Navau, Josep
    Lecture notes in computer science
    Date of publication: 2006-11
    Journal article

     Share Reference managers Reference managers Open in new window

  • Obtaining Traceability Codes from Chinese Reminder Theorem Codes

     Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel; Cotrina Navau, Josep
    IEICE transactions on fundamentals of electronics communications and computer
    Date of publication: 2006-01
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Multicast Copyright Protection System Based on a Trusted Soft-Engine

     Pegueroles Valles, Josep Rafel; Fernandez Muñoz, Marcel; Rico Novella, Francisco Jose; Soriano Ibáñez, Miguel
    International journal of business data communications and networking
    Date of publication: 2006-04
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • A practical solution for distribution rights protection in multicast environments

     Pegueroles Valles, Josep Rafel; Fernandez Muñoz, Marcel; Rico Novella, Francisco Jose; Soriano Ibáñez, Miguel
    Lecture notes in computer science
    Date of publication: 2006-05
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • e-Representative

     Forné, Jordi; Soriano Ibáñez, Miguel; Pegueroles Valles, Josep Rafel; Fernandez Muñoz, Marcel; Muñoz Tapia, Jose Luis; Esparza Martin, Oscar
    Participation in a competitive project

     Share

  • A practical solution for distribution rights protection in multicast environments

     Pegueroles Valles, Josep Rafel; Fernandez Muñoz, Marcel; Rico Novella, Francisco Jose; Soriano Ibáñez, Miguel
    The 2006 International Conference on Computational Science and its Applications
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Watermarking de Software: Estado del arte

     Tomàs, Joan; Ciurana, Marc; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    IX Reunion Española sobre Criptologia y Seguridad de la Informacion
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Familias de códigos localizadores basadas en el Teorema Chino del Resto

     Cotrina Navau, Josep; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    IX Reunion Española sobre Criptologia y Seguridad de la Informacion
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Families of traceability codes based on the Chinese Remainder Theorem

     Cotrina Navau, Josep; Fernandez Muñoz, Marcel; Casademont Serra, Jordi
    2006 IEEE Information Theory Workshop
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Obtaining Asymptotic Fingerprint Codes Through a New Analysis of the Boneh-Shaw Codes

     Fernandez Muñoz, Marcel; Cotrina Navau, Josep
    Second SKLOIS Conference, Inscrypt 2006
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Sistema de comunicaciones para la búsqueda, localización y establecimiento de contacto de personas basado en selección de perfiles e intermediación de operador

     Pegueroles Valles, Josep Rafel; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    Date of request: 2006-01-13
    Invention patent

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Sistema de comunicaciones para la búsqueda, localización y establecimiento de contacto de personas basado en selección de perfiles e intermediación de operador.

    La presente invención se refiere a un sistema de comunicaciones para la búsqueda de personas que respondan a un determinado perfil, su localización en un área próxima al dispositivo y la puesta en contacto del dispositivo con la persona buscada. Esto se realizará mediante la intervención de un dispositivo central con funciones de operador, que se comunicará con los dos dispositivos que intervienen, y realizará las tareas de facturación por la puesta en contacto.

  • Tracing traitors by guessing secrets. The q-ary case

     Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel; Cotrina Navau, Josep
    Lecture notes in computer science
    Date of publication: 2005-04
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • A New Class of Codes for Fingerprinting Schemes

     Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel; Cotrina Navau, Josep
    Lecture notes in computer science
    Date of publication: 2005-04
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Practical Scenarios for the van Trung-Martirosyan Codes

     Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel; Cotrina Navau, Josep
    Lecture notes in computer science
    Date of publication: 2005-05
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Equidistant Binary Fingerprinting Codes. Existence and Identification Algorithms

     Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel; Cotrina Navau, Josep
    Lecture notes in computer science
    Date of publication: 2005-05
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Fingerprinting Schemes. Identifying the Guilty Sources Using Side Information

     Soriano Ibáñez, Miguel; Fernandez Muñoz, Marcel; Cotrina Navau, Josep
    Lecture notes in computer science
    Date of publication: 2005-09
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Multimedia Copyright Protection Platform Demonstrator

     Soriano Ibáñez, Miguel; Fernandez Muñoz, Marcel; Sayrol Clols, Elisa; Tomàs, J; Casanelles, J; Pegueroles Valles, Josep Rafel; Hernández Serrano, Juan Bautista
    Lecture notes in computer science
    Date of publication: 2005-05
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • A Family of Collusion 2-Secure Codes

     Cotrina Navau, Josep; Fernandez Muñoz, Marcel; Soriano Ibáñez, Miguel
    Lecture notes in computer science
    Date of publication: 2005-06
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Grupo de investigación consolidado GRC-ISG

     Soriano Ibáñez, Miguel; Pallares Segarra, Esteve; Esparza Martin, Oscar; Muñoz Tapia, Jose Luis; Forné, Jordi; Fernandez Muñoz, Marcel; Hernández Serrano, Juan Bautista
    Participation in a competitive project

     Share