Abstract
This paper introduces a method for tracking different copies of functionally equivalent algorithms containing identification marks known to the attacker. Unlike all previous solutions, the new technique does not rely on any marking assumption and leads to a situation where each copy is either traceable or so severely damaged that it becomes impossible to store in polynomial space or run in polynomial time.
Although RSA-related, the construction is particularly applicable to confidential block-ciphers such as SkipJack, RC4, GOST 2814789, GSM A5, COMP128, TIA CAVE or other proprietary executables distributed to potentially distrusted users.
This is a preview of subscription content, log in via an institution to check access.
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
J.-M. Acken, How watermarking adds value to digital content, Communications of the ACM, vol. 41-7, pp. 75–77, 1998.
P. Bas, J.-M. Chassery and F. Davoine, Self-similarity based image watermarking, Proceedings of eusipco’98, Ninth European signal processing conference, European association for signal processing, pp. 2277–2280.
The huge costs of software piracy, Computer Fraud and Security Bulletin, 09/1997, Elsevier Science, page 3.
D. Boneh and J. Shaw, Collusion-secure fingerprinting for digital data, Advances in cryptology crypto’95, Springer-Verlag, Lectures notes in computer science 963, pp. 452–465, 1995.
B. Chor, A. Fiat and M. Naor, Tracing traitors, Advances in cryptology crypto’94, Springer-Verlag, Lectures notes in computer science 839, pp. 257–270, 1994.
G. Miller, Riemann’s hypothesis and tests for primality, Journal of computer and system sciences, vol. 13, pp. 300–317, 1976.
D. Naccache and J. Stern, A new public-key cryptosystem,Advances in cryptology eurocrypt’97, Springer-Verlag, Lectures notes in computer science 1233, pp. 27–36, 1997.
M. Naor and B. Pinkas, Theshold Traitor Tracing, Advances in cryptology crypto’98, Springer-Verlag, Lectures notes in computer science 1462, pp. 502–517, 1998.
V. Ostrovsky, The other side of deception, Harper-Collins Publishers, New-York, page 38, 1995.
B. Pfitzmann and M. Schunter, Asymmetric fingerprinting, Advances in cryptology eurocrypt’96, Springer-Verlag, Lectures notes in computer science 1070, pp. 84–95, 1996.
B. Pfitzmann and M. Waidner, Anonymous fingerprinting, Advances in cryptology eurocrypt’97, Springer-Verlag, Lectures notes in computer science 1233, pp. 88–102, 1997.
R. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol. 21-2, pp. 120–126, 1978.
J. Rompel, One way functions are necessary and sufficient for secure digital signatures, Proceedings of the 22-nd Annual ACM Symposium on the Theory of Computing, pp. 387–394, 1990.
K. Verco and M. Wise, Plagiarism à la mode: a comparison of automated systems for detecting suspected plagiarism, The Computer Journal, vol. 39-9, pp. 741–750, 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naccache, D., Shamir, A., Stern, J.P. (1999). How to Copyright a Function?. In: Public Key Cryptography. PKC 1999. Lecture Notes in Computer Science, vol 1560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49162-7_14
Download citation
DOI: https://doi.org/10.1007/3-540-49162-7_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65644-9
Online ISBN: 978-3-540-49162-0
eBook Packages: Springer Book Archive