{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:14Z","timestamp":1740122534956,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:00:00Z","timestamp":1584576000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:00:00Z","timestamp":1584576000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"RFBR","doi-asserted-by":"crossref","award":["20-07-00652","20-07-00652"],"award-info":[{"award-number":["20-07-00652","20-07-00652"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Spanish Government grant","award":["TEC2015-68734-R (MINECO\/FEDER) \u201cANFORA\u201d"],"award-info":[{"award-number":["TEC2015-68734-R (MINECO\/FEDER) \u201cANFORA\u201d"]}]},{"name":"Catalan Government Grant","award":["2017 SGR 782"],"award-info":[{"award-number":["2017 SGR 782"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10623-020-00749-4","type":"journal-article","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T16:04:40Z","timestamp":1584633880000},"page":"1885-1892","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On non-binary traceability set systems"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9242-573X","authenticated-orcid":false,"given":"Elena","family":"Egorova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Fernandez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigory","family":"Kabatiansky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"issue":"1","key":"749_CR1","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":"3","key":"749_CR2","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. Discret. Math. 14(3), 423\u2013431 (2001).","journal-title":"SIAM J. Discret. Math."},{"key":"749_CR3","first-page":"43","volume":"307","author":"S Blackburn","year":"2003","unstructured":"Blackburn S.: Combinatorial schemes for protecting digital content. Surv. comb. 307, 43\u201378 (2003).","journal-title":"Surv. comb."},{"issue":"8","key":"749_CR4","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1016\/j.jcta.2010.02.009","volume":"117","author":"S Blackburn","year":"2010","unstructured":"Blackburn S., 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":"749_CR5","first-page":"313","volume":"48","author":"GR Blakley","year":"1979","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. Proc. Natl. Comput. Conf. 48, 313 (1979).","journal-title":"Proc. Natl. Comput. Conf."},{"key":"749_CR6","doi-asserted-by":"crossref","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Proceedings of the Annual International Cryptology Conference pp. 257\u2013270 (1994)","DOI":"10.1007\/3-540-48658-5_25"},{"issue":"2","key":"749_CR7","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."},{"issue":"3","key":"749_CR8","first-page":"7","volume":"18","author":"A D\u2019yachkov","year":"1982","unstructured":"D\u2019yachkov A., Rykov V.: Bounds on the length of disjunctive codes. Probl. Pereda. Inf. 18(3), 7\u201313 (1982).","journal-title":"Probl. Pereda. Inf."},{"issue":"3","key":"749_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1134\/S0032946019030049","volume":"55","author":"E Egorova","year":"2019","unstructured":"Egorova E.: On generalization of ipp codes and ipp set systems. Probl. Inf. Transm. 55(3), 241\u2013253 (2019).","journal-title":"Probl. Inf. Transm."},{"key":"749_CR10","doi-asserted-by":"crossref","unstructured":"Egorova, E., Fernandez, M., Kabatiansky, G.: A construction of traceability set systems with polynomial tracing algorithm. In: Proceedings of the International Symposium on Information Theory, ISIT (2019)","DOI":"10.1109\/ISIT.2019.8849353"},{"key":"749_CR11","doi-asserted-by":"crossref","unstructured":"Egorova, E., Kabatiansky, G.: Analysis of two tracing traitor schemes via coding theory. In: Proceedings of the International Castle Meeting on Coding Theory and Applications, pp. 84\u201392 (2017)","DOI":"10.1007\/978-3-319-66278-7_8"},{"key":"749_CR12","doi-asserted-by":"crossref","unstructured":"Egorova, E., Vorobyev, I.: New lower bound on the rate of traceability set systems. In: Proceedings of the XVI International Symposium Problems of Redundancy in Information and Control Systems, pp. 93\u201398 (2019)","DOI":"10.1109\/REDUNDANCY48165.2019.9003335"},{"issue":"1","key":"749_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s P., Frankl P., F\u00fcredi Z.: Families of finite sets in which no set is covered by the union of r others. Isr. J. Math. 51(1), 79\u201389 (1985).","journal-title":"Isr. J. Math."},{"key":"749_CR14","doi-asserted-by":"crossref","unstructured":"Fiat, A., Naor, M.: Broadcast encryption. In: Proceedings of the Annual International Cryptology Conference, pp. 480\u2013491 (1993)","DOI":"10.1007\/3-540-48329-2_40"},{"key":"749_CR15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927020","author":"Y Gu","year":"2019","unstructured":"Gu Y., Cheng M., Kabatiansky G., Miao Y.: Probabilistic existence results for parent-identifying schemes. IEEE Trans. Inf. Theory (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2927020.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"749_CR16","doi-asserted-by":"publisher","first-page":"3450","DOI":"10.1109\/TIT.2017.2766659","volume":"64","author":"Y Gu","year":"2017","unstructured":"Gu Y., Miao Y.: Bounds on traceability schemes. IEEE Trans. Inf. Theory 64(5), 3450\u20133460 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"749_CR17","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., Linnartz J.P., Tolhuizen L.: 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":"749_CR18","doi-asserted-by":"crossref","unstructured":"Kabatiansky, G.: On the tracing traitors math. In: Proceedings of the International Conference on Codes, Cryptology, and Information Security, pp. 371\u2013380. Springer (2019)","DOI":"10.1007\/978-3-030-16458-4_21"},{"issue":"3","key":"749_CR19","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1134\/S0032946019030074","volume":"55","author":"G Kabatiansky","year":"2019","unstructured":"Kabatiansky G.: Traceability codes and their generalizations. Probl. Inf. Transm. 55(3), 283\u2013294 (2019).","journal-title":"Probl. Inf. Transm."},{"issue":"7","key":"749_CR20","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1109\/TIT.2002.1013151","volume":"48","author":"T Lindkvist","year":"2002","unstructured":"Lindkvist T., Lofvenberg J., Svanstrom M.: A class of traceability codes. IEEE Trans. Inf. Theory 48(7), 2094\u20132096 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"749_CR21","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.: 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"},{"issue":"7","key":"749_CR22","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":"749_CR23","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":"3","key":"749_CR24","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"J Staddon","year":"2001","unstructured":"Staddon J., Stinson D., Wei R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47(3), 1042\u20131049 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"749_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D Stinson","year":"1998","unstructured":"Stinson D., Wei R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discret. Math. 11(1), 41\u201353 (1998).","journal-title":"SIAM J. Discret. Math."},{"key":"749_CR26","doi-asserted-by":"crossref","unstructured":"Stinson, D., Wei, R.: Key preassigned traceability schemes for broadcast encryption. In: Proceedings of the International Workshop on Selected Areas in Cryptography, pp. 144\u2013156 (1998)","DOI":"10.1007\/3-540-48892-8_12"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00749-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-020-00749-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00749-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T01:11:15Z","timestamp":1616116275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-020-00749-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,19]]},"references-count":26,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["749"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00749-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2020,3,19]]},"assertion":[{"value":"12 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}