{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:16Z","timestamp":1725516256386},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850922"},{"type":"electronic","value":"9783540850939"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-85093-9_10","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T06:24:37Z","timestamp":1218522277000},"page":"100-106","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bounds for Set Systems with the Identifiable Parent Property"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Collins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1017\/S0963548304006388","volume":"13","author":"N. Alon","year":"2004","unstructured":"Alon, N., Stav, U.: New bounds on parent-identifying codes: The case of multiple parents. Comb. Probab. Comput.\u00a013(6), 795\u2013807 (2004)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0097-3165(03)00030-X","volume":"102","author":"S.R. Blackburn","year":"2003","unstructured":"Blackburn, S.R.: An upper bound on the size of a code with the k-identifiable parent property. J. Comb. Theory, Ser. A\u00a0102(1), 179\u2013185 (2003)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"3","key":"10_CR3","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 Transactions on Information Theory\u00a046(3), 893\u2013910 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"Z. F\u00fcredi","year":"1985","unstructured":"F\u00fcredi, Z., Erd\u0151s, P., Frankl, P.: Families of finite sets in which no set is covered by the union of r others. Israel J. Math.\u00a051(1), 79\u201389 (1985)","journal-title":"Israel J. Math."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D.R. Stinson","year":"1998","unstructured":"Stinson, D.R., Wei, R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discr. Math.\u00a011, 41\u201353 (1998)","journal-title":"SIAM J. Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85093-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:28:43Z","timestamp":1558265323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85093-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540850922","9783540850939"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85093-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}