{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:39:00Z","timestamp":1725755940231},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642413827"},{"type":"electronic","value":"9783642413834"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41383-4_4","type":"book-chapter","created":{"date-parts":[[2013,11,11]],"date-time":"2013-11-11T09:37:33Z","timestamp":1384162653000},"page":"53-67","source":"Crossref","is-referenced-by-count":1,"title":["Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces"],"prefix":"10.1007","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","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"D.R. 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. Infer.\u00a086(2), 595\u2013617 (2000)","journal-title":"J. Stat. Plan. Infer."},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"J.N. Staddon","year":"2001","unstructured":"Staddon, J.N., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory\u00a047(3), 1042\u20131049 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"4_CR3","first-page":"343","volume":"6","author":"D. Tonien","year":"2003","unstructured":"Tonien, D., Safavi-Naini, R.: Explicit construction of secure frameproof codes. Int. J. Pure Appl. Math.\u00a06(3), 343\u2013360 (2003)","journal-title":"Int. J. Pure Appl. Math."},{"issue":"6","key":"4_CR4","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2008.921887","volume":"54","author":"D.R. Stinson","year":"2008","unstructured":"Stinson, D.R., Zaverucha, G.M.: Some improved bounds for secure frameproof codes and related separating hash families. IEEE Trans. Inf. Theory\u00a054(6), 2508\u20132514 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"4_CR5","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/T-C.1969.222707","volume":"C-18","author":"A.D. Friedman","year":"1969","unstructured":"Friedman, A.D., Graham, R.L., Ullman, J.D.: Universal single transition time asynchronous state assignments. IEEE Trans. Comput.\u00a0C-18(6), 541\u2013547 (1969)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"4_CR6","first-page":"105","volume":"30","author":"Y.L. Sagalovich","year":"1994","unstructured":"Sagalovich, Y.L.: Separating systems. Probl. Inform. Transm.\u00a030(2), 105\u2013123 (1994)","journal-title":"Probl. Inform. Transm."},{"issue":"3","key":"4_CR7","first-page":"59","volume":"8","author":"M.S. Pinsker","year":"1972","unstructured":"Pinsker, M.S., Sagalovich, Y.L.: Lower bound on the cardinality of code of automata\u2019s states. Probl. Inform. Transm.\u00a08(3), 59\u201366 (1972)","journal-title":"Probl. Inform. Transm."},{"issue":"2","key":"4_CR8","first-page":"140","volume":"18","author":"Y.L. Sagalovich","year":"1982","unstructured":"Sagalovich, Y.L.: Completely separating systems. Probl. Inform. Transm.\u00a018(2), 140\u2013146 (1982)","journal-title":"Probl. Inform. Transm."},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","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. Discr. Math. (SIDMA)\u00a01(3), 355\u2013359 (1988)","journal-title":"SIAM J. Discr. Math. (SIDMA)"},{"key":"4_CR10","unstructured":"Cohen, G.D., Schaathun, H.G.: Asymptotic overview on separating codes. Department of Informatics, University of Bergen, Norway, Tech. Rep. 248 (August 2003)"},{"issue":"6","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1109\/TIT.2004.828140","volume":"50","author":"G.D. Cohen","year":"2004","unstructured":"Cohen, G.D., Schaathun, H.G.: Upper bounds on separating codes. IEEE Trans. Inf. Theory\u00a050(6), 1291\u20131294 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, M., Kabatiansky, G., Moreira, J.: Almost separating and almost secure frameproof codes. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), Saint Petersburg, Russia, pp. 2696\u20132700 (August 2011)","DOI":"10.1109\/ISIT.2011.6034061"},{"issue":"4","key":"4_CR13","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: Problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory\u00a049(4), 852\u2013865 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"4_CR14","doi-asserted-by":"publisher","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)\u00a022(4), 838\u2013856 (1993)","journal-title":"SIAM J. Comput. (SICOMP)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-44598-6_33","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J. Bierbrauer","year":"2000","unstructured":"Bierbrauer, J., Schellwat, H.: Almost independent and weakly biased arrays: Efficient constructions and cryptologic applications. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 533\u2013544. Springer, Heidelberg (2000)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/3-540-44750-4_36","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"D. Boneh","year":"1995","unstructured":"Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 452\u2013465. Springer, Heidelberg (1995)"},{"issue":"5","key":"4_CR17","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\u00a044(5), 1897\u20131905 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Moreira, J., Kabatiansky, G., Fern\u00e1ndez, M.: Lower bounds on almost-separating binary codes. In: Proc. IEEE Int. Workshop Inform. Forensics, Security (WIFS), Foz do Igua\u00e7u, Brazil, pp. 1\u20136 (November 2011)","DOI":"10.1109\/WIFS.2011.6123141"},{"issue":"3","key":"4_CR19","doi-asserted-by":"publisher","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 k-wise independent random variables. Random Struct. Alg.\u00a03(3), 289\u2013304 (1992)","journal-title":"Random Struct. Alg."},{"key":"4_CR20","unstructured":"Vazirani, U.V.: Randomness, adversaries and computation. Ph.D. dissertation, Dept. Elect. Eng. Comp. Sci., Univ. California, Berkeley (1986)"},{"key":"4_CR21","doi-asserted-by":"crossref","DOI":"10.1214\/lnms\/1215467407","volume-title":"Group Representations in Probability and Statistics","author":"P. Diaconis","year":"1988","unstructured":"Diaconis, P.: Group Representations in Probability and Statistics. Inst. Math. Stat., Beachwood (1988)"},{"issue":"4","key":"4_CR22","first-page":"1","volume":"3","author":"N. Alon","year":"2007","unstructured":"Alon, N., Guruswami, V., Kaufman, T., Sudan, M.: Guessing secrets efficiently via list decoding. ACM Trans. Alg.\u00a03(4), 1\u201316 (2007)","journal-title":"ACM Trans. Alg."}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41383-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,19]],"date-time":"2024-05-19T10:07:15Z","timestamp":1716113235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41383-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642413827","9783642413834"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41383-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}