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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Anderson, F. A. P. Petitcolas: On The Limits of Steganography IEEE Journal of Selected Areas in Communications, 16(4), 474–481, 1998
D. Boneh, M. Franklin: An Efficient Public Key Traitor Tracing Scheme, Proceedings of Crypto’ 99, Springer-Verlag, pp. 338–353, 1999
Boneh, J. Shaw: Collusion-Secure Fingerprinting for Digital Data, IEEE Trans. Inform. Theory, vol IT-44, pp. 1897–1905, 1998
Chor, A. Fiat, M. Naor: Tracing Traitors, Proceedings of Crypto’ 94, Springer-Verlag, pp. 257–270, 1994
H. D. L. Hollman, J. H. van Lint, J. P. Linnartz, L. M. G. M. Tolhui-zen: On Codes with the Identifiable Parent Property, Journal of Combinatorial Theory, pp. 121–133, Series 82, 1998
S. Katzenbeisser, F. A. P. Petitcolas (ed.): Information Hiding Techniques for Steganography and Digital Watermarking, Artech House, 2000
Kiayias, M. Yung: Cryptographic Hardness based on the Decoding of Reed-Solomon Codes with Applications ECCC Technical Report TR02-017, 2002
Kiayias, M. Yung: Cryptographic Hardness based on the Decoding of Reed-Solomon Codes, Proceedings of ICALP 2002, Springer-Verlag, pp 232–243
Löfvenberg, T. Lindkvist: A General Description of Pirate Strategies in a Binary Fingerprinting System, 2000, http://www.it.isy.liu.se/publikationer/LiTH-ISY-R-2259.pdf
P. Sarkar, D. R. Stinson: Frameproof and IPP Codes, Indocrypt’01, Springer-Verlag, pp.117–126, 2001
R. Stinson, R. Wei: Combinatorial properties and constructions of traceability schemes and frameproof codes, SIAM Journal of Discrete Mathematics 11, pp. 41–53, 1998
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Veerubhotla, R.S., Saxena, A., Gulati, V.P. (2002). Reed Solomon Codes for Digital Fingerprinting. In: Menezes, A., Sarkar, P. (eds) Progress in Cryptology — INDOCRYPT 2002. INDOCRYPT 2002. Lecture Notes in Computer Science, vol 2551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36231-2_14
Download citation
DOI: https://doi.org/10.1007/3-540-36231-2_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00263-5
Online ISBN: 978-3-540-36231-9
eBook Packages: Springer Book Archive