{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:23:30Z","timestamp":1781195010802,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540663478","type":"print"},{"value":"9783540484059","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48405-1_22","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:24:36Z","timestamp":1178015076000},"page":"338-353","source":"Crossref","is-referenced-by-count":171,"title":["An Efficient Public Key Traitor Tracing Scheme"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew","family":"Franklin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[1999,12,16]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare, O. Goldreich, and S. Goldwasser, \u201cIncremental cryptography: The case of hashing and signing\u201d, in proc. Crypto\u2019 94, 216\u2013233.","DOI":"10.1007\/3-540-48658-5_22"},{"key":"22_CR2","unstructured":"L. Welch and E. Berlekamp, \u201cError correction of algebraic block codes\u201d, U.S. Patent No. 4,633,470, issued December 1986."},{"key":"22_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"proc. of the Third Algorithmic Number Theory Symposium (ANTS)","author":"D. Boneh","year":"1998","unstructured":"D. Boneh, \u201cThe decision Diffe-Hellman problem\u201d, In proc. of the Third Algorithmic Number Theory Symposium (ANTS), LNCS, Vol. 1423, Springer-Verlag, pp. 48\u201363, 1998."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"B. Chor, A. Fiat and M. Naor, \u201cTracing traitors\u201d, in proc. Crypto\u2019 94, pp. 257\u2013270.","DOI":"10.1007\/3-540-48658-5_25"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup, \u201cA practical public key cryptosystem provably secure against adaptive chosen ciphertext attack\u201d, in proc. Crypto\u2019 98, pp. 13\u201325.","DOI":"10.1007\/BFb0055717"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"C. Dwork, J. Lotspiech and M. Naor, \u201cDigital signets: self-enforcing protection of digital information\u201d, in proc. of STOC\u2019 96, pp. 489\u2013498, 1996.","DOI":"10.1145\/237814.237997"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"V. Guruswami and M. Sudan, \u201cImproved decoding of Reed-Solomon and algebraic-geometric codes\u201d in proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS), 1998.","DOI":"10.1109\/SFCS.1998.743426"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"K. Kurosawa, and Y. Desmedt, \u201cOptimum traitor tracing and asymmetric schemes\u201d, in proc. of Eurocrypt\u2019 98, pp. 145\u2013157.","DOI":"10.1007\/BFb0054123"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.","DOI":"10.1201\/9781439821916"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"M. Naor and B. Pinkas, \u201cThreshold traitor tracing\u201d, in proc. Crypto\u2019 98, pp. 502\u2013517.","DOI":"10.1007\/BFb0055750"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"T. Okamoto, S. Uchiyama, \u201cA new public key cryptosystem as secure as factoring\u201d, in proc. Eurocrypt\u2019 98, pp. 308\u2013318.","DOI":"10.1007\/BFb0054135"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"V. Pan, \u201cFaster solution of the key equation for decoding BCH error-correcting codes\u201d in proc. 29th ACM Symposium on Theory of Computation, pp. 168\u2013175, 1997.","DOI":"10.1145\/258533.258577"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"P. Paillier, \u201cPublic-Key Cryptosystems Based on Discrete Logarithm Residues\u201d, in proc. Eurocrypt\u2019 99, pp. 223\u2013238.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann, \u201cTrials of traced traitors\u201d, in proc. Information Hiding Workshop, 49\u201364, 1996.","DOI":"10.1007\/3-540-61996-8_31"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann and M. Waidner, \u201cAsymmetric fingerprinting for larger collusions\u201d, in proc. ACM Conference on Computer and Communication Security, 151\u2013160, 1997.","DOI":"10.1145\/266420.266453"},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D. Stinson","year":"1998","unstructured":"D. Stinson and R. Wei, \u201cCombinatorial properties and constructions of traceability schemes and frameproof codes\u201d, SIAM Journal on Discrete Math, 11(1), 41\u201353, 1998.","journal-title":"SIAM Journal on Discrete Math"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48405-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:35:37Z","timestamp":1556382937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48405-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663478","9783540484059"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48405-1_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}