{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:29Z","timestamp":1740122489743,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,4,20]],"date-time":"2017-04-20T00:00:00Z","timestamp":1492646400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["Consolider Ingenio 2010 CSD2007-00004 ARES","TEC2011-26491 COPPI"],"award-info":[{"award-number":["Consolider Ingenio 2010 CSD2007-00004 ARES","TEC2011-26491 COPPI"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TEC2015-68734-R ANFORA"],"award-info":[{"award-number":["TEC2015-68734-R ANFORA"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["14-50-00150"],"award-info":[{"award-number":["14-50-00150"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10623-017-0359-z","type":"journal-article","created":{"date-parts":[[2017,4,20]],"date-time":"2017-04-20T10:58:22Z","timestamp":1492685902000},"page":"785-802","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constructions of almost secure frameproof codes with applications to fingerprinting schemes"],"prefix":"10.1007","volume":"86","author":[{"given":"Jos\u00e9","family":"Moreira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Fern\u00e1ndez","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":[[2017,4,20]]},"reference":[{"issue":"3","key":"359_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N Alon","year":"1992","unstructured":"Alon N., Goldreich O., H\u00e5stad J., Peralta R.: Simple constructions of almost \n                        $$k$$\n                        \n                            \n                                k\n                            \n                        \n                    -wise independent random variables. Random Struct. Algorithms 3(3), 289\u2013304 (1992).","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"359_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1290672.1290679","volume":"3","author":"N Alon","year":"2007","unstructured":"Alon N., Guruswami V., Kaufman T., Sudan M.: Guessing secrets efficiently via list decoding. ACM Trans. Algorithms 3(4), 1\u201316 (2007).","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"359_CR3","doi-asserted-by":"crossref","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: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(4), 852\u2013865 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"359_CR4","doi-asserted-by":"crossref","unstructured":"Bierbrauer J., Schellwat H.: Almost independent and weakly biased arrays: efficient constructions and cryptologic applications. In: Proceedings of the International Cryptology Conference (CRYPTO). Lecture Notes in Computer Science (LNCS), vol. 1880, pp. 533\u2013544. Santa Barbara, CA (2000).","DOI":"10.1007\/3-540-44598-6_33"},{"key":"359_CR5","doi-asserted-by":"crossref","unstructured":"Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. In: Proceedings of the International Cryptology Conference (CRYPTO). Lecture Notes in Computer Science (LNCS), vol. 963, pp. 452\u2013465. Santa Barbara, CA (1995).","DOI":"10.1007\/3-540-44750-4_36"},{"issue":"5","key":"359_CR6","doi-asserted-by":"crossref","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(5), 1897\u20131905 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"359_CR7","doi-asserted-by":"crossref","unstructured":"Chor B., Fiat A., Naor M.: Tracing traitors. In: Proceedings of the International Cryptology Conference (CRYPTO). Lecture Notes in Computer Science (LNCS), vol. 839, pp. 480\u2013491. Santa Barbara, CA (1994).","DOI":"10.1007\/3-540-48658-5_25"},{"issue":"3","key":"359_CR8","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/18.841169","volume":"46","author":"B Chor","year":"2000","unstructured":"Chor B., Fiat A., Naor M., Pinkas B.: Tracing traitors. IEEE Trans. Inf. Theory 46(3), 893\u2013910 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"359_CR9","unstructured":"Chor B., Goldreich O., Hasted J., Freidmann J., Rudich S., Smolensky R.: The bit extraction problem or \n                        $$t$$\n                        \n                            \n                                t\n                            \n                        \n                    -resilient functions. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 396\u2013407. Singer Island, FL (1984)."},{"key":"359_CR10","unstructured":"Cohen G.D., Encheva S., Schaathun H.G.: On separating codes. Technical Report 2001D003, ENST, Paris, France (2001)."},{"key":"359_CR11","unstructured":"Cohen G.D., Schaathun H.G.: Asymptotic overview on separating codes. Technical Report 248. Department of Informatics, University of Bergen, Norway (2003)."},{"issue":"6","key":"359_CR12","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1109\/TIT.2004.828140","volume":"50","author":"GD Cohen","year":"2004","unstructured":"Cohen G.D., Schaathun H.G.: Upper bounds on separating codes. IEEE Trans. Inf. Theory 50(6), 1291\u20131294 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"359_CR13","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez M., Kabatiansky G., Moreira J.: Almost separating and almost secure frameproof codes. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 2696\u20132700. Saint Petersburg, Russia (2011).","DOI":"10.1109\/ISIT.2011.6034061"},{"key":"359_CR14","unstructured":"Forney G.D.: Concatenated codes. Technical Report 440, Research Laboratory of Electronics, MIT, Cambridge, MA (1966)."},{"issue":"6","key":"359_CR15","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/T-C.1969.222707","volume":"C\u201318","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. C\u201318(6), 541\u2013547 (1969).","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"359_CR16","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/0401035","volume":"1","author":"J K\u00f6rner","year":"1988","unstructured":"K\u00f6rner J., Simonyi G.: Separating partition systems and locally different sequences. SIAM J. Discret. Math. (SIDMA) 1(3), 355\u2013359 (1988).","journal-title":"SIAM J. Discret. Math. (SIDMA)"},{"key":"359_CR17","doi-asserted-by":"crossref","unstructured":"Moreira J., Fern\u00e1ndez M., Kabatiansky G.: Constructions of almost secure frameproof codes based on small-bias probability spaces. In: Proceedings of the International Workshop on Security (IWSEC). Lecture Notes in Computer Science (LNCS), vol. 8231, pp. 53\u201367. Okinawa, Japan (2013).","DOI":"10.1007\/978-3-642-41383-4_4"},{"issue":"1","key":"359_CR18","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s10623-015-0060-z","volume":"80","author":"J Moreira","year":"2016","unstructured":"Moreira J., Fern\u00e1ndez M., Kabatiansky G.: Almost separating and almost secure frameproof codes over \n                        $$q$$\n                        \n                            \n                                q\n                            \n                        \n                    -ary alphabets. Des. Codes Cryptogr. 80(1), 11\u201328 (2016).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"359_CR19","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J Naor","year":"1993","unstructured":"Naor J., Naor M.: Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. (SICOMP) 22(4), 838\u2013856 (1993).","journal-title":"SIAM J. Comput. (SICOMP)"},{"issue":"3","key":"359_CR20","first-page":"59","volume":"8","author":"MS Pinsker","year":"1972","unstructured":"Pinsker M.S., Sagalovich Y.L.: Lower bound on the cardinality of code of automata\u2019s states. Probl. Inf. Transm. 8(3), 59\u201366 (1972).","journal-title":"Probl. Inf. Transm."},{"issue":"2","key":"359_CR21","first-page":"140","volume":"18","author":"YL Sagalovich","year":"1982","unstructured":"Sagalovich Y.L.: Completely separating systems. Probl. Inf. Transm. 18(2), 140\u2013146 (1982).","journal-title":"Probl. Inf. Transm."},{"issue":"2","key":"359_CR22","first-page":"105","volume":"30","author":"YL Sagalovich","year":"1994","unstructured":"Sagalovich Y.L.: Separating systems. Probl. Inf. Transm. 30(2), 105\u2013123 (1994).","journal-title":"Probl. Inf. Transm."},{"issue":"3","key":"359_CR23","doi-asserted-by":"crossref","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(3), 1042\u20131049 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"359_CR24","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"DR Stinson","year":"2000","unstructured":"Stinson D.R., van Trung T., Wei R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Stat. Plan. Inference 86(2), 595\u2013617 (2000).","journal-title":"J. Stat. Plan. Inference"},{"issue":"2","key":"359_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1346330.1346335","volume":"55","author":"G Tardos","year":"2008","unstructured":"Tardos G.: Optimal probabilistic fingerprint codes. J. ACM 55(2), 1\u201324 (2008).","journal-title":"J. ACM"},{"key":"359_CR26","unstructured":"Vazirani U.V.: Randomness, adversaries and computation. Ph.D. thesis, Department of Electrical Engineering and Computer Science, University of California, Berkeley (1986)."},{"key":"359_CR27","doi-asserted-by":"crossref","unstructured":"Vazirani U.V., Vazirani V.V.: Efficient and secure pseudo-random number generation. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 458\u2013463. Singer Island, FL (1984).","DOI":"10.1109\/SFCS.1984.715948"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0359-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0359-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0359-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,3]],"date-time":"2018-03-03T04:27:32Z","timestamp":1520051252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0359-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,20]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["359"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0359-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2017,4,20]]}}}