[1] R J Anderson,F A P Petitcolas. On the limits of steganography. IEEE Journal on Selected Areas in Communications, Special Issue on Copyright Privacy Protection, 1998, 16(4): 474-481[2] B Chor, A Fiat, MNaor. Tracing traitors. In: Yvo Desmedt. Advances in Cryptology-Crypto ’94. Lecture Notes in Computer Science 839. Springer-Verlag, 1994. 257-270[3] B Pfitzmann. Trials of traced traitors. In: RossJ Anderson. Proc. of Information Hiding’96. Lecture Notes in Computer Science 1174. Springer-Verlag, 1996. 49-64[4] K Kurosawa,YDesmedt. Optimum traitor tracing and asymmetric schemes. In: KNyberg. EUROCRYPT 1998. Lecture Notes in Computer Science 1403. Springer-Verlag,1998. 145-157[5] M Naor,B Pinkas. Threshold traitor tracing. In: Hugo Krawczyk. Advances in Cryptology-Crypto’98. Lecture Notes in Computer Science 1462.Springer-Verlag, 1998.502-517[6] A Fiat,T Tassa. Dynamic traitor tracing. In: M Wiener. CRYPTO 1999. Lecture Notes in Computer Science 1666. Springer-Verlag, 1999.354-371[7] D Boneh, M Franklin. An efficient public key traitor tracing scheme. In: M Wiener. Advances in Cryptology-Crypto’99. Lecture Notes in Computer Science 1666. Springer-Verlag, 1999. 338-353[8] 刘振华, 尹萍. 信息隐藏技术及应用. 北京:科学出版社, 2002. 178-180[9] I Cox, J Kilian, TLeighton,TShamoon. Secure spread spectrumwatermarkingfor multimedia. IEEE Trans. on Image Processing, 1997, 6(12):1673-1687[10] D Boneh,J Shaw. Collusion-secure fingerprinting for digital data. In: Don Coppersmith. Advances in Cryptology-Proceedings of the Crypto’95.Lecture Notes in Computer Science 963. Springer-Verlag, 1995. 452-465[11] J Lofvenberg, J Wiberg. Random codes for digital fingerprinting. Technique Report LiTH-ISY-R-2059, Department of Electrical Engineering, Linkoping University. 2000. http://www.it.isy.liu. se/~jacob/texter/RandCodes/[12] H Hollmann, J Lint, J Linnartz,L Tolhuizen. On codes with the identifiable parent property. Journal of Combinatorial Theory, 1998,Series A 82:121-133.[13] J N Staddon, D R Stinson,R Wei. Combinatorial properties of frameproof and traceability codes.IEEE Trans. Inform. Theory, 2001, IT247:1042-1049[14] J Kilian, T Leighton, L R Matheson, et al. Resistance of digital watermarks to collusive attacks. Technical Report TR258598, Departement of Computer Science, Princeton. 1998. http://citeseer. nj. nec.com/kilian98resistance. html[15] F Ergün, J Kilian,R Kumar. A note on the limits of collusion-resistant watermarks. In: Jacques Stern. EUROCRYPT 1999. Lecture Notes in Computer Science 1592. Springer-Verlag, 1999. 140-149[16] F Zane. Efficient watermark detection and collusion security. In: Y Frankel. Proc. of the 4th International Conference on Financial Cryptography (FC2000). Lecture Notes in Computer Science 1962. Springer-Verlag, 2001. 21-32[17] B Pfitzmann, M Waidner. Asymmetric fingerprinting for larger collusions. IBM Research Report RZ 2857 (#90805), IBM Research Division,Zurich. 1996[18] B Pfitzmann, M Waidner. Anonymous fingerprinting. In: Walter Fumy. Advances in Cryptology2EUROCRYPT ’97. Lecture Notes in Computer Science 1233. Springer-Verlag, 1997. 88-102[19] B Pfitzmann,M Waidner. Asymmetric fingerprinting for larger collusions. In: TMatsumoto. Proceedings of the 4th ACM Conference on Computer and Communications Security. New York: ACM Press, 1997. 151-160[20] J Guth,B Pfitzmann. Error-and collusion-secure fingerprinting for digital data. In: Andreas Pfitzmann. Information Hiding (IH ’99). Lecture Notes in Computer Science 1768. Springer-Verlag, 2000. 134-145[21] R Safavi-Naini,YWang. Collusion secure q-ary fingerprintingfor perceptual content. In: T Sander. Security and Privacy in Digital Rights, ACM CCS28 Workshop DRM 2001. Lecture Notes in Computer Science 2320. Springer-Verlag, 2002. 57-75[22] TLindkvist. Fingerprinting of digital documents. Dissertation No 706. Linkoping: Linkoping University, 2001. http://www.it.isy.liu. se/publikationer/indexeng. html # doktor[23] Y Yacobi. Improved boneh-shaw content fingerprinting. In: D Naccache. Proc. of the Cryptographer’s Track at RSA Conference 2001 (CT2RSA 2001). Lecture Notes in Computer Science 2020. Springer-Verlag, 2001. 378-391[24] H Muratani. A collusion-secure fingerprinting code reduced by Chinese Remaindering and its random-error resilience. In: Ira S. Moskowitz. Information Hiding 2001,4th International Workshop. Lecture Notes in Computer Science 2137. Springer-Verlag, 2001. 303-315[25] R Parviainen, P Parnes. Large scale distributed watermarkingof multicast media through encryption. In: R Steinmetz, J Dittmann, M Steinebach. Proceedings of the IFIP TC6/TC11 International Conference on Communications and Multimedia Security Issues. Kluwer Academic Publishers,2001. 149-158[26] TLindkvist. Characteristicsof some binary codesfor fingerprinting. Information Security. In: J Pieprzyk, EOkamoto,J Seberry. Third International Workshop Proceedings, ISW2000. Lecture Notes in Computer Science 1975. Springer-Verlag, 2000. 97-107[27] J Domingo-Ferrer,J Herrera-Joancomartí. A simple collusion-secure fingerprinting schemesfor images. In: Latifi S. Proceedingsof the International Symposium on Information Technology: Coding and Computing (ITCC 2000). Los Alamitos: IEEE Computer Society Press, 2000. 128-132[28] J Dittmann, A Behr,M Stabenau, et al. Combining digital watermarks and collusion-secure fingerprints for digital images. In: P W Wong,E J Delp. Security and Watermarking of Multimedia Contents. SPIE Proceedings Vol. 3657. Washington: SPIE(The International Society for Optical Engineering), 1999.171-182[29] W Trappe, M Wu, KJ RLiu. Collusion-resistant fingerprintingfor multimedia. In: IEEE Signal Processing Society. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing (ICASSP’02). IEEE,2002,4:3309-3312[30] A Barg, GCohen,S Encheva,et al. A hypergraph approach to the identifying parent property: The case of multiple parents. SIAM J. Discrete Math., 2001,14(3): 423-431[31] B Pfitzmann,M Schunter. Asymmetric fingerprinting. In: Ueli M Maurer. Advances in Cryptology-EUROCRYPT’96. Lecture Notes in Computer Science 1070. Springer-Verlag, 1996. 84-95[32] J Domingo-Ferrer. Anonymous fingerprinting basedon committedoblivious transfer. In: Hideki Imai, Yuliang Zheng. Public Key Cryptography’99.Lecture Notes in Computer Science 1560. Springer-Verlag, 1999. 43-52[33] N Memon,P W Wong. A buyer-seller watermarking protocol. In: A Alwan, C CJ Kuo,SL MNikias, et al. IEEE Signal Processing Society 1998 Workshop on Multimedia Signal Processing. IEEE, 1998. 291-296[34] P Tomsich, S Katzenbeisser. Copyright protection protocolsfor multimedia distribution basedon trusted hardware. In: P Pacyna, Z Papir. Proceedings of Protocols for Multimedia Systems (PROMS 2000). IEEE, 2000. 249-256[35] F Bao. Multimedia content protection by cryptography and watermarking in tamper-resistant hardware. ACM Multimedia 2000 Electronic Proceedings. http://www.acm.org/sigmm/mm2000/ep/bao/index. html[36] A R Sadeghi. How to break a semi-anonymous fingerprinting scheme. In: Ira S Moskowitz. Proc.of Information Hiding 2001. Lecture Notes in Computer Science 2137. Springer-Verlag,2001. 384-394[37] B Pfitzmann,A R Sadeghi. Coin-based anonymous fingerprinting. In: Jacques Stern. Advances in Cryptology-EUROCRYPT’99. Lecture Notes in Computer Science 1592. Springer-Verlag, 1999.150-164[38] J Camenisch. Efficient anonymous fingerprinting with group signatures. In: TOkamoto. Advances in Cryptology-Asiacrypt 2000. Lecture Notes in Computer Science 1976. Springer-Verlag, 2000. 415-428[39] J Domingo-Ferrer. Anonymous fingerprintingof electronic information with automatic identification of redistributors.IEE Electronics Letters, 1998,34(13) : 1303-1304[40] J Domingo2Ferrer, J Herrera-Joancomartí. Efficient smart-card based anonymous fingerprinting. In: Jean-Jacques Quisquater,Bruce Schneier.Smart Card Research and Advanced Application-CARDIS’98. Lecture Notes in Computer Science 1820. Springer-Verlag,1998. 221-228[41] C Chung, S Choi, YChoi,et al. Efficient anonymous fingerprinting of electronic information with improved automatic identification of redistributors. In: Dongho Won. Information Security and Cryptology-ICISC 2000. Lecture Notes in Computer Science 2015. Springer-Verlag,2001. 221-234[42] M Kim,J Kim,K Kim. Anonymousfingerprinting as secure as the bilinear diffie-hellman assumption. In: Robert HDeng, Sihan Qing, FengBao,et al. Proc. of Information and Communications Security, 4th International Conference, ICICS 2002. Lecture Notes in Computer Science 2513.Springer-Verlag, 2002. 97-108[43] J GChoi, J H Park,KSakurai. An efficient anonymous fingerprinting scheme with proxy signatures. In: Proc. of the Symposiumon Cryptography and Information Security(SCIS2003). 2003. 1151-1156. http://shannon.pknu.ac. kr/~jae/[44] B Pfitzmann,A-R Sadeghi. Anonymousfingerprinting with direct non-repudiation. In: TOkamoto. ASIACRYPT2000. Lecture Notes in Computer Science 1976. Springer-Verlag, 2000. 401-414[45] M Kuribayashi,H Tanaka. A new anonymousfingerprinting scheme with high enciphering rate. In: C P Rangan, C Ding. Proc. of the Progress in Cryptology,Second Int. Conf., INDOCRYPTO2001. Lecture Notes in Computer Science 2247. Springer-Verlag, 2001. 30-39[46] T O kamoto,S Uchiyama. An efficient public2key cryptosystem. In: KNyberg. Advances in Cryptology-Eurocrypt 98. Lecture Notes in Computer Science 1403. Springer2Verlag, 1998. 308-318[47] R Safavi-Naini,YWang. Anonymous traceability schemes with unconditional security. In: B K Roy, E Okamoto. Progress in Cryptology-INDO-CRYPT 2000.Lecture Notes in Computer Science 1977. Springer2Verlag, 2000. 250-261 |