Reed Solomon Codes for Digital Fingerprinting

  • Authors:
  • Ravi Sankar Veerubhotla;Ashutosh Saxena;Ved Prakash Gulati

  • Affiliations:
  • -;-;-

  • Venue:
  • INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

Reed Solomon codes are being widely used for error-correcting methods and in construction of fault tolerant systems such as RAID. Recent studies [2], [7], [8] revealed that these codes have a potential application in cryptography. The hardness in decoding Reed Solomon codes can be exposed to construct new cryptographic applications. It is in this scenario that we talk about the suitability of Reed Solomon codes for Digital Fingerprinting in particular and cryptography in general. We derive results for bounds on Fingerprint length, design tracing method for Boneh's broadcast encryption system [2]; and discuss collusion attacks on fingerprint. Pirate strategies and performance issues are also presented.