An efficient public key traitor tracing scheme

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1666, Issue , 1999, Pages 338-353

  Boneh, Dan ^a   Franklin, Matthew ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BROADCAST CHANNELS; CHOSEN CIPHERTEXT ATTACK; DIGITAL CONTENTS; ERROR CORRECTING CODE; LEGITIMATE USERS; PUBLIC-KEY ENCRYPTION SCHEME; PUBLIC-KEY TRAITOR TRACING; TRACING ALGORITHM;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84957085257     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48405-1_22     Document Type: Conference Paper

References (16)

1. M. Bellare, O. Goldreich, and S. Goldwasser, “Incremental cryptography: The case of hashing and signing”, in proc. Crypto '94, 216-233.
2. L. Welch and E. Berlekamp, "Error correction of algebraic block codes", U.S. Patent No. 4,633,470, issued December 1986.
3. D. Boneh, “The decision DiÆe-Hellman problem”, In proc. of the Third Algorithmic Number Theory Symposium (ANTS), LNCS, Vol. 1423, Springer-Verlag, pp. 48-63, 1998.
4. B. Chor, A. Fiat and M. Naor, “Tracing traitors”, in proc. Crypto '94, pp. 257-270.
5. R. Cramer and V. Shoup, “A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack”, in proc. Crypto '98, pp. 13-25.
6. C. Dwork, J. Lotspiech and M. Naor, “Digital signets: self-enforcing protection of digital information”, in proc. of STOC '96, pp. 489-498, 1996.
7. V. Guruswami and M. Sudan, “Improved decoding of Reed-Solomon and algebraic-geometric codes” in proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS), 1998.
8. K. Kurosawa, and Y. Desmedt, “Optimum traitor tracing and asymmetric schemes”, in proc. of Eurocrypt '98, pp. 145-157.
9. A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
10. M. Naor and B. Pinkas, “Threshold traitor tracing”, in proc. Crypto '98, pp. 502-517.
11. T. Okamoto, S. Uchiyama, “A new public key cryptosystem as secure as factoring”, in proc. Eurocrypt '98, pp. 308-318.
12. V. Pan, “Faster solution of the key equation for decoding BCH error-correcting codes” in proc. 29th ACM Symposium on Theory of Computation, pp. 168-175, 1997.
13. P. Paillier, “Public-Key Cryptosystems Based on Discrete Logarithm Residues”, in proc. Eurocrypt '99, pp. 223-238.
14. B. Ptzmann, “Trials of traced traitors”, in proc. Information Hiding Workshop, 49-64, 1996.
15. B. Ptzmann and M. Waidner, “Asymmetric ngerprinting for larger collusions”, in proc. ACM Conference on Computer and Communication Security, 151-160, 1997.
16. D. Stinson and R. Wei, “Combinatorial properties and constructions of traceability schemes and frameproof codes”, SIAM Journal on Discrete Math, 11(1), 41-53, 1998.