Abstract
The proposed scheme by Domingo in Electronic Letters presented the first anonymous fingerprinting scheme in which help of a registration center is not required in order to identify redistributors. However, registration protocol of this scheme is 4-pass and identification process also required many exponential operations. In this paper, we propose more efficient protocol than the scheme by Domingo, which require 2-pass in registration protocol and need only 3+1 times exponential operation in identification process. In the electronic commerce of digits contents, registration protocol is more efficient than the previous scheme introduced. Moreover, computational complexity is diminished since identification process requires only 3+1 times exponential operation as the previous one requires 3+N/2 exponential operations. We now show efficient anonymous fingerprinting of electronic information with improved automatic identification of redistributors.
This paper is supported by Korea Science and Engineering Foundation(KOSEF) grant 97-01-00-13-01-5.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Reference
Josep Domingo-Ferrer, “Anonymous Fingerprinting of Electronic Information with Automatic Identification of Redistributors”, Electronics Letters 34/13, 1998, pp.1303–1304.
Blankey, G.R., C. Meadows, and G.B. Purdy, “Fingerprinting Long Forgiving Messages”, in Advances in Cryptology, Proceedings of CRYPTO’ 85, vol. 218 of Lecture Notes in Computer Science, Springer-Verlag, 1986, pp.180–189.
Boneh, D., and J. Shaw, “Collusion-secure Fingerprinting for Digital Data”, in Advances in Cryptology, Proceedings of CRYPTO’ 95, vol.963 of Lecture Notes in Computer Science, Springer-Verlag, 1995, pp.452–465.
Low, S. H., and N. F. Maxemchuk, “Modeling Cryptographic Protocols and their Collusion Analysis”, in Information Hiding: First International Workshop. Proceedings, vol. 1174 of Lecture Notes in Computer Science, Springer-Verlag, 1996, pp.169–184.
Pfitzmann, B., and Waidner, M., Asymmetric Fingerprinting for Larger Collutions” 4th ACM Conference on Computer and Communications Security, acm press, 1997, pp. 151–160.
Biehl, I. and Meyer, B., “Protocol for Collusion-Secure Asymmetric Fingerprinting”, STACS 97, vol. 1200 of Lecture Notes in Computer Science, Springer-Verlag, 1997, pp.399–412.
Chor, B., A. Fiat, and M. Naor, “Tracing Traitors”, in Advances in Cryptology, Proceedings of CRYPTO’ 94, vol.839 of Lecture Notes in Computer Science, Springer-Verlag, 1994, pp.257–270.
Naor, M., and Pinkas, B., “Threshold Traitor Tracing”, in Advances in Cryptology, Proceedings of CRYPTO’ 98, vol. 1462 of Lecture Notes in Computer Science, Springer-Verlag, 1998, pp.502–517.
Boneh, D., and Franklin, M., “An Efficient Public Key Traitor Tracing Scheme”, in Advances in Cryptology, Proceedings of CRYPTO’ 99, vol. 1666 of Lecture Notes in Computer Science, Springer-Verlag, 1999, pp338–353.
Fiat, A., and Tassa, T., “Dynamic Traitor Tracing”, in Advances in Cryptology. Proceedings of CRYPTO’ 99, vol. 1666 of Lecture Notes in Computer Science, Springer-Verlag, 1999.pp354–371
Pfitzmann, B., and M. Schunter, “Asymmetric Fingerprinting”, in Advances in Cryptology, Proceedings of EUROCRYPT’ 96, vol. 1070of Lecture Notes in Computer Science. Springer-Verlag, 1996, pp.84–95.
Pfitzmann, B., “Trials of Traced Traitors”, in Information Hiding: First International Workshop, Proceedings, vol. 1174 of Lecture Notes in Computer Science, Springer-Verlag, 1996, pp.49–64.
Pfitzmann, B., and M. Waidner, “Anonymous Fingerprinting”, in Advances in Cryptology, Proceedings of EUROCRYPT’ 97, vol. 1233 of Lecture Notes in Computer Science, Springer-Verlag, 1997, pp.88–102.
Pfitzmann, B., and A. Sadeghi, “Coin-Based Anonymous Fingerprinting” in Advances in Cryptology, Proceedings of EUROCRYPT’ 99, vol. 1592 of Lecture Notes in Computer Science, Springer-Verlag, 1999, pp.150–164.
ElGamal, T., “A public-key cryptosystem and signature scheme based on discrete logarithms”, IEEE trans. Inf. Theory, 1985, IT-31, pp.469–472.
Chaum, D., Evertse, J.-H., and Van De Graaf, J., “An improved protocol for demonstrating possessions of discrete logarithms and some generalizations”, in Advances in Cryptology, Proceedings of EUROCRYPT’ 87, vol. 304 of Lecture Notes in Computer Science, Springer-Verlag, 1987, pp.127–141.
Chaum, D., Damgaard, I.B., and Van De Graaf, J., “Multiparty computation ensuring privacy of each party’s input and correctness of the result”, in Advances in Cryptology, Proceedings of EUROCRYPT’ 87, vol. 293 of Lecture Notes in Computer Science, Springer-Verlag, 1987, pp.87–119.
Katzenbeisser, S., Petitcolas, F. A. P, “Information Hiding Techniques for Steganography and Digital Watermarking”, Artech House, 2000.
Peticolas, F.A.P., R. J. Anderson, and M. G. Kuhn, “Information Hiding-A Survey”, Proceedings of the IEEE, vol. 87, no. 7, 1999 pp.1062–1078.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chung, C., Choi, S., Choi, Y., Won, D. (2001). Efficient anonymous fingerprinting of electronic information with improved automation with improved automatic identification of redistributors. In: Won, D. (eds) Information Security and Cryptology — ICISC 2000. ICISC 2000. Lecture Notes in Computer Science, vol 2015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45247-8_18
Download citation
DOI: https://doi.org/10.1007/3-540-45247-8_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41782-8
Online ISBN: 978-3-540-45247-8
eBook Packages: Springer Book Archive