{"title":"合谋安全指纹识别和B/sub 2/-序列","authors":"G. Cohen, S. Litsyn, G. Zémor","doi":"10.1109/ISIT.2000.866540","DOIUrl":null,"url":null,"abstract":"We discuss a strategy initiated by Boneh and Shaw (see IEEE Trans. Inform. Theory, vol.44, p.1897-1905, 1998) for collusion-secure fingerprinting. We show that under this strategy, finding fingerprinting schemes that resist coalitions of two users amounts to finding B/sub 2/-sequences of binary vectors. A sequence of vectors v/sub 1/, v/sub 2/,..., v/sub n/ is a B/sub 2/-sequence if all sums v/sub i/+v/sub j/, 1/spl les/i/spl les/j/spl les/n, are different: the associated extremal set-theoretic problem is what is the maximal size of a B/sub 2/-sequence? We shed new light on this old combinatorial problem and improve on previously known upper bounds.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Collusion-secure fingerprinting and B/sub 2/-sequences\",\"authors\":\"G. Cohen, S. Litsyn, G. Zémor\",\"doi\":\"10.1109/ISIT.2000.866540\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We discuss a strategy initiated by Boneh and Shaw (see IEEE Trans. Inform. Theory, vol.44, p.1897-1905, 1998) for collusion-secure fingerprinting. We show that under this strategy, finding fingerprinting schemes that resist coalitions of two users amounts to finding B/sub 2/-sequences of binary vectors. A sequence of vectors v/sub 1/, v/sub 2/,..., v/sub n/ is a B/sub 2/-sequence if all sums v/sub i/+v/sub j/, 1/spl les/i/spl les/j/spl les/n, are different: the associated extremal set-theoretic problem is what is the maximal size of a B/sub 2/-sequence? We shed new light on this old combinatorial problem and improve on previously known upper bounds.\",\"PeriodicalId\":108752,\"journal\":{\"name\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2000.866540\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2000.866540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Collusion-secure fingerprinting and B/sub 2/-sequences
We discuss a strategy initiated by Boneh and Shaw (see IEEE Trans. Inform. Theory, vol.44, p.1897-1905, 1998) for collusion-secure fingerprinting. We show that under this strategy, finding fingerprinting schemes that resist coalitions of two users amounts to finding B/sub 2/-sequences of binary vectors. A sequence of vectors v/sub 1/, v/sub 2/,..., v/sub n/ is a B/sub 2/-sequence if all sums v/sub i/+v/sub j/, 1/spl les/i/spl les/j/spl les/n, are different: the associated extremal set-theoretic problem is what is the maximal size of a B/sub 2/-sequence? We shed new light on this old combinatorial problem and improve on previously known upper bounds.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
