{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:01:03Z","timestamp":1743098463593,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030164577"},{"type":"electronic","value":"9783030164584"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16458-4_21","type":"book-chapter","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:02:19Z","timestamp":1555282939000},"page":"371-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Tracing Traitors Math"],"prefix":"10.1007","author":[{"given":"Grigory","family":"Kabatiansky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,28]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Wagner, N.R.: Fingerprinting. In: Proceedings of the Symposium on Security and Privacy, Oakland, CA, pp. 18\u201322, April 1983","DOI":"10.1109\/SP.1983.10018"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-39799-X_15","volume-title":"Advances in Cryptology \u2014 CRYPTO 1985 Proceedings","author":"GR Blakley","year":"1986","unstructured":"Blakley, G.R., Meadows, C., Purdy, G.B.: Fingerprinting long forgiving messages. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 180\u2013189. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_15"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology \u2014 CRYPTO 1994","author":"B Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257\u2013270. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_25"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1006\/jcta.1997.2851","volume":"82","author":"HD Hollmann","year":"1998","unstructured":"Hollmann, H.D., van Lint, J.H., Linnartz, J.P., Tolhuizen, L.M.: On codes with the identifiable parent property. J. Comb. Theory Ser. A 82(2), 121\u2013133 (1998)","journal-title":"J. Comb. Theory Ser. A"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D Boneh","year":"1998","unstructured":"Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44, 1897\u20131905 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TIT.2003.809570","volume":"49","author":"A Barg","year":"2003","unstructured":"Barg, A., Blakley, G.R., Kabatiansky, G.: Digital fingerprinting codes: problems statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(4), 852\u2013865 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"DR Stinson","year":"1998","unstructured":"Stinson, D.R., Wei, R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discrete Math. 11(1), 41\u201353 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, vol. 48, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"11","key":"21_CR9","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10623-008-9253-z","volume":"51","author":"MJ Collins","year":"2009","unstructured":"Collins, M.J.: Upper bounds for parent-identifying set systems. Des. Codes Crypt. 51(2), 167\u2013173 (2009)","journal-title":"Des. Codes Crypt."},{"key":"21_CR11","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, vol. 16, North-Holland Mathematical Library (1977)"},{"key":"21_CR12","unstructured":"Kabatiansky, G.A.: Good ternary 2-traceability codes exist. In: Proceedings of the IEEE Symposium on Information Theory, Chicago, IL, p. 203 (2004)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/s11122-005-0022-6","volume":"41","author":"GA Kabatiansky","year":"2005","unstructured":"Kabatiansky, G.A.: Codes for copyright protection: the case of two pirates. Probl. Inf. Transm. 41, 182\u2013186 (2005)","journal-title":"Probl. Inf. Transm."},{"issue":"8","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1016\/j.jcta.2010.02.009","volume":"117","author":"SR Blackburn","year":"2010","unstructured":"Blackburn, S.R., Etzion, T., Ng, S.-L.: Traceability codes. J. Comb. Theory Ser. A 117(8), 1049\u20131057 (2010)","journal-title":"J. Comb. Theory Ser. A"},{"key":"21_CR15","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 4th edn., Wiley Series in Discrete Mathematics and Optimization (2016)"},{"issue":"2\u20133","key":"21_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jco.2003.08.012","volume":"20","author":"A Barg","year":"2004","unstructured":"Barg, A., Kabatiansky, G.: Class of I.P.P codes with effective tracing algorithm. J. Complex. 20(2\u20133), 137\u2013147 (2004)","journal-title":"J. Complex."},{"issue":"7","key":"21_CR17","doi-asserted-by":"publisher","first-page":"3029","DOI":"10.1109\/18.959283","volume":"47","author":"R Safavi-Naini","year":"2001","unstructured":"Safavi-Naini, R., Wang, Y.: New results on frame-proof codes and traceability schemes. IEEE Trans. Inf. Theory 47(7), 3029\u20133033 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"21_CR18","doi-asserted-by":"publisher","first-page":"5888","DOI":"10.1109\/TIT.2010.2070632","volume":"56","author":"J Lofvenberg","year":"2010","unstructured":"Lofvenberg, J., Larsson, J.-A.: Comments on \u201cnew results on frame-proof codes and traceability schemes\u201d. IEEE Trans. Inf. Theory 56(11), 5888\u20135889 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-66278-7_8","volume-title":"Coding Theory and Applications","author":"E Egorova","year":"2017","unstructured":"Egorova, E., Kabatiansky, G.: Analysis of two tracing traitor schemes via coding theory. In: Barbero, \u00c1.I., Skachek, V., Ytrehus, \u00d8. (eds.) ICMCTA 2017. LNCS, vol. 10495, pp. 84\u201392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66278-7_8"},{"issue":"3","key":"21_CR20","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/S0895480100376848","volume":"14","author":"A Barg","year":"2001","unstructured":"Barg, A., Cohen, G., Encheva, S., Kabatiansky, G., Z\u00e9mor, G.: A hypergraph approach to the identifying parent property: the case of multiple parents. SIAM J. Discrete Math. 14(3), 423\u2013431 (2001)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"21_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jcta.2003.08.001","volume":"104","author":"N Alon","year":"2003","unstructured":"Alon, N., Cohen, G., Krivelevich, M., Litsyn, S.: Generalized hashing and parent-identifying codes. J. Comb. Theory Ser. A 104(1), 207\u2013215 (2003)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"6","key":"21_CR22","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/T-C.1969.222707","volume":"18","author":"AD Friedman","year":"1969","unstructured":"Friedman, A.D., Graham, R.L., Ullman, J.D.: Universal single transition time asynchronous state assignments. IEEE Trans. Comput. 18(6), 541\u2013547 (1969)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"21_CR23","first-page":"105","volume":"30","author":"YL Sagalovich","year":"1994","unstructured":"Sagalovich, Y.L.: Separating systems. Prob. Inf. Transm. 30(2), 105\u2013123 (1994)","journal-title":"Prob. Inf. Transm."},{"key":"21_CR24","unstructured":"Cohen G.D., Schaathun H.G.: Asymptotic overview on separating codes. Technical report 248, Department of Informatics, University of Bergen, Bergen, Norway (2003)"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"JN Staddon","year":"2001","unstructured":"Staddon, J.N., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47, 1042\u20131049 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"21_CR26","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1134\/S0032946017010021","volume":"53","author":"IV Vorob\u2019ev","year":"2017","unstructured":"Vorob\u2019ev, I.V.: Bounds on the rate of separating codes. Prob. Inf. Transm. 53(1), 30\u201341 (2017)","journal-title":"Prob. Inf. Transm."},{"issue":"4","key":"21_CR27","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W Kautz","year":"1964","unstructured":"Kautz, W., Singleton, R.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory 10(4), 363\u2013377 (1964)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"21_CR28","first-page":"166","volume":"18","author":"AG Dyachkov","year":"1982","unstructured":"Dyachkov, A.G., Rykov, V.V.: Bounds on the length of disjunctive codes. Prob. Inf. Transm. 18(2), 166\u2013171 (1982)","journal-title":"Prob. Inf. Transm."},{"issue":"1","key":"21_CR29","first-page":"79","volume":"51","author":"Z Furedi","year":"1985","unstructured":"Furedi, Z., Erdos, P., Frankl, P.: Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51(1), 79\u201389 (1985)","journal-title":"Israel J. Math."},{"issue":"5","key":"21_CR30","doi-asserted-by":"publisher","first-page":"3450","DOI":"10.1109\/TIT.2017.2766659","volume":"64","author":"Y Gu","year":"2018","unstructured":"Gu, Y., Miao, Y.: Bounds on traceability schemes. IEEE Trans. Inf. Theory 64(5), 3450\u20133460 (2018)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Codes, Cryptology and Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16458-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:48:56Z","timestamp":1710251336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-16458-4_21"}},"subtitle":["Dedicated to the Memory of Bob Blakley - Pioneer of Digital Fingerprinting and Inventor of Secret Sharing"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030164577","9783030164584"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16458-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"C2SI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Codes, Cryptology, and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"c2si2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.c2si-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 invited papers and 3 workshop papers are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}