{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:39:36Z","timestamp":1725532776517},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642012433"},{"type":"electronic","value":"9783642012440"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01244-0_8","type":"book-chapter","created":{"date-parts":[[2009,5,23]],"date-time":"2009-05-23T08:53:02Z","timestamp":1243068782000},"page":"87-97","source":"Crossref","is-referenced-by-count":2,"title":["On the IPP Properties of Reed-Solomon Codes"],"prefix":"10.1007","author":[{"given":"Marcel","family":"Fernandez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep","family":"Cotrina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"Soriano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neus","family":"Domingo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1006\/jcta.2001.3177","volume":"95","author":"N. Alon","year":"2001","unstructured":"Alon, N., Fischer, E., Szegedy, M.: Parent-identifying codes. J. Comb. Theory, Ser. A\u00a095(2), 349\u2013359 (2001)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"6","key":"8_CR2","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1017\/S0963548304006388","volume":"37","author":"N. Alon","year":"2004","unstructured":"Alon, N., Stav, U.: New bounds on parent-identifying codes: The case of multiple parents. Combinatorics, Probability & Computing\u00a037(6), 795\u2013807 (2004)","journal-title":"Combinatorics, Probability & Computing"},{"key":"8_CR3","doi-asserted-by":"crossref","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. Tech. rep., DIMACS 2000-20 (2000)","DOI":"10.1016\/S1571-0653(04)00151-9"},{"issue":"2-3","key":"8_CR4","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.A.: A class of i.p.p. codes with efficient identification. J. Complexity\u00a020(2-3), 137\u2013147 (2004)","journal-title":"J. Complexity"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","first-page":"480","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"B. Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 480\u2013491. Springer, Heidelberg (1994)"},{"key":"8_CR6","doi-asserted-by":"publisher","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. Inform. Theory\u00a046, 893\u2013910 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"8_CR7","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1049\/el:20020409","volume":"38","author":"M. Fernandez","year":"2002","unstructured":"Fernandez, M., Soriano, M.: Algorithm to decode identifiable parent property codes. Electronics Letters\u00a038(12), 552\u2013553 (2002)","journal-title":"Electronics Letters"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1006\/jcta.1997.2851","volume":"82","author":"H.D.L. Hollmann","year":"1998","unstructured":"Hollmann, H.D.L., van Lint, J.H., Linnartz, J.P., Tolhuizen, L.M.G.M.: On codes with the Identifiable Parent Property. J. Combinatorial Theory\u00a082(2), 121\u2013133 (1998)","journal-title":"J. Combinatorial Theory"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-45311-3_12","volume-title":"Progress in Cryptology - INDOCRYPT 2001","author":"P. Sarkar","year":"2001","unstructured":"Sarkar, P., Stinson, D.R.: Frameproof and IPP codes. In: Pandu Rangan, C., Ding, C. (eds.) INDOCRYPT 2001. LNCS, vol.\u00a02247, pp. 117\u2013127. Springer, Heidelberg (2001), citeseer.ist.psu.edu\/486714.html"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/3-540-45682-1_11","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"A. Silverberg","year":"2001","unstructured":"Silverberg, A., Staddon, J., Walker, J.: Efficient traitor tracing algorithms using list decoding. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, p. 175. Springer, Heidelberg (2001)"},{"issue":"5","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/TIT.2003.810630","volume":"49","author":"A. Silverberg","year":"2003","unstructured":"Silverberg, A., Staddon, J., Walker, J.L.: Applications of list decoding to tracing traitors. IEEE Transactions on Information Theory\u00a049(5), 1312\u20131318 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"8_CR12","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. Inform. Theory\u00a047(3), 1042\u20131049 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1137\/S0895480102400424","volume":"17","author":"V.D. T\u00f4","year":"2004","unstructured":"T\u00f4, V.D., Safavi-Naini, R.: On the maximal codes of length 3 with the 2-identifiable parent property. SIAM J. Discrete Math.\u00a017(4), 548\u2013570 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10623-005-6402-5","volume":"35","author":"T. Trung van","year":"2005","unstructured":"van Trung, T., Martirosyan, S.: New constructions for ipp codes. Des. Codes Cryptography\u00a035(2), 227\u2013239 (2005)","journal-title":"Des. Codes Cryptography"}],"container-title":["IFIP Advances in Information and Communication Technology","Emerging Challenges for Security, Privacy and Trust"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01244-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T04:21:07Z","timestamp":1633494067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01244-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642012433","9783642012440"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01244-0_8","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2009]]}}}