ACM Home Page
Please provide us with feedback. Feedback
Analysis of an incentives-based secrets protection system
Full text PdfPdf (222 KB)
Source ACM Workshop On Digital Rights Management archive
Proceedings of the 4th ACM workshop on Digital rights management table of contents
Washington DC, USA
SESSION: Information protection methods table of contents
Pages: 22 - 30  
Year of Publication: 2004
ISBN:1-58113-969-1
Authors
N. Boris Margolin  University of Massachusetts, Amherst, MA
Matthew K. Wright  University of Massachusetts, Amherst, MA
Brian Neil Levine  University of Massachusetts, Amherst, MA
Sponsors
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 31,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1029146.1029153
What is a DOI?

ABSTRACT

Once electronic content has been released it is very difficult to prevent copies of the content from being widely distributed. Such distribution can cause economic harm to the content's copyright owner and others. Our protocol, SPIES, allows one party to sell a secret to second party and provides an economic incentive for two parties to limit sharing of a secret between themselves. We do not use watermarking or traditional DRM mechanisms. We focus on content which is to be shared between two parties only, which is valuable, and which only needs to be protected for a limited amount of time. Examples include passwords to a subscription service, pre-release of media for review, or content shared but bound by a non disclosure agreement. With SPIES, any possesor of the content can receive a portion of the funds placed in escrow by the two legitimate possesors. We analyze this system and show that the best strategy of the content provider and content consumer to maximize their utility is to use SPIES and not share the content further. We deal successfully with a "dummy registration" attack in which multiple false identities are used in an attempt to get a higher payment. We also discuss how to determine the correct escrow amount.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bao, F., Deng, R., and Mao, W. Efficient and Practical Fair Exchange Protocols with Off-Line TTP. In Proc. 1998 IEEE Symposium on Security and Privacy (May 1998).
2
3
4
 
5
 
6
Margolin, N. B., Wright, M. K., and Levine, B. N. SPIES: Secret Protection Incentive-based Escrow System. In Proc. Workshop on the Economics of Peer-to-Peer Systems (p2pecon) (June 2004).
 
7
Microsoft DRM Technologies Establish Foundation For Emerging Internet Music, Video and eBooks Industries. Microsoft Press Release, June 2001.
 
8
Osborne, M. J., and Rubinstein, A. A Course In Game Theory. MIT Press, 1994.
 
9
Reed, M., Syverson, P., and Goldschlag, D. Anonymous Connections and Onion Routing. IEEE Journal on Selected Areas in Communication Special Issue on Copyright and Privacy Protection (1998).
 
10
Schneier, B. Applied Cryptography. John Wiley & Sons, 1996.


Collaborative Colleagues:
N. Boris Margolin: colleagues
Matthew K. Wright: colleagues
Brian Neil Levine: colleagues