长度为 $$t+1$$ 的 t 强多媒体 IPP 编码的构造

IF 16.4 1区化学 Q1 CHEMISTRY, MULTIDISCIPLINARY

Accounts of Chemical Research Pub Date : 2024-05-28 DOI:10.1007/s10623-024-01422-w

Jing Jiang, Fenggui Pei, Cailin Wen, Minquan Cheng, Henk D. L. Hollmann

{"title":"长度为 $$t+1$$ 的 t 强多媒体 IPP 编码的构造","authors":"Jing Jiang, Fenggui Pei, Cailin Wen, Minquan Cheng, Henk D. L. Hollmann","doi":"10.1007/s10623-024-01422-w","DOIUrl":null,"url":null,"abstract":"Strongly multimedia identifiable parent property code (t-SMIPPC) was introduced for protecting multimedia contents from illegally redistributing under the averaging collusion attack. Such a code has efficient algorithms for tracing colluders. However, there are few results about the existence of such codes up to now. In this paper, we focus on t-SMIPPCs with length \$t+1\$ where \$t \\ge 2\$ is an integer. We first improve the lower bound on the size of such codes. For the case \$t=2\$, i.e., 2-SMIPPCs with length 3, we further investigate combinatorial properties of the codes. Based on these properties, optimal q-ary 2-SMIPPCs with length 3 are constructed for \$q\\equiv 0,1,2,5 \\pmod 6\$.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Constructions of t-strongly multimedia IPP codes with length $$t+1$$\",\"authors\":\"Jing Jiang, Fenggui Pei, Cailin Wen, Minquan Cheng, Henk D. L. Hollmann\",\"doi\":\"10.1007/s10623-024-01422-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Strongly multimedia identifiable parent property code (t-SMIPPC) was introduced for protecting multimedia contents from illegally redistributing under the averaging collusion attack. Such a code has efficient algorithms for tracing colluders. However, there are few results about the existence of such codes up to now. In this paper, we focus on t-SMIPPCs with length \\\$t+1\\\$ where \\\$t \\\\ge 2\\\$ is an integer. We first improve the lower bound on the size of such codes. For the case \\\$t=2\\\$, i.e., 2-SMIPPCs with length 3, we further investigate combinatorial properties of the codes. Based on these properties, optimal q-ary 2-SMIPPCs with length 3 are constructed for \\\$q\\\\equiv 0,1,2,5 \\\\pmod 6\\\$.\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2024-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-024-01422-w\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01422-w","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

强多媒体可识别父属性代码（t-SMIPPC）被引入用于保护多媒体内容免受平均串通攻击下的非法再分发。这种代码具有追踪串通者的高效算法。然而，到目前为止，有关此类代码存在的研究成果还很少。在本文中，我们关注长度为 $t+1$ 的 t-SMIPPC，其中 $t \ge 2$ 是整数。我们首先改进了这种编码的大小下限。对于 $t=2$ 的情况，即长度为 3 的 2-SMIPPCs ，我们进一步研究了编码的组合特性。基于这些特性，我们为 $q\equiv 0,1,2,5 \pmod 6$ 构造了长度为 3 的最优 qary 2-SMIPPCs 。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Constructions of t-strongly multimedia IPP codes with length $$t+1$$

Strongly multimedia identifiable parent property code (t-SMIPPC) was introduced for protecting multimedia contents from illegally redistributing under the averaging collusion attack. Such a code has efficient algorithms for tracing colluders. However, there are few results about the existence of such codes up to now. In this paper, we focus on t-SMIPPCs with length $t+1$ where $t \ge 2$ is an integer. We first improve the lower bound on the size of such codes. For the case $t=2$, i.e., 2-SMIPPCs with length 3, we further investigate combinatorial properties of the codes. Based on these properties, optimal q-ary 2-SMIPPCs with length 3 are constructed for $q\equiv 0,1,2,5 \pmod 6$.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Accounts of Chemical Research 化学-化学综合

CiteScore

31.40

自引率

1.10%

发文量

312

审稿时长

2 months

期刊介绍： Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.