Article

How to Copyright a Function?

Authors:

David Naccache,

Adi Shamir,

Julien P. SternAuthors Info & Claims

PKC '99: Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography

Pages 188 - 196

Published: 01 March 1999 Publication History

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 28147-89, GSM A5, COMP128, TIA CAVE or other proprietary executables distributed to potentially distrusted users.

References

[1]

J.-M. Acken, How watermarking adds value to digital content, Communications of the ACM, vol. 41-7, pp. 75-77, 1998.

Crossref

Google Scholar

[2]

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.

Google Scholar

[3]

The huge costs of software piracy, Computer Fraud and Security Bulletin, 09/1997, Elsevier Science, page 3.

Google Scholar

[4]

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.

Crossref

Google Scholar

[5]

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.

Crossref

Google Scholar

[6]

G. Miller, Riemann's hypothesis and tests for primality, Journal of computer and system sciences, vol. 13, pp. 300-317, 1976.

Crossref

Google Scholar

[7]

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.

Crossref

Google Scholar

[8]

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.

Crossref

Google Scholar

[9]

V. Ostrovsky, The other side of deception, Harper-Collins Publishers, New-York, page 38, 1995.

Google Scholar

[10]

B. Pfitzmann and M. Schunter, Asymmetric fingerprinting, Advances in cryptology eurocrypt'96, Springer-Verlag, Lectures notes in computer science 1070, pp. 84- 95, 1996.

Crossref

Google Scholar

[11]

B. Pfitzmann and M. Waidner, Anonymous fingerprinting, Advances in cryptology eurocrypt'97, Springer-Verlag, Lectures notes in computer science 1233, pp. 88- 102, 1997.

Crossref

Google Scholar

[12]

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.

Crossref

Google Scholar

[13]

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.

Crossref

Google Scholar

[14]

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.

Google Scholar

Cited By

View all

Cohen AHolmgren JNishimaki RVaikuntanathan VWichs DWichs DMansour Y(2016)Watermarking cryptographic capabilitiesProceedings of the forty-eighth annual ACM symposium on Theory of Computing10.1145/2897518.2897651(1115-1127)Online publication date: 19-Jun-2016
https://dl.acm.org/doi/10.1145/2897518.2897651
Kiayias ATang QSadeghi AGligor VYung M(2013)How to keep a secretProceedings of the 2013 ACM SIGSAC conference on Computer & communications security10.1145/2508859.2516691(943-954)Online publication date: 4-Nov-2013
https://dl.acm.org/doi/10.1145/2508859.2516691
Barak BGoldreich OImpagliazzo RRudich SSahai AVadhan SYang K(2012)On the (im)possibility of obfuscating programsJournal of the ACM (JACM)10.1145/2160158.216015959:2(1-48)Online publication date: 3-May-2012
https://dl.acm.org/doi/10.1145/2160158.2160159
Show More Cited By

Recommendations

Rebound attacks on the reduced grøstl hash function
CT-RSA'10: Proceedings of the 2010 international conference on Topics in Cryptology

Grøstl is one of 14 second round candidates of the NIST SHA-3 competition. Cryptanalytic results on the wide-pipe compression function of Grøstl-256 have already been published. However, little is known about the hash function, arguably a much more ...
Cryptanalysis of the Round-Reduced GOST Hash Function
Information Security and Cryptology
Abstract
The GOST hash function, defined in GOST R 34.11-2012, was selected as the new Russian standard on August 7, 2012. It is designed to replace the old Russian standard GOST R 34.11-94. The GOST hash function is an AES-based primitive and is ...
Distinguisher on full-round compression function of GOST R
Highlights
- Integral Property of the permutation in GOST R hash function.
- Distinguishing ...
Abstract
From January 2013, GOST R 34.11-2012 hash function has been the new Russian Federal standard hash function which replaced the old one GOST R 34.11-97. GOST R hash function can compress any message up to 2⁵¹² bits into 256 bits and 512 ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PKC '99: Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography

March 1999

326 pages

ISBN:3540656448

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 March 1999

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cohen AHolmgren JNishimaki RVaikuntanathan VWichs DWichs DMansour Y(2016)Watermarking cryptographic capabilitiesProceedings of the forty-eighth annual ACM symposium on Theory of Computing10.1145/2897518.2897651(1115-1127)Online publication date: 19-Jun-2016
https://dl.acm.org/doi/10.1145/2897518.2897651
Kiayias ATang QSadeghi AGligor VYung M(2013)How to keep a secretProceedings of the 2013 ACM SIGSAC conference on Computer & communications security10.1145/2508859.2516691(943-954)Online publication date: 4-Nov-2013
https://dl.acm.org/doi/10.1145/2508859.2516691
Barak BGoldreich OImpagliazzo RRudich SSahai AVadhan SYang K(2012)On the (im)possibility of obfuscating programsJournal of the ACM (JACM)10.1145/2160158.216015959:2(1-48)Online publication date: 3-May-2012
https://dl.acm.org/doi/10.1145/2160158.2160159
Phan DPointcheval DStrefler M(2012)Message-Based traitor tracing with optimal ciphertext rateProceedings of the 2nd international conference on Cryptology and Information Security in Latin America10.1007/978-3-642-33481-8_4(56-77)Online publication date: 7-Oct-2012
https://dl.acm.org/doi/10.1007/978-3-642-33481-8_4
Libert BVergnaud D(2009)Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private KeysProceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '0910.1007/978-3-642-00468-1_14(235-255)Online publication date: 12-Mar-2009
https://dl.acm.org/doi/10.1007/978-3-642-00468-1_14
Yu YLeiwo JPremkumar B(2006)Hiding circuit topology from unbounded reverse engineersProceedings of the 11th Australasian conference on Information Security and Privacy10.1007/11780656_15(171-182)Online publication date: 3-Jul-2006
https://dl.acm.org/doi/10.1007/11780656_15

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Rebound attacks on the reduced grøstl hash function

Cryptanalysis of the Round-Reduced GOST Hash Function

Distinguisher on full-round compression function of GOST R

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations