{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T07:34:20Z","timestamp":1765438460118,"version":"3.37.3"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,11,18]],"date-time":"2016-11-18T00:00:00Z","timestamp":1479427200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,11,18]],"date-time":"2016-11-18T00:00:00Z","timestamp":1479427200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP150100285","DP110100628"],"award-info":[{"award-number":["DP150100285","DP110100628"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["NRF-CRP2-2007-03"],"award-info":[{"award-number":["NRF-CRP2-2007-03"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE2013-T2-1-041"],"award-info":[{"award-number":["MOE2013-T2-1-041"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-2013-StG-335086-LATTAC"],"award-info":[{"award-number":["ERC-2013-StG-335086-LATTAC"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-09-VERSO-016 BEST","ANR-12-JS02-0004"],"award-info":[{"award-number":["ANR-09-VERSO-016 BEST","ANR-12-JS02-0004"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"French Ministry of Research and Higher Education","award":["LaBaCry MERLION"],"award-info":[{"award-number":["LaBaCry MERLION"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00453-016-0251-7","type":"journal-article","created":{"date-parts":[[2016,11,18]],"date-time":"2016-11-18T13:44:27Z","timestamp":1479476667000},"page":"1318-1352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Hardness of k-LWE and Applications in Traitor Tracing"],"prefix":"10.1007","volume":"79","author":[{"given":"San","family":"Ling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duong Hieu","family":"Phan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Stehl\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,18]]},"reference":[{"key":"251_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Dent, A.W., Malone-Lee, J., Neven, G., Phan, D.H., Smart, N.P.: Identity-based traitor tracing. In: Proceedings of PKC, volume 4450 of LNCS, pp. 361\u2013376. Springer (2007)","DOI":"10.1007\/978-3-540-71677-8_24"},{"key":"251_CR2","first-page":"1","volume":"7","author":"D Aggarwal","year":"2016","unstructured":"Aggarwal, D., Regev, O.: A note on discrete gaussian combinations of lattice vectors. Chic. J. Theor. Comput. Sci. 7, 1\u201311 (2016)","journal-title":"Chic. J. Theor. Comput. Sci."},{"key":"251_CR3","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In Proc. of EUROCRYPT, volume 6110 of LNCS, pp. 553\u2013572. Springer (2010). Full version available at \n                    http:\/\/crypto.stanford.edu\/~dabo\/pubs\/papers\/latticebb.pdf"},{"key":"251_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Proceedings of CRYPTO, volume 6223 of LNCS, pp. 98\u2013115. Springer (2010)","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"251_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Gentry, C., Halevi, S., Sahai, A.: Sampling discrete gaussians efficiently and obliviously. In: Proceedings of ASIACRYPT (1), volume 8269 of LNCS, pp. 97\u2013116. Springer (2013)","DOI":"10.1007\/978-3-642-42033-7_6"},{"key":"251_CR6","unstructured":"Agrawal, S., Libert, B., Stehl\u00e9, D.: Fully secure functional encryption for inner products, from standard assumptions. In: Proceedings of CRYPTO, volume 9816 of LNCS, pp. 333\u2013362. Springer (2016). Full version available at \n                    http:\/\/eprint.iacr.org\/2015\/608"},{"key":"251_CR7","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of STOC, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"key":"251_CR8","doi-asserted-by":"crossref","unstructured":"Ajtai, M.:.Generating hard instances of the short basis problem. In: Proceedings of ICALP, volume 1644 of LNCS, pp. 1\u20139. Springer (1999)","DOI":"10.1007\/3-540-48523-6_1"},{"issue":"3","key":"251_CR9","first-page":"535","volume":"48","author":"J Alwen","year":"2011","unstructured":"Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. Theor. Comput. Sci. 48(3), 535\u2013553 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"251_CR10","unstructured":"Bai, S., Langlois, A., Lepoint, T., Stehl\u00e9, D., Steinfeld, R.: Improved security proofs in lattice-based cryptography: using the R\u00e9nyi divergence rather than the statistical distance. In: Proceedings of ASIACRYPT, volume 9452 of LNCS, pp. 3\u201324. Springer (2015). Full version available at \n                    http:\/\/eprint.iacr.org\/2015\/483"},{"key":"251_CR11","doi-asserted-by":"crossref","unstructured":"Billet, O., Phan, D.H.: Efficient traitor tracing from collusion secure codes. In: Proc. of ICITS, volume 5155 of LNCS, pp. 171\u2013182. Springer (2008)","DOI":"10.1007\/978-3-540-85093-9_17"},{"key":"251_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.K.: An efficient public key traitor tracing scheme. In: Proceedings of CRYPTO, volume 1666 of LNCS, pp. 338\u2013353. Springer (1999)","DOI":"10.1007\/3-540-48405-1_22"},{"key":"251_CR13","unstructured":"Boneh, D., Freeman, D.M.: Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In: Proceedings of PKC, volume 6571 of LNCS, pp. 1\u201316. Springer (2011). Full version available at \n                    http:\/\/eprint.iacr.org\/2010\/453.pdf"},{"key":"251_CR14","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Traitor tracing with constant size ciphertext. In: Proceedings of ACM CCS, pp. 501\u2013510. ACM (2008)","DOI":"10.1145\/1455770.1455834"},{"key":"251_CR15","doi-asserted-by":"crossref","unstructured":"Boneh, D., Sahai, A., Waters, B.: Fully collusion resistant traitor tracing with short ciphertexts and private keys. In: Proceedings of EUROCRYPT, volume 4004 of LNCS, pp. 573\u2013592. Springer (2006)","DOI":"10.1007\/11761679_34"},{"key":"251_CR16","doi-asserted-by":"crossref","unstructured":"Boneh, D., Waters, B.: A fully collusion resistant broadcast, trace, and revoke system. In: Proceedings of ACM CCS, pp. 211\u2013220. ACM (2006)","DOI":"10.1145\/1180405.1180432"},{"key":"251_CR17","doi-asserted-by":"crossref","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Proceedings of CRYPTO, volume 8616 of LNCS, pp. 480\u2013499. Springer (2014)","DOI":"10.1007\/978-3-662-44371-2_27"},{"key":"251_CR18","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: STOC, pp. 575\u2013584. ACM (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"251_CR19","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Proceedings of EUROCRYPT, volume 6110 of LNCS, pp. 523\u2013552. Springer (2010)","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"251_CR20","doi-asserted-by":"crossref","unstructured":"Chabanne, H., Phan, D.H., Pointcheval, D.: Public traceability in traitor tracing schemes. In: Cramer, R. (ed.) EUROCRYPT 2005, volume 3494 of LNCS , pp. 542\u2013558. Springer (2005)","DOI":"10.1007\/11426639_32"},{"key":"251_CR21","doi-asserted-by":"crossref","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Proceedings of CRYPTO, volume 839 of LNCS, pp. 257\u2013270. Springer (1994)","DOI":"10.1007\/3-540-48658-5_25"},{"issue":"3","key":"251_CR22","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. Inf. Theory 46(3), 893\u2013910 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"251_CR23","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002, volume 2332 of LNCS, pp. 45\u201364. Springer (2002)","DOI":"10.1007\/3-540-46035-7_4"},{"key":"251_CR24","doi-asserted-by":"crossref","unstructured":"Fazio, N., Nicolosi, A., Phan, D.H.: Traitor tracing with optimal transmission rate. In: Proceedings of ISC, volume 4779 of LNCS, pp. 71\u201388. Springer (2007)","DOI":"10.1007\/978-3-540-75496-1_5"},{"key":"251_CR25","doi-asserted-by":"crossref","unstructured":"Fiat, A., Naor, M.: Broadcast encryption. In Stinson, D.R. (ed.) CRYPTO\u201993, volume 773 of LNCS, pp. 480\u2013491. Springer (1994)","DOI":"10.1007\/3-540-48329-2_40"},{"key":"251_CR26","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: Proceedings of FOCS, pp. 40\u201349. IEEE Computer Society Press (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"251_CR27","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedins of STOC, pp. 197\u2013206. ACM (2008). Full version available at \n                    http:\/\/eprint.iacr.org\/2007\/432.pdf"},{"key":"251_CR28","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Katz, J., Vaikuntanathan, V.: A group signature scheme from lattice assumptions. In: Proceedins of ASIACRYPT, volume 2647 of LNCS, pp. 395\u2013412. Springer (2010)","DOI":"10.1007\/978-3-642-17373-8_23"},{"key":"251_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0044-9","volume-title":"Encryption For Digital Content","author":"A Kiayias","year":"2010","unstructured":"Kiayias, A., Pehlivanglu, S.: Encryption For Digital Content. Springer, Berlin (2010)"},{"key":"251_CR30","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Yung, M.: On crafty pirates and foxy tracers. In: Proceedins of DRM Workshop, volume 2320 of LNCS, pp. 22\u201339. Springer (2001)","DOI":"10.1007\/3-540-47870-1_3"},{"key":"251_CR31","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Yung, M.: Self protecting pirates and black-box traitor tracing. In Proceedins of CRYPTO, volume 2139 of LNCS, pp. 63\u201379. Springer (2001)","DOI":"10.1007\/3-540-44647-8_4"},{"key":"251_CR32","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Yung, M.: Breaking and repairing asymmetric public-key traitor tracing. In: Digital Rights Management Workshop, pp. 32\u201350 (2002)","DOI":"10.1007\/978-3-540-44993-5_3"},{"key":"251_CR33","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Yung, M.: Traitor tracing with constant transmission rate. In Knudsen, L.R. (ed.) EUROCRYPT\u00a02002, volume 2332 of LNCS, pp. 450\u2013465. Springer (2002)","DOI":"10.1007\/3-540-46035-7_30"},{"key":"251_CR34","unstructured":"Klein, P.N.: Finding the closest lattice vector when it\u2019s unusually close. In: Proceedins of SODA, pp. 937\u2013941. ACM (2000)"},{"key":"251_CR35","doi-asserted-by":"crossref","unstructured":"Komaki, H., Watanabe, Y., Hanaoka, G., Imai, H.: Efficient asymmetric self-enforcement scheme with public traceability. In: Kim, K. (ed.) PKC 2001, volume 1992 of LNCS, pp. 225\u2013239. Springer (2001)","DOI":"10.1007\/3-540-44586-2_17"},{"key":"251_CR36","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Desmedt, Y.: Optimum traitor tracing and asymmetric schemes. In: Proceedings of EUROCRYPT, LNCS, pp. 145\u2013157. Springer (1998)","DOI":"10.1007\/BFb0054123"},{"key":"251_CR37","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Yoshida, T.: Linear code implies public-key traitor tracing. In: Naccache, D., Paillier, P. (eds.) PKC 2002, volume 2274 of LNCS, pp. 172\u2013187. Springer (2002)","DOI":"10.1007\/3-540-45664-3_12"},{"key":"251_CR38","doi-asserted-by":"crossref","unstructured":"Langlois, A., Stehl\u00e9, D., and Steinfeld, R. GGHLite: More efficient multilinear maps from ideal lattices. In: Proceedings of EUROCRYPT, LNCS, pp. 239\u2013256. Springer (2014)","DOI":"10.1007\/978-3-642-55220-5_14"},{"key":"251_CR39","doi-asserted-by":"crossref","unstructured":"Ling, S., Phan, D.H., Stehl\u00e9, D., Steinfeld, R.: Hardness of k-LWE and applications in traitor tracing. In: Proceedings of CRYPTO, volume 8616 of LNCS, pp. 315\u2013334. Springer (2014)","DOI":"10.1007\/978-3-662-44371-2_18"},{"issue":"6","key":"251_CR40","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM 60(6), 43 (2013)","journal-title":"J. ACM"},{"key":"251_CR41","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: Simpler, tighter, faster, smaller. In: Proceedings of EUROCRYPT, volume 7237 of LNCS, pp. 700\u2013718. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_41"},{"issue":"1","key":"251_CR42","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"251_CR43","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Berlin (2009)"},{"key":"251_CR44","doi-asserted-by":"crossref","unstructured":"Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001, volume 2139 of LNCS, pp. 41\u201362. Springer (2001)","DOI":"10.1007\/3-540-44647-8_3"},{"key":"251_CR45","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Efficient trace and revoke schemes. In: Frankel, Y. (ed.) FC 2000, volume 1962 of LNCS, pp. 1\u201320. Springer (2000)","DOI":"10.1007\/3-540-45472-1_1"},{"key":"251_CR46","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Efficient trace and revoke schemes. In: Proceedings of Financial Cryptography, volume 1962 of LNCS, pp. 1\u201320. Springer (2000)","DOI":"10.1007\/3-540-45472-1_1"},{"key":"251_CR47","doi-asserted-by":"crossref","unstructured":"O\u2019Neill, A., Peikert, C., Waters, B.: Bi-deniable public-key encryption. In: Proceedings of CRYPTO, volume 6841 of LNCS, pp. 525\u2013542. Springer (2011)","DOI":"10.1007\/978-3-642-22792-9_30"},{"issue":"17","key":"251_CR48","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/s00037-008-0251-3","volume":"2","author":"C Peikert","year":"2008","unstructured":"Peikert, C.: Limits on the hardness of lattice problems in $$\\ell _p$$ norms. Comput. Complex. 2(17), 300\u2013351 (2008)","journal-title":"Comput. Complex."},{"key":"251_CR49","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: Proceedings of STOC, pp. 333\u2013342. ACM (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"251_CR50","doi-asserted-by":"crossref","unstructured":"Peikert, C.: An efficient and parallel Gaussian sampler for lattices. In: Proceedings of CRYPTO, volume 6223 of LNCS, pp. 80\u201397. Springer (2010)","DOI":"10.1007\/978-3-642-14623-7_5"},{"key":"251_CR51","unstructured":"Peikert, C., Shelat, A., Smith, A.: Lower bounds for collusion-secure fingerprinting. In: Proceedings of SODA, pp. 472\u2013479 (2003)"},{"key":"251_CR52","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Proceedings of STOC, pp. 187\u2013196. ACM (2008)","DOI":"10.1145\/1374376.1374406"},{"key":"251_CR53","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B.: Trials of traced traitors. In: Information Hiding, volume 1174 of LNCS, pp. 49\u201364. Springer (1996)","DOI":"10.1007\/3-540-61996-8_31"},{"key":"251_CR54","doi-asserted-by":"crossref","unstructured":"Pfitzmann , B., Waidner, M.: Asymmetric fingerprinting for larger collusions. In: ACM CCS 97, pp. 151\u2013160. ACM Press (1997)","DOI":"10.1145\/266420.266453"},{"key":"251_CR55","doi-asserted-by":"crossref","unstructured":"Phan, D.H., Safavi-Naini, R., Tonien, D.: Generic construction of hybrid public key traitor tracing with full-public-traceability. In: Proceedings of ICALP (2), volume 4052 of LNCS, pp. 264\u2013275. Springer (2006)","DOI":"10.1007\/11787006_23"},{"key":"251_CR56","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of STOC, pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"6","key":"251_CR57","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34 (2009)","journal-title":"J. ACM"},{"key":"251_CR58","doi-asserted-by":"crossref","unstructured":"Regev, O.: The learning with errors problem, 2010. Invited survey in CCC 2010. Available at \n                    http:\/\/www.cims.nyu.edu\/~regev\/","DOI":"10.1109\/CCC.2010.26"},{"key":"251_CR59","doi-asserted-by":"crossref","unstructured":"Silverberg, A., Staddon, J., Walker, J.L.: Efficient traitor tracing algorithms using list decoding. In: Proceedings of ASIACRYPT, volume 2248 of LNCS, pp. 175\u2013192. Springer (2001)","DOI":"10.1007\/3-540-45682-1_11"},{"key":"251_CR60","unstructured":"Sirvent, T.: Traitor tracing scheme with constant ciphertext rate against powerful pirates. In: Augot, D., Sendrier, N., and Tillich, J.P. (eds.) Workshop on Coding and Cryptography\u2014WCC \u201907, pp. 379\u2013388 (2007)"},{"issue":"1","key":"251_CR61","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"DR Stinson","year":"1998","unstructured":"Stinson, D.R., Wei, R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discret. Math. 11(1), 41\u201353 (1998)","journal-title":"SIAM J. Discret. Math."},{"key":"251_CR62","doi-asserted-by":"crossref","unstructured":"Stinson, D.R., Wei, R.: Key preassigned traceability schemes for broadcast encryption. In: Proceedings of SAC, volume 1556 of LNCS, pp. 144\u2013156. Springer (1998)","DOI":"10.1007\/3-540-48892-8_12"},{"issue":"2","key":"251_CR63","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1346330.1346335","volume":"55","author":"G Tardos","year":"2008","unstructured":"Tardos, G.: Optimal probabilistic fingerprint codes. J. ACM 55(2), 10 (2008)","journal-title":"J. ACM"},{"key":"251_CR64","doi-asserted-by":"crossref","unstructured":"Watanabe, Y., Hanaoka, G., Imai, H.: Efficient asymmetric public-key traitor tracing without trusted agents. In: Naccache, D. (ed.) CT-RSA 2001, volume 2020 of LNCS, pp. 392\u2013407. Springer (2001)","DOI":"10.1007\/3-540-45353-9_29"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0251-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0251-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0251-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:22:55Z","timestamp":1589696575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0251-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,18]]},"references-count":64,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["251"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0251-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2016,11,18]]},"assertion":[{"value":"1 July 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}