Show simple item record

dc.contributor.authorAranda, Castor
dc.contributor.authorFernández Muñoz, Marcel
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria Telemàtica
dc.date.accessioned2018-02-27T14:34:23Z
dc.date.issued2017
dc.identifier.citationAranda, C., Fernandez, M. Improved existence bounds on IPP codes using the Clique Lovász Local Lemma. A: IEEE International Symposium on Information Theory. "2017 IEEE International Symposium on InformationTheory (ISIT 2017): Aachen, Germany: 25-30 June 2017". Aachen: Institute of Electrical and Electronics Engineers (IEEE), 2017, p. 3160-3164.
dc.identifier.isbn978-1-5090-4097-1
dc.identifier.urihttp://hdl.handle.net/2117/114551
dc.description.abstractNowadays, 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 (audio, video, software, text, etc.) face one danger: once a copy of the content is purchased by a client, this user may illegally redistribute it. This way, a distributor of digital content with intellectual property rights must take some steps to ensure the preservation of its business and, given that the use and benefit of a legally purchased copy of the content by a client implies reading the data (either with a computer, a DVD player, or any other device), anti-copy protection of such copyrighted content is not viable. Here is where new mechanics such as fingerprinting (first presented in [18]) take place: instead of distributing identical copies of the data, fingerprinting consists of embedding a series of marks on each copy, with each mark unique for each user and keeping record of which mark is received by which user, thus dissuading them from redistributing the files, under the threat of being caught. Once the distributor intercepts an illegally distributed copy, he will be able to read the marks to determine which user is guilty, and therefore, the user is labelled as a traitor.
dc.format.extent5 p.
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectÀrees temàtiques de la UPC::Informàtica::Seguretat informàtica
dc.subject.lcshInformation theory
dc.subject.lcshComputer security
dc.subject.otherIdentifying parent property
dc.subject.otherFingerprinting codes
dc.subject.otherLovasz Local Lemma
dc.titleImproved existence bounds on IPP codes using the Clique Lovász Local Lemma
dc.typeConference report
dc.subject.lemacInformació, Teoria de la
dc.subject.lemacSeguretat informàtica
dc.contributor.groupUniversitat Politècnica de Catalunya. ISG - Grup de Seguretat de la Informació
dc.identifier.doi10.1109/ISIT.2017.8007112
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://ieeexplore.ieee.org/document/8007112/
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac21981689
dc.description.versionPostprint (published version)
dc.relation.projectidinfo:eu-repo/grantAgreement/MINECO/1PE/TEC2015-68734-R
dc.date.lift10000-01-01
local.citation.authorAranda, C.; Fernandez, M.
local.citation.contributorIEEE International Symposium on Information Theory
local.citation.pubplaceAachen
local.citation.publicationName2017 IEEE International Symposium on InformationTheory (ISIT 2017): Aachen, Germany: 25-30 June 2017
local.citation.startingPage3160
local.citation.endingPage3164


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder