Digital signets: Self-enforcing protection of digital information

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 489-498

  Dwork, Cynthia ^a   Lotspiech, Jeffrey ^a   Naor, Moni ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRIME; CRYPTOGRAPHY; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; DIGITAL COMMUNICATION SYSTEMS; DIGITAL STORAGE; FUNCTIONS; USER INTERFACES;

AUTHORIZED USERS; COMMUNICATION COMPLEXITY; DIGITAL CONTENTS; DIGITAL INFORMATION; LEGITIMATE USERS; TAMPERPROOF;

COMPUTER CRIME; SECURITY OF DATA;

DIGITAL INFORMATION; DIGITAL SIGNETS;

EID: 0029720071     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237997     Document Type: Conference Paper

References (25)

1. D. Albert and S. Morse, Combating Software Piracy by Encryption and Key Management, Computer, April 1984.
2. The Arcade Project: A Progress Report, Ciphertext The RSA Newsletter, Vol. 2, No. 1, 1994, p 6
3. U. S. Patent 500, 403, issued March 21, 1995, assigned to RSA Data Security, Inc., Redwood City, CA.
4. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM J. Computing 13, pp. 850-863, 1984.
5. D. Boneh and Shaw, Collusion Secure Fingerprinting far Digital Data, Proc. Advances in Cryptology - Crypto'95, LNCS 96, Springer, pp. 452-465, 1995. Full paper available: http://www cs.princeton edu/dabo/publications.html
6. J. Brassil, S. Low, N. F. Maxemchuck, and L. O'Gorman, Electronic Marking and Identification Techniques to Discourage Document Copying, 13th Annual Joint Conference of the IEEE computer and Communication Societies, Proc 1III Info-Comm'94, pp. 1278-1287.
7. Cem Celebiler, personal comm.; cem@theory.lcs.mit edu
8. Chor B., A. Fiat and M. Naor, Tracing traitors, Advances in Cryptology - CRYPTO' 94, LNCS 839, Springer, pp. 257-270, 1994 (Full version available.)
9. B. Chor and S Goldwasser and S. Micali and B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, FOCS 85, 1985, pp. 383-395.
10. I Cox, J. Kilian, T. Leighton, and T. Shamoon, Secure Frequency Domain Watermarking for Multimedia, manuscript, 1995
11. W Diffie and M. E. Hellman, New Directions in Cryptography, IEEE. Transactions on Information Theory, Nov. 1976, pp. 644-654.
12. C. Dwork, J. Lotspiech, and J. Halpern, Method and System for Protection of Digital Information U. S. Patent Application (IBM Ref No. AM9-95-026), filed 8/21/95
13. P. Feldman, A practical scheme for non-interactive verifiable secret sharing, FOCS 28, 1987, pp. 427-437.
14. A Fiat and N Naor, Broadcast Encryption, Proc. Advances in Cryptology - Crypto'93, 1994, pp. 480-491.
15. O. Goldreich, Towards a Theory of Software Protection, Advances in Cryptology - CRYPTO 1986, Springer-Verlag, 1987, pp. 426-439.
16. O. Goldreich, M. Micali, A. Wigderson, How to play any mental game, Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 218-229.
17. Goldwasser, S. and S. Micali and R. Rivest A secure digital signature scheme, SIAM J on Computing 17, 1988, pp. 281-308.
18. A Herzberg and S. Pinter, Public Protection of Software Advances in Cryptology - CRYPTO 1985, Springer-Verlag 1986, pp. 158-179.
19. US Patent No. 5, 319, 705: Method and system for multimedia access control enablement, Inventors: Halter, Bernard J., Le, An V., Co, Alphonse M., Johnson, Donald B., Matyas, Stephen M., Randall, James D., and Wilkins, John D, Issued to IBM Corp 06/07/1994; Application Date:10/21/1992
20. J Kilian, Use of Randomness in Algorithms and Protocols, MIT Press, Cambridge, Massachusetts, 1990.
21. S Kent, Protecting Externally Supplied Software in Small Computers, Ph. D. thesis, MIT/LCS/TR-255, MIT, 1980.
22. R. Ostrovsky, Efficient Computation on Oblivioius RAMs, STOC 22nd, pp. 514-523, 1990.
23. T. P. Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing, Proc. Advances in Cryptology - Crypto'91, Lecture Notes in Computer Science No. 576, Springer, 1992, 129-140.
24. A. Siegel, On universal classes of fast high performance hash functions, their time-space tradeoff and their applications, FOCS 1989, pp. 20-25
25. A. C. Yao, How to Generate and Exchange Secrets, Proc. of the 27th IEEE Symp on Foundations of Computer Science, 1956, pp. 162-167