{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:50Z","timestamp":1750307270289,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1982185.1982513","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T12:59:14Z","timestamp":1305637154000},"page":"1544-1549","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient traitor tracing for clone attack in content protection"],"prefix":"10.1145","author":[{"given":"Hongxia","family":"Jin","sequence":"first","affiliation":[{"name":"IBM Research Center Almaden, San Jose, CA"}]},{"given":"Jeffrey","family":"Lotspiech","sequence":"additional","affiliation":[{"name":"Lotspiech.com, Henderson, NV"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"http:\/\/www.aacsla.com\/specifications Pre-recorded Video Book.  http:\/\/www.aacsla.com\/specifications Pre-recorded Video Book."},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in computer science","first-page":"480","volume-title":"Broadcast Encryption,\" Crypto'93","author":"Fiat A.","year":"1993","unstructured":"A. Fiat and M. Naor , \" Broadcast Encryption,\" Crypto'93 , Lecture Notes in computer science , Vol. 773 , pp 480 -- 491 . Springer-Verlag , Berlin, Heidelberg , New York, 1993 . A. Fiat and M. Naor, \"Broadcast Encryption,\" Crypto'93, Lecture Notes in computer science, Vol. 773, pp 480--491. Springer-Verlag, Berlin, Heidelberg, New York, 1993."},{"key":"e_1_3_2_1_3_1","first-page":"41","volume-title":"Crypto","author":"Naor D.","year":"2001","unstructured":"D. Naor , M. Naor and J. Lotspiech , \" Revocation and Tracing Schemes for Stateless Receivers \", Crypto 2001 , Lecture Notes in computer science, Vol. 2139 , pp 41 -- 62 , 2001. D. Naor, M. Naor and J. Lotspiech, \"Revocation and Tracing Schemes for Stateless Receivers\", Crypto 2001, Lecture Notes in computer science, Vol. 2139, pp 41--62, 2001."},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Financial Cryptography'2000","author":"Naor M.","unstructured":"M. Naor and B. Pinkas , \" Efficient Trace and Revoke Schemes \", Financial Cryptography'2000 , Lecture Notes in Computer Science , Vol. 1962 , pp. 1 -- 20 . M. Naor and B. Pinkas, \"Efficient Trace and Revoke Schemes\", Financial Cryptography'2000, Lecture Notes in Computer Science, Vol. 1962, pp. 1--20."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_34"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455834"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_32"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810629"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.915661"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029146.1029160"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2393847.2393897"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2009.23"},{"key":"e_1_3_2_1_13_1","unstructured":"http:\/\/forum.slysoft.com  http:\/\/forum.slysoft.com"},{"key":"e_1_3_2_1_14_1","unstructured":"http:\/\/cryptography.com\/technology\/spdc\/index.html  http:\/\/cryptography.com\/technology\/spdc\/index.html"}],"event":{"name":"SAC'11: The 2011 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"TaiChung Taiwan","acronym":"SAC'11"},"container-title":["Proceedings of the 2011 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982513","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1982185.1982513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:56Z","timestamp":1750243976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1982185.1982513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":14,"alternative-id":["10.1145\/1982185.1982513","10.1145\/1982185"],"URL":"https:\/\/doi.org\/10.1145\/1982185.1982513","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}