Combinatorial properties of frameproof and traceability codes
In order to protect copyrighted material, codes may be embedded in the content or codes may be associated with the keys used to recover the content. Codes can offer protection by providing some form of traceability (TA) for pirated data. Several researchers have studied different notions of TA and r...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2001-03, Vol.47 (3), p.1042-1049 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1049 |
|---|---|
| container_issue | 3 |
| container_start_page | 1042 |
| container_title | IEEE transactions on information theory |
| container_volume | 47 |
| creator | Staddon, J.N. Stinson, D.R. Ruizhong Wei |
| description | In order to protect copyrighted material, codes may be embedded in the content or codes may be associated with the keys used to recover the content. Codes can offer protection by providing some form of traceability (TA) for pirated data. Several researchers have studied different notions of TA and related concepts in previous years. "Strong" versions of TA allow at least one member of a coalition that constructs a "pirate decoder" to be traced. Weaker versions of this concept ensure that no coalition can "frame" a disjoint user or group of users. All these concepts can be formulated as codes having certain combinatorial properties. We study the relationships between the various notions, and we discuss equivalent formulations using structures such as perfect hash families. We use methods from combinatorics and coding theory to provide bounds (necessary conditions) and constructions (sufficient conditions) for the objects of interest. |
| doi_str_mv | 10.1109/18.915661 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_18_915661</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>915661</ieee_id><sourcerecordid>914655818</sourcerecordid><originalsourceid>FETCH-LOGICAL-c375t-32f03054649d6495d112863193a671e90520c1ffeba7435331e382aa716ef4d03</originalsourceid><addsrcrecordid>eNp9kL1PwzAQxS0EEqUwsDJlAjGk-PwVe2BAFV9SJRaYLTc5S0ZJXex06H-Pq1SMDKe7d_fT0-kRcg10AUDNA-iFAakUnJAZSNnURklxSmaUgq6NEPqcXOT8XaSQwGbkcRmHddi4Mabg-mqb4hbTGDBX0Vc-uQHLqoxu01Vjci26dejDuK_a2GG-JGfe9Rmvjn1Ovl6eP5dv9erj9X35tKpb3six5sxTTqVQwnSlZAfAtOJguFMNoKGS0Ra8x7VrBJecA3LNnGtAoRcd5XNyN_mWZ352mEc7hNxi37sNxl22BoSSUoMu5O2_JNOMCs4OlvcT2KaYc0JvtykMLu0tUHuI0oK2U5SFvZnYgIh_3PH4C1PSbIo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28204320</pqid></control><display><type>article</type><title>Combinatorial properties of frameproof and traceability codes</title><source>IEEE Electronic Library (IEL)</source><creator>Staddon, J.N. ; Stinson, D.R. ; Ruizhong Wei</creator><creatorcontrib>Staddon, J.N. ; Stinson, D.R. ; Ruizhong Wei</creatorcontrib><description>In order to protect copyrighted material, codes may be embedded in the content or codes may be associated with the keys used to recover the content. Codes can offer protection by providing some form of traceability (TA) for pirated data. Several researchers have studied different notions of TA and related concepts in previous years. "Strong" versions of TA allow at least one member of a coalition that constructs a "pirate decoder" to be traced. Weaker versions of this concept ensure that no coalition can "frame" a disjoint user or group of users. All these concepts can be formulated as codes having certain combinatorial properties. We study the relationships between the various notions, and we discuss equivalent formulations using structures such as perfect hash families. We use methods from combinatorics and coding theory to provide bounds (necessary conditions) and constructions (sufficient conditions) for the objects of interest.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/18.915661</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>IEEE</publisher><subject>Associations ; Codes ; Combinatorial analysis ; Construction ; Equivalence ; Keys ; Pirate ; Reproduction ; Tantalum</subject><ispartof>IEEE transactions on information theory, 2001-03, Vol.47 (3), p.1042-1049</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c375t-32f03054649d6495d112863193a671e90520c1ffeba7435331e382aa716ef4d03</citedby><cites>FETCH-LOGICAL-c375t-32f03054649d6495d112863193a671e90520c1ffeba7435331e382aa716ef4d03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/915661$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,781,785,797,27929,27930,54763</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/915661$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Staddon, J.N.</creatorcontrib><creatorcontrib>Stinson, D.R.</creatorcontrib><creatorcontrib>Ruizhong Wei</creatorcontrib><title>Combinatorial properties of frameproof and traceability codes</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>In order to protect copyrighted material, codes may be embedded in the content or codes may be associated with the keys used to recover the content. Codes can offer protection by providing some form of traceability (TA) for pirated data. Several researchers have studied different notions of TA and related concepts in previous years. "Strong" versions of TA allow at least one member of a coalition that constructs a "pirate decoder" to be traced. Weaker versions of this concept ensure that no coalition can "frame" a disjoint user or group of users. All these concepts can be formulated as codes having certain combinatorial properties. We study the relationships between the various notions, and we discuss equivalent formulations using structures such as perfect hash families. We use methods from combinatorics and coding theory to provide bounds (necessary conditions) and constructions (sufficient conditions) for the objects of interest.</description><subject>Associations</subject><subject>Codes</subject><subject>Combinatorial analysis</subject><subject>Construction</subject><subject>Equivalence</subject><subject>Keys</subject><subject>Pirate</subject><subject>Reproduction</subject><subject>Tantalum</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kL1PwzAQxS0EEqUwsDJlAjGk-PwVe2BAFV9SJRaYLTc5S0ZJXex06H-Pq1SMDKe7d_fT0-kRcg10AUDNA-iFAakUnJAZSNnURklxSmaUgq6NEPqcXOT8XaSQwGbkcRmHddi4Mabg-mqb4hbTGDBX0Vc-uQHLqoxu01Vjci26dejDuK_a2GG-JGfe9Rmvjn1Ovl6eP5dv9erj9X35tKpb3six5sxTTqVQwnSlZAfAtOJguFMNoKGS0Ra8x7VrBJecA3LNnGtAoRcd5XNyN_mWZ352mEc7hNxi37sNxl22BoSSUoMu5O2_JNOMCs4OlvcT2KaYc0JvtykMLu0tUHuI0oK2U5SFvZnYgIh_3PH4C1PSbIo</recordid><startdate>20010301</startdate><enddate>20010301</enddate><creator>Staddon, J.N.</creator><creator>Stinson, D.R.</creator><creator>Ruizhong Wei</creator><general>IEEE</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7SP</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20010301</creationdate><title>Combinatorial properties of frameproof and traceability codes</title><author>Staddon, J.N. ; Stinson, D.R. ; Ruizhong Wei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c375t-32f03054649d6495d112863193a671e90520c1ffeba7435331e382aa716ef4d03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Associations</topic><topic>Codes</topic><topic>Combinatorial analysis</topic><topic>Construction</topic><topic>Equivalence</topic><topic>Keys</topic><topic>Pirate</topic><topic>Reproduction</topic><topic>Tantalum</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Staddon, J.N.</creatorcontrib><creatorcontrib>Stinson, D.R.</creatorcontrib><creatorcontrib>Ruizhong Wei</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Electronics & Communications Abstracts</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Staddon, J.N.</au><au>Stinson, D.R.</au><au>Ruizhong Wei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Combinatorial properties of frameproof and traceability codes</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2001-03-01</date><risdate>2001</risdate><volume>47</volume><issue>3</issue><spage>1042</spage><epage>1049</epage><pages>1042-1049</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>In order to protect copyrighted material, codes may be embedded in the content or codes may be associated with the keys used to recover the content. Codes can offer protection by providing some form of traceability (TA) for pirated data. Several researchers have studied different notions of TA and related concepts in previous years. "Strong" versions of TA allow at least one member of a coalition that constructs a "pirate decoder" to be traced. Weaker versions of this concept ensure that no coalition can "frame" a disjoint user or group of users. All these concepts can be formulated as codes having certain combinatorial properties. We study the relationships between the various notions, and we discuss equivalent formulations using structures such as perfect hash families. We use methods from combinatorics and coding theory to provide bounds (necessary conditions) and constructions (sufficient conditions) for the objects of interest.</abstract><pub>IEEE</pub><doi>10.1109/18.915661</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2001-03, Vol.47 (3), p.1042-1049 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_18_915661 |
| source | IEEE Electronic Library (IEL) |
| subjects | Associations Codes Combinatorial analysis Construction Equivalence Keys Pirate Reproduction Tantalum |
| title | Combinatorial properties of frameproof and traceability codes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-13T10%3A04%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Combinatorial%20properties%20of%20frameproof%20and%20traceability%20codes&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Staddon,%20J.N.&rft.date=2001-03-01&rft.volume=47&rft.issue=3&rft.spage=1042&rft.epage=1049&rft.pages=1042-1049&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/18.915661&rft_dat=%3Cproquest_RIE%3E914655818%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28204320&rft_id=info:pmid/&rft_ieee_id=915661&rfr_iscdi=true |