Efficient asymmetric public-key traitor tracing without trusted agents

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

Volumn 2020, Issue , 2001, Pages 392-407

  Watanabe, Yuji ^a   Hanaoka, Goichiro ^a   Imai, Hideki ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BLACK-BOX TRACEABILITYS; DESIRABLE FEATURES; EFFICIENT CONSTRUCTION; OBLIVIOUS POLYNOMIAL EVALUATION; PUBLIC-KEY TRACING; PUBLIC-KEY TRAITOR TRACING; THIRD TRUSTED PARTIES; TRUSTED THIRD PARTIES;

CRYPTOGRAPHY;

EID: 84937577268     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45353-9_29     Document Type: Conference Paper

References (24)

1. K. Kurosawa and Y. Desmedt. Optimum traitor tracing and asymmetric scheme. In Proc. of EUROCRYPT '98, pages 145-157, 1998.
2. B. Chor, A. Fiat, and M. Naor. Tracing traitors. In Proc. of CRYPTO'94, pages 257-270, 1994.
3. D. Boneh and M. Franklin. An efficient public key traitor tracing scheme. In Proc. of CRYPTO'99, pages 338-353, 1999.
4. M. Yoshida and T. Fujiwara. A subscriber unauthorizable and traitor traceable broadcast distribution system. In Proc. of SCIS'2000, page C10, 2000.
5. B Pfitzmann. Trials of traced traitors. In Proc. of Information Hiding'96, pages 49-64, 1996.
6. B. Pfitzmann and M. Waidner. Asymmetric fingerprinting for larger collusions. In Proc. of ACMCCS'97, pages 145-157, 1997.
7. D. Stinson and R. Wei. Key predistribution traceability schemes for broadcast encryption. In Proc. of SAC'98, pages 144-156, 1999.
8. J. Anzai, N. Matsuzaki, and T. Matsumoto. A quick group key distribution scheme with entity revocation. In Proc. of ASIACRYPT'99, pages 333-347, 1999.
9. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In Proc. Of STOC'99, pages 245-254, 1999.
10. D. Bleichenbacher and P. Q. Nguyen. Noisy polynomial interpolation and noisy chinese remaindering. In Proc. of EUROCRYPT'2000, pages 53-69, 2000.
11. D. Chaum and H. van Antwerpen. Undeniable signatures. In Proc. of CRYPTO'89, pages 212-216, 1989.
12. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Proc. of CRYPTO'86, pages 186-194, 1986.
13. C. P. Schnorr. Efficient identification and signatures for smart cards. In Proc. Of EUROCRYPT'89, pages 688-689, 1989.
14. Y. Desmedt and Y. Frankel. Threshold cryptosystem. In Proc. of CRYPTO'89, pages 307-315, 1990.
15. Y. Desmedt. Threshold cryptosystem. European Transactions on Telecommunica-tions, 5(4):449-457, 1994.
16. T. Matsushita and H. Imai. Black-box traitor tracing against arbitrary pirate decoders. In Proc. of WISA'00, to appear, 2000.
17. T. Yoshida and K. Kurosawa. Is Boneh and Franklin traceability scheme traceable? the rump session of CRYPTO'2000 (available from http://www-cse. ucsd. edu/users/mihir/crypto2k/rump/yk2. ps), 2000.
18. M. Yoshida and T. Fujiwara. An efficient traitor tracing scheme for broadcast encryption. In Proc. of IEEE ISIT'2000, page 463, 2000.
19. D. Boneh. The decision Diffe-Hellman problem. In Proc. of the 3th ANTS, pages 48-63, 1998.
20. M. Naor and B. Pinkas. Threshold traitor tracing. In Proc. of CRYPTO'98, pages 502-517, 1998.
21. S. Brands. Untraceable off-line cash in wallets with observers. In Proc. Of CRYPTO'93, pages 302-318, 1993.
22. A. Shamir. How to share a secret. Comm. of ACM, 22:612-613, 1979.
23. Y. Frankel and M. Yung. Distributed public key cryptography. In Proc. of PKC'98, pages 1-13, 1998.
24. H. Komaki, Y. Watanabe, G. Hanaoka, and H. Imai. Efficient asymmetric self-enforcement scheme with public traceability. In Proc. of PKC'01, to appear, 2001.