首页 | 本学科首页   官方微博 | 高级检索  
     


An improvement of discrete Tardos fingerprinting codes
Authors:Koji Nuida  Satoshi Fujitsu  Manabu Hagiwara  Takashi Kitagawa  Hajime Watanabe  Kazuto Ogawa  Hideki Imai
Affiliation:1.Research Center for Information Security (RCIS),National Institute of Advanced Industrial Science and Technology (AIST),Tokyo,Japan;2.Science and Technical Research Laboratories,Japan Broadcasting Corporation (NHK),Tokyo,Japan;3.Center for Research and Development Initiative,Chuo University,Tokyo,Japan;4.Faculty of Science and Engineering,Chuo University,Tokyo,Japan
Abstract:It has been proven that the code lengths of Tardos’s collusion-secure fingerprinting codes are of theoretically minimal order with respect to the number of adversarial users (pirates). However, the code lengths can be further reduced as some preceding studies have revealed. In this article we improve a recent discrete variant of Tardos’s codes, and give a security proof of our codes under an assumption weaker than the original Marking Assumption. Our analysis shows that our codes have significantly shorter lengths than Tardos’s codes. For example, when c = 8, our code length is about 4.94% of Tardos’s code in a practical setting and about 4.62% in a certain limit case. Our code lengths for large c are asymptotically about 5.35% of Tardos’s codes. A part of this work was presented at 17th Applied Algebra, Algebraic Algorithms, and Error Correcting Codes (AAECC-17), Bangalore, India, December 16–20, 2007.
Keywords:Fingerprinting codes  Collusion-secure codes  C-secure codes  Tardos codes  Traitor tracing schemes
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号