信息隐藏与数字指纹技术的研究
|
摘要
数字产品的版权保护问题越来越受到人们的重视，而密码技术是解决这一问题的重要手段之一，本文中重点研究如何将现代密码学技术应用到数字产品的版权保护中，即数字指纹技术，以保证数字产品的出版发行能够按正常商业形式运作。研究成果如下：
( 系统地介绍了信息隐藏与数字指纹的由来、研究进展和现状，概述了信息隐藏技术的应用与分类，阐述了密码学、信息隐藏与数字指纹间的关系。
( 简要地介绍数字指纹概念及指纹的例子，解释了一些常用的相关术语，对现有的研究成果进行了全面总结，分析、讨论了各类数字指纹技术的优缺点。
( 针对现有的匿名指纹方案进行分析与总结，设计了两种匿名指纹方案。
( 分析了现有的追踪方案的各方面性能，设计了两种非对称的公钥叛逆者追踪方案。
Copyright protection is taken into account by more and more people and cryptography is one of the important solutions to this problem. This dissertation focuses on how to apply the modern cryptography to the copyright protection of digital content, namely the digital fingerprinting technology, in order that the issue of digital content is run by natural commercial format. Following are the main result of this thesis:
( Introduce the origin, evolvement and states of information hiding and digital fingerprinting technology, summarize the application and class of information hiding, expatiate the relation of the cryptography and information hiding and digital fingerprinting technology.
( Introduce the conception and examples of the digital fingerprinting simply, explain the terms in common use, summarize the results of the research, analyze and discuss the strongpoint and shortcoming of all kinds of fingerprinting scheme.
( Analyze and summarize the existing anonymous fingerprinting scheme, design two anonymous fingerprinting scheme.
( Analyze the performance of the existing traitors tracing scheme, design two asymmetric public-key traitors tracing scheme.
( 系统地介绍了信息隐藏与数字指纹的由来、研究进展和现状，概述了信息隐藏技术的应用与分类，阐述了密码学、信息隐藏与数字指纹间的关系。
( 简要地介绍数字指纹概念及指纹的例子，解释了一些常用的相关术语，对现有的研究成果进行了全面总结，分析、讨论了各类数字指纹技术的优缺点。
( 针对现有的匿名指纹方案进行分析与总结，设计了两种匿名指纹方案。
( 分析了现有的追踪方案的各方面性能，设计了两种非对称的公钥叛逆者追踪方案。
Copyright protection is taken into account by more and more people and cryptography is one of the important solutions to this problem. This dissertation focuses on how to apply the modern cryptography to the copyright protection of digital content, namely the digital fingerprinting technology, in order that the issue of digital content is run by natural commercial format. Following are the main result of this thesis:
( Introduce the origin, evolvement and states of information hiding and digital fingerprinting technology, summarize the application and class of information hiding, expatiate the relation of the cryptography and information hiding and digital fingerprinting technology.
( Introduce the conception and examples of the digital fingerprinting simply, explain the terms in common use, summarize the results of the research, analyze and discuss the strongpoint and shortcoming of all kinds of fingerprinting scheme.
( Analyze and summarize the existing anonymous fingerprinting scheme, design two anonymous fingerprinting scheme.
( Analyze the performance of the existing traitors tracing scheme, design two asymmetric public-key traitors tracing scheme.
引文
[1] Fabien A.P. Petitcolas, Ross J. Anderson, Markus G. Kuhn, "Information hiding-survey", Proceedings of the IEEE, Vol. 87, No.7, pp: 1062-1078, July 1999.
[2] J. Reeds, "Solved: the ciphers in book III of trithemius' steganographia", Cryptologia, Vol. XXII, No.4, pp. 291-317,Oct. 1998.
[3] Ross Anderson, "?nformation"hiding", LNCS, Vol. 1174,Soringer, 1996.
[4] B. Chor, A. Fiat and M. Naor, "Tracing Traitors", Advances in Cryptology-CRYPTO'94, LNCS, 839, Berlin Springer-Verlag, pp. 257-270, 1994.
[5] Butler Lampson. "A note on the confinement problem", CACM, 16(10): 613-615, October 1973.
[6] Richard A. Kemmerer. "Shared resource matrix methodology: a practical approach to identifying convert channels", Acm Transanctions on Computer Systems, 1(3): 256-257, August 1983.
[7] Norman E. Proctor and Peter G. Neumann. "Architectural implications of convert channels ", In Proceedings of the 15th National Computer Security Conference, 236-243. NIST/NCSC, Baltimore, MD, 1992.
[8] G. J. Simmons, "Subliminal communication is possible using the DSA", In Proceedings of Eurocrypt'93, Springer-Verlag, 1993.
[9] Ira S. Moskowitz and Myong H. Kang, "Covert channels-here to say?" in Proceedings of COMPASS 94, 235-243, NJ, 1994, IEEE Press.
[10] Myong H. Kang, Ira S. Moskowitz and Daniel C. Lee. "A network pump", IEEE Transactions on software Engineering, 329-338, May 1996.
[11] David Kahn. "the history of steganography", LNCS Vol.1174 IBSN 3-540-61996-8, 1-6, Springer-Verlag.
[12] Ross Anderson. "Stretching the limits of steganography", LNCS. Vol.1174, IBSN 3-540-61996-8, 1-6, Springer-Verlag.
[13] 王育民、刘建伟， 《通信网的安全—理论与技术》，西安电子科技大学出
版社，1999。
[14] Ingemar J. Cox, Jean-Paul M.G. "some general methods for tempering with watermarks", Journal on Selected Areas in Communications. Vol. 16, No.4, May 1998, pp. 587-593.
[15] R.B. Wolfgang and E. J. Delp. "A watermark for digital images", In Proc. IEEE int. Conference on Image Processing, Vol. 3, pp.219-222, 1996
[16] M. M. Yeung and F. Mintzar, "An invisible watermarking technique for image verification"In Proc. IEEE Int. conference on Image Processing, Vol. 2, pp. 680-683, 1997.
[17] I. J. Cox and M L. Miller, "A review of watermarking and the importance of perceptual modeling", Vol. 3016, San Josc, California, USA, Feb.1997, The society for imaging science and technology (IS&T) and the international society for optical engineering (SPIE), SPIE, ISBN 0-8194-2427-7.
[18] Zeng W and B. Liu, "On resolving rightful owner-ships of digital images bu invisible watermarks", Proceedings og ICIP'97, Vol. 1, pp. 552-555, 1997.
[19] Cambridge University Library, Title Fingerprint Search: Cambridge List of Serials, Cambridge, England, 1998.
[20] Kahn D. The Codebreakers — The story of secret writing, New York, USA: Scribner, 1996.
[21] Postel, J. "Out-of-Net Host Addresses for Mail", IETF RFC 754, The internet engineering task force, Apr. 1979.
[22] Zimmermann, P.R. The official PGP user's guide, Cambridge, Massachusetts, USA: MIT Press, 1995.
[23] Schneier B. Applied cryptography, New York, USA: John Wiley&sons, 2nd, 1996.
[24] Comp. security. pgp The comp. security. PGP FAQ, OCT. 1998.
[25] Anderson R. J. The Global Internet Trust Register 1999, Cambridge, Massachusetts, USA: MIT Press, 1999.
[26] Blakey G. R., C. Meadows and G. B. Purdy, "Fingerprinting long forgiving
messages", in Advances in Cryptology-CRYPTO'85, LNCS, Berlin, Springer-Verlag, pp. 180-189, 1986.
[27] Bonech D. and J. Shaw, "Collusion - secure fingerprinting for digital data", in Advances in Cryptology-CRYPTO'95, LNCS, Berlin, Springer-Verlag, pp. 452-465, 1995.
[28] Low S. H. and N. F. Maxemchuk, "Modeling cryptographic protocols and their collusion analysis", In information hiding: First International Workshop, Proceedings, Vol. 1174 of LNCS, Springer-Verlag, pp. 169-184, 1996.
[29] B. Pfitzmann and M. Waidner. "Asymmetric Fingerprinting for Large Collusions", In Proc. of ACMCCS'97, Zurich, pp.145-157, 1997.
[30] B. Pfitzmann and M. Waidner. "Anonymous fingerprinting", in Advances in Cryptology-EUROCRYPTO'97, LNCS, Berlin, Springer-Verlag, pp. 88-102, 1997.
[31] B. Chor, A. Fiat and M. Naor, Tracing traitors, in Advances in Cryptology-CRYPTO'94, LNCS, Berlin, Springer-Verlag, pp. 257-270, 1994.
[32] D. Stinson and R. Wei. Combinational properties and constructions of traceability schemes and frame-proof codes. In SIAM J. on Discrete Math., vol.11, no.1,pp 41-53, 1998.
[33] Chuam D. L. "Blind signatures for untraceable payments", in Advances in Cryptology-CRYPTO'82, LNCS, Berlin, Springer-Verlag, pp.199-203, 1983.
[34] Brassard G., D. L. Chaum and C. Crepeau, "Mininum disclosure proofs of knowledge", Journal of Computer and System Sciences, Vol.37, No. 2, Oct. 1998, pp. 156-189.
[35] Naor M., "Bit commitment using pseudo - randomness", in Advances in Cryptology-CRYPTO'89, LNCS, Berlin, Springer-Verlag, pp.128 - 136. 1990.
[36] J. Domingo-Ferrer，"Anonymous Fingerprinting of Electronic Information with Automatic Identification of Redistributors". Electronics Letters 43/13, 1998, pp 1303-1304.
[37] Chanjoo Chung. Seungbok Choi, Youngchul Choi, dongho Won. "Efficient
Anonymous Fingerprinting of Electronic Information with Improved Automatic Identification of Redistributors". In PKC2000, Canberra, pp. 221-234.
[38] Chaum D., Damgaard. I. B., and Van De Graaf. J. "Multiparty Computation Ensuring Privacy of Each Party's Input and Correctness of the Result". Advances in Cryptology, Proceedings of CRYPTO '87, vol. 293 of Lecture Notes in Computer Science, Springer-Verlag, Berlin 1987, pp. 87-119.
[39] Hirotaha Komaki, Yuji Watanabe, Goichiro Hanaoka and Hideki Imai, "Efficient asymmetric self-enforcement scheme with public traceability", PKC2001, LNCS, pp. 225 - 239. 2001.
[40] M. Yohida and T. Fujiwara. "A Subscriber Unauthorizable and Traitor Traceable Broadcast Distribution System", In Proc of SCIS'2000, Okinawa, Japan, C10, 2000.
[41] K Kurosawa and Y. Desmedt. "Optimum Traitor Tracing and Asymmetric Scheme", In Proc. of EUROCRYPT'98, Berlin Springer-Verlag, pp. 145-157, 1998.
[42] M. Abdalla, Y. Shavitt, A. Wool, "Towards Making Broadcast Encryption Practical", FC'99, Berlin Springer-Verlag, pp. 140-157, 1999.
[43] D. Boneh and M. Franklin, "An Efficient Public Key Traitor Tracing Scheme", In Proc of CRYPTO'99, Berlin Springer-Verlag, pp. 338-353, 1999.
[44] B. Pfitzmann. "Trail of Traced Traitor", In Proc. Of Information Hiding'96, Berlin Springer-Verlag, pp.49-64. 1996.
[45] C. Dwork, J. Lotspiech and M. Naor, "Digital Signets: Self-Enforcing Protection of Digital information" , Proc. of 28th ACM Symposium on Theory of Computing (STOC), pp. 489-498,1996.
[46] M. Naor and B. Pinkas. "Oblivious Transfer and Polynomial Evaluation" , In Proc. of STOC'99, pp. 245-254, 1999.
[47] D. Bleichenbacher and P. Q. Nguyen. "Noisy Polynomial Interpolation and Noisy Chinese Remaindering" , In Proc. of CRYPTO'2000, pp. 53-69,2000.
[48] Diffile W. and Hellman M. E., "New directions in Cryptography", IEEE Trans. On Information Theory, Nov 1976, pp. 644-654.
[49] T. ElGamal, "A Public Key Cryptosystem and Signature Scheme Based On Discrete Logarithms", In Proc. of CRYPTO'84, pp. 10-18, 1985.
[50] M. Naor and O. Reingold, "Number-Theoretic Constructions of Efficient Pseudo-random Function", Proc. 38th IEEE Symp. On Foundations of Computer Science,
1997, pp. 458-467.
[51] D. Beoneh, "The Decision Diffie-Hellman Problem", in Proceedings of the third Algorithmic Number Theory Symposium, LNCS Vol. 1423, Springer-Verlag, pp. 48-63, 1998.
[52] M. Abdalla, Y. Shavitt, A.Wool, "Key Management for Restricted Multicast Using Broadcast Encryption", Proceedings of Financial Cryptology 99, LNCS Vol. 1648, Springer-Verlag, 1999.
[53] E. Gafni, J. Staddon, Y. L.Yin, Effiient methods for integrating trace-ability and broadcast encryption, Proceeding of Advances in Cryptology - Crypto'99, LNCS 1666, Springer-Verlag, pp. 372-387
[54] Bauer F. L. "Decrypted Secrets ? Methods and Maxims of Cryptology", Berlin, Heidelberg, Germany, Springer-Verlag, 1997.
[55] Schilling D. " Meter Burst Communications: Theory and Practice, Wiley Series in Telecommunications", New York, J.Wiley and Sons, 1993.
[56] Mulhall T. "Where have all the hackers gone? a study in motivation, deterrence and crime displacement", Computers and Secutiry, Vol.16, no.4, 1997, pp. 277-315.
[57] Wangner N. R., "Fingerprinting" , in Proceeding of the 1983 IEEE Symposium on Security and Privacy, Oakland, California, USA, Apr. 1983, pp. 18-12.
[58] 杜江，“信息隐藏与数字水印技术研究”，博士论文，西安电子科技大学，2001。
[2] J. Reeds, "Solved: the ciphers in book III of trithemius' steganographia", Cryptologia, Vol. XXII, No.4, pp. 291-317,Oct. 1998.
[3] Ross Anderson, "?nformation"hiding", LNCS, Vol. 1174,Soringer, 1996.
[4] B. Chor, A. Fiat and M. Naor, "Tracing Traitors", Advances in Cryptology-CRYPTO'94, LNCS, 839, Berlin Springer-Verlag, pp. 257-270, 1994.
[5] Butler Lampson. "A note on the confinement problem", CACM, 16(10): 613-615, October 1973.
[6] Richard A. Kemmerer. "Shared resource matrix methodology: a practical approach to identifying convert channels", Acm Transanctions on Computer Systems, 1(3): 256-257, August 1983.
[7] Norman E. Proctor and Peter G. Neumann. "Architectural implications of convert channels ", In Proceedings of the 15th National Computer Security Conference, 236-243. NIST/NCSC, Baltimore, MD, 1992.
[8] G. J. Simmons, "Subliminal communication is possible using the DSA", In Proceedings of Eurocrypt'93, Springer-Verlag, 1993.
[9] Ira S. Moskowitz and Myong H. Kang, "Covert channels-here to say?" in Proceedings of COMPASS 94, 235-243, NJ, 1994, IEEE Press.
[10] Myong H. Kang, Ira S. Moskowitz and Daniel C. Lee. "A network pump", IEEE Transactions on software Engineering, 329-338, May 1996.
[11] David Kahn. "the history of steganography", LNCS Vol.1174 IBSN 3-540-61996-8, 1-6, Springer-Verlag.
[12] Ross Anderson. "Stretching the limits of steganography", LNCS. Vol.1174, IBSN 3-540-61996-8, 1-6, Springer-Verlag.
[13] 王育民、刘建伟， 《通信网的安全—理论与技术》，西安电子科技大学出
版社，1999。
[14] Ingemar J. Cox, Jean-Paul M.G. "some general methods for tempering with watermarks", Journal on Selected Areas in Communications. Vol. 16, No.4, May 1998, pp. 587-593.
[15] R.B. Wolfgang and E. J. Delp. "A watermark for digital images", In Proc. IEEE int. Conference on Image Processing, Vol. 3, pp.219-222, 1996
[16] M. M. Yeung and F. Mintzar, "An invisible watermarking technique for image verification"In Proc. IEEE Int. conference on Image Processing, Vol. 2, pp. 680-683, 1997.
[17] I. J. Cox and M L. Miller, "A review of watermarking and the importance of perceptual modeling", Vol. 3016, San Josc, California, USA, Feb.1997, The society for imaging science and technology (IS&T) and the international society for optical engineering (SPIE), SPIE, ISBN 0-8194-2427-7.
[18] Zeng W and B. Liu, "On resolving rightful owner-ships of digital images bu invisible watermarks", Proceedings og ICIP'97, Vol. 1, pp. 552-555, 1997.
[19] Cambridge University Library, Title Fingerprint Search: Cambridge List of Serials, Cambridge, England, 1998.
[20] Kahn D. The Codebreakers — The story of secret writing, New York, USA: Scribner, 1996.
[21] Postel, J. "Out-of-Net Host Addresses for Mail", IETF RFC 754, The internet engineering task force, Apr. 1979.
[22] Zimmermann, P.R. The official PGP user's guide, Cambridge, Massachusetts, USA: MIT Press, 1995.
[23] Schneier B. Applied cryptography, New York, USA: John Wiley&sons, 2nd, 1996.
[24] Comp. security. pgp The comp. security. PGP FAQ, OCT. 1998.
[25] Anderson R. J. The Global Internet Trust Register 1999, Cambridge, Massachusetts, USA: MIT Press, 1999.
[26] Blakey G. R., C. Meadows and G. B. Purdy, "Fingerprinting long forgiving
messages", in Advances in Cryptology-CRYPTO'85, LNCS, Berlin, Springer-Verlag, pp. 180-189, 1986.
[27] Bonech D. and J. Shaw, "Collusion - secure fingerprinting for digital data", in Advances in Cryptology-CRYPTO'95, LNCS, Berlin, Springer-Verlag, pp. 452-465, 1995.
[28] Low S. H. and N. F. Maxemchuk, "Modeling cryptographic protocols and their collusion analysis", In information hiding: First International Workshop, Proceedings, Vol. 1174 of LNCS, Springer-Verlag, pp. 169-184, 1996.
[29] B. Pfitzmann and M. Waidner. "Asymmetric Fingerprinting for Large Collusions", In Proc. of ACMCCS'97, Zurich, pp.145-157, 1997.
[30] B. Pfitzmann and M. Waidner. "Anonymous fingerprinting", in Advances in Cryptology-EUROCRYPTO'97, LNCS, Berlin, Springer-Verlag, pp. 88-102, 1997.
[31] B. Chor, A. Fiat and M. Naor, Tracing traitors, in Advances in Cryptology-CRYPTO'94, LNCS, Berlin, Springer-Verlag, pp. 257-270, 1994.
[32] D. Stinson and R. Wei. Combinational properties and constructions of traceability schemes and frame-proof codes. In SIAM J. on Discrete Math., vol.11, no.1,pp 41-53, 1998.
[33] Chuam D. L. "Blind signatures for untraceable payments", in Advances in Cryptology-CRYPTO'82, LNCS, Berlin, Springer-Verlag, pp.199-203, 1983.
[34] Brassard G., D. L. Chaum and C. Crepeau, "Mininum disclosure proofs of knowledge", Journal of Computer and System Sciences, Vol.37, No. 2, Oct. 1998, pp. 156-189.
[35] Naor M., "Bit commitment using pseudo - randomness", in Advances in Cryptology-CRYPTO'89, LNCS, Berlin, Springer-Verlag, pp.128 - 136. 1990.
[36] J. Domingo-Ferrer，"Anonymous Fingerprinting of Electronic Information with Automatic Identification of Redistributors". Electronics Letters 43/13, 1998, pp 1303-1304.
[37] Chanjoo Chung. Seungbok Choi, Youngchul Choi, dongho Won. "Efficient
Anonymous Fingerprinting of Electronic Information with Improved Automatic Identification of Redistributors". In PKC2000, Canberra, pp. 221-234.
[38] Chaum D., Damgaard. I. B., and Van De Graaf. J. "Multiparty Computation Ensuring Privacy of Each Party's Input and Correctness of the Result". Advances in Cryptology, Proceedings of CRYPTO '87, vol. 293 of Lecture Notes in Computer Science, Springer-Verlag, Berlin 1987, pp. 87-119.
[39] Hirotaha Komaki, Yuji Watanabe, Goichiro Hanaoka and Hideki Imai, "Efficient asymmetric self-enforcement scheme with public traceability", PKC2001, LNCS, pp. 225 - 239. 2001.
[40] M. Yohida and T. Fujiwara. "A Subscriber Unauthorizable and Traitor Traceable Broadcast Distribution System", In Proc of SCIS'2000, Okinawa, Japan, C10, 2000.
[41] K Kurosawa and Y. Desmedt. "Optimum Traitor Tracing and Asymmetric Scheme", In Proc. of EUROCRYPT'98, Berlin Springer-Verlag, pp. 145-157, 1998.
[42] M. Abdalla, Y. Shavitt, A. Wool, "Towards Making Broadcast Encryption Practical", FC'99, Berlin Springer-Verlag, pp. 140-157, 1999.
[43] D. Boneh and M. Franklin, "An Efficient Public Key Traitor Tracing Scheme", In Proc of CRYPTO'99, Berlin Springer-Verlag, pp. 338-353, 1999.
[44] B. Pfitzmann. "Trail of Traced Traitor", In Proc. Of Information Hiding'96, Berlin Springer-Verlag, pp.49-64. 1996.
[45] C. Dwork, J. Lotspiech and M. Naor, "Digital Signets: Self-Enforcing Protection of Digital information" , Proc. of 28th ACM Symposium on Theory of Computing (STOC), pp. 489-498,1996.
[46] M. Naor and B. Pinkas. "Oblivious Transfer and Polynomial Evaluation" , In Proc. of STOC'99, pp. 245-254, 1999.
[47] D. Bleichenbacher and P. Q. Nguyen. "Noisy Polynomial Interpolation and Noisy Chinese Remaindering" , In Proc. of CRYPTO'2000, pp. 53-69,2000.
[48] Diffile W. and Hellman M. E., "New directions in Cryptography", IEEE Trans. On Information Theory, Nov 1976, pp. 644-654.
[49] T. ElGamal, "A Public Key Cryptosystem and Signature Scheme Based On Discrete Logarithms", In Proc. of CRYPTO'84, pp. 10-18, 1985.
[50] M. Naor and O. Reingold, "Number-Theoretic Constructions of Efficient Pseudo-random Function", Proc. 38th IEEE Symp. On Foundations of Computer Science,
1997, pp. 458-467.
[51] D. Beoneh, "The Decision Diffie-Hellman Problem", in Proceedings of the third Algorithmic Number Theory Symposium, LNCS Vol. 1423, Springer-Verlag, pp. 48-63, 1998.
[52] M. Abdalla, Y. Shavitt, A.Wool, "Key Management for Restricted Multicast Using Broadcast Encryption", Proceedings of Financial Cryptology 99, LNCS Vol. 1648, Springer-Verlag, 1999.
[53] E. Gafni, J. Staddon, Y. L.Yin, Effiient methods for integrating trace-ability and broadcast encryption, Proceeding of Advances in Cryptology - Crypto'99, LNCS 1666, Springer-Verlag, pp. 372-387
[54] Bauer F. L. "Decrypted Secrets ? Methods and Maxims of Cryptology", Berlin, Heidelberg, Germany, Springer-Verlag, 1997.
[55] Schilling D. " Meter Burst Communications: Theory and Practice, Wiley Series in Telecommunications", New York, J.Wiley and Sons, 1993.
[56] Mulhall T. "Where have all the hackers gone? a study in motivation, deterrence and crime displacement", Computers and Secutiry, Vol.16, no.4, 1997, pp. 277-315.
[57] Wangner N. R., "Fingerprinting" , in Proceeding of the 1983 IEEE Symposium on Security and Privacy, Oakland, California, USA, Apr. 1983, pp. 18-12.
[58] 杜江，“信息隐藏与数字水印技术研究”，博士论文，西安电子科技大学，2001。