{"title":"合谋——安全且经济的非法多媒体再分发检测","authors":"F. Sebé, J. Domingo-Ferrer","doi":"10.1109/TSMCC.2003.817351","DOIUrl":null,"url":null,"abstract":"Intellectual property protection of multimedia content is essential to the successful deployment of Internet content delivery platforms. There are two general approaches to multimedia copy protection: copy prevention and copy detection. Past experience shows that only copy detection based on mark embedding techniques looks promising. Multimedia fingerprinting means embedding a different buyer-identifying mark in each copy of the multimedia content being sold. Fingerprinting is subject to collusion attacks: a coalition of buyers collude and follow some strategy to mix their copies with the aim of obtaining a mixture from which none of their identifying marks can be retrieved; if their strategy is successful, the colluders can redistribute the mixture with impunity. A construction is presented in this paper to obtain fingerprinting codes for copyright protection which survive any collusion strategy involving up to three buyers (3-security). It is shown that the proposed scheme achieves 3-security with a codeword length dramatically shorter than the one required by the general Boneh-Shaw construction. Thus the proposed fingerprints require much less embedding capacity. Due to their own clandestine nature, collusions tend to involve a small number of buyers, so that there is plenty of use for codes providing cost-effective protection against collusions of size up to three.","PeriodicalId":55005,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","volume":"1 1","pages":"382-389"},"PeriodicalIF":0.0000,"publicationDate":"2003-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Collusion-secure and cost-effective detection of unlawful multimedia redistribution\",\"authors\":\"F. Sebé, J. Domingo-Ferrer\",\"doi\":\"10.1109/TSMCC.2003.817351\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Intellectual property protection of multimedia content is essential to the successful deployment of Internet content delivery platforms. There are two general approaches to multimedia copy protection: copy prevention and copy detection. Past experience shows that only copy detection based on mark embedding techniques looks promising. Multimedia fingerprinting means embedding a different buyer-identifying mark in each copy of the multimedia content being sold. Fingerprinting is subject to collusion attacks: a coalition of buyers collude and follow some strategy to mix their copies with the aim of obtaining a mixture from which none of their identifying marks can be retrieved; if their strategy is successful, the colluders can redistribute the mixture with impunity. A construction is presented in this paper to obtain fingerprinting codes for copyright protection which survive any collusion strategy involving up to three buyers (3-security). It is shown that the proposed scheme achieves 3-security with a codeword length dramatically shorter than the one required by the general Boneh-Shaw construction. Thus the proposed fingerprints require much less embedding capacity. Due to their own clandestine nature, collusions tend to involve a small number of buyers, so that there is plenty of use for codes providing cost-effective protection against collusions of size up to three.\",\"PeriodicalId\":55005,\"journal\":{\"name\":\"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re\",\"volume\":\"1 1\",\"pages\":\"382-389\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TSMCC.2003.817351\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Re","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TSMCC.2003.817351","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Collusion-secure and cost-effective detection of unlawful multimedia redistribution
Intellectual property protection of multimedia content is essential to the successful deployment of Internet content delivery platforms. There are two general approaches to multimedia copy protection: copy prevention and copy detection. Past experience shows that only copy detection based on mark embedding techniques looks promising. Multimedia fingerprinting means embedding a different buyer-identifying mark in each copy of the multimedia content being sold. Fingerprinting is subject to collusion attacks: a coalition of buyers collude and follow some strategy to mix their copies with the aim of obtaining a mixture from which none of their identifying marks can be retrieved; if their strategy is successful, the colluders can redistribute the mixture with impunity. A construction is presented in this paper to obtain fingerprinting codes for copyright protection which survive any collusion strategy involving up to three buyers (3-security). It is shown that the proposed scheme achieves 3-security with a codeword length dramatically shorter than the one required by the general Boneh-Shaw construction. Thus the proposed fingerprints require much less embedding capacity. Due to their own clandestine nature, collusions tend to involve a small number of buyers, so that there is plenty of use for codes providing cost-effective protection against collusions of size up to three.