ACM Digital Rights Management Workshop最新文献

A domain specific language for usage management 用于使用管理的领域特定语言

ACM Digital Rights Management Workshop Pub Date : 2011-10-21 DOI: 10.1145/2046631.2046641

Christopher C. Lamb, Pramod A. Jamkhedkar, Mathew P. Bohnsack, Viswanath Nandina, G. Heileman

引用次数: 0

Is DRM working?: how could we tell? DRM有效吗?我们怎么知道呢?

ACM Digital Rights Management Workshop Pub Date : 2011-10-21 DOI: 10.1145/2046631.2046633

Bruce E. Boyden

{"title":"Is DRM working?: how could we tell?","authors":"Bruce E. Boyden","doi":"10.1145/2046631.2046633","DOIUrl":"https://doi.org/10.1145/2046631.2046633","url":null,"abstract":"The success or failure of digital rights management is often taken in legal circles to be a technological question: has a particular scheme already been cracked? How broadly is protected content being redistributed? Can any scheme provide absolute security for content? By these measures, DRM, at least in its most visible applications, has been a failure, as has its legal bulwark, the Digital Millennium Copyright Act. Most widely available schemes are cracked within a few years of release. And due to the nature of the Internet, breaking a scheme once means it is broken everywhere. Under these conditions, absolute security is both required and impossible. This is the so-called \"Darknet\" hypothesis, first described at the ACM-DRM workshop nine years ago.\u0000 But the success or failure of DRM and anticircumvention policy generally is also a legal question, or more properly, a question about how law and technology interact with society. Assessing DRM's success therefore requires first determining its place in a copyright landscape that is undergoing a fundamental transformation. That transformation can be described simply as a disappearance of gates. Copyright relies on a world that makes copying without permission costly and difficult. That is, it relies on natural choke points at which access to content can be traded for money.\u0000 Those natural choke points, or \"gates,\" are disappearing. DRM is an attempt to reestablish a sort of gate, and its success or failure in any given application depends on how well it mimics the real-world gates it is replacing. And that is primarily a social question, not a technological one. Furthermore, it indicates a different set of threats to DRM schemes, and to the policy embodied in the DMCA: to the extent such schemes visibly interfere with common uses, their viability as replacement gates is diminished. The gravest threat to DRM schemes may come not from a particular sophisticated attack, but rather from a dissipation of the illusion of naturalness.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114609773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Fast and adaptive tracing strategies for 3-secure fingerprint watermarking codes 三安全指纹水印码的快速自适应跟踪策略

ACM Digital Rights Management Workshop Pub Date : 2011-10-21 DOI: 10.1145/2046631.2046640

Marcel Schäfer, Waldemar Berchtold, M. Steinebach

{"title":"Fast and adaptive tracing strategies for 3-secure fingerprint watermarking codes","authors":"Marcel Schäfer, Waldemar Berchtold, M. Steinebach","doi":"10.1145/2046631.2046640","DOIUrl":"https://doi.org/10.1145/2046631.2046640","url":null,"abstract":"Fingerprinting codes are mechanisms to increase the security of transaction watermarking. Digital transaction watermarking is an accepted mechanism to discourage illegal distribution of multimedia. Here copies of the same content are distributed with individual markings. Simple but effective attacks on transaction watermarking are collusion attacks where multiple individualized copies of the work are compared in order to detect and attack the watermark positions and thus create a counterfeited watermark.\u0000 One common countermeasure is given by fingerprinting codes. The main challenge is to provide codes which are highly secure, reliable and, at the same time, provide a sufficiently compact code length according to the payload limitations of current watermarking algorithms. Applying such codes in practice, the codes have to face additional challenges: Most operators arrogate small amounts of time for the code generation and embedding process and for the detection and accusation process.\u0000 In this article, we describe a new fast but fair fingerprinting code to detect a collusion of up to three colluders. The code is very flexible and consciously kept simple to be adaptive and fast in order to stay applicable for all demands of potential appliers. Using accusation sums we are able to make a decision about which kind of attack strategy the colluders may have used. Accordingly the algorithm is split into two different tracing strategies. Both are based on discarding as many fingerprints as possible and only consider the most suspicious.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134160852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Integrated circuit digital rights management techniques using physical level characterization 使用物理层表征的集成电路数字版权管理技术

ACM Digital Rights Management Workshop Pub Date : 2011-10-21 DOI: 10.1145/2046631.2046635

Sheng Wei, F. Koushanfar, M. Potkonjak

引用次数: 12

Traitor tracing schemes for protected software implementations 受保护软件实现的叛逆者跟踪方案

ACM Digital Rights Management Workshop Pub Date : 2011-10-21 DOI: 10.1145/2046631.2046636

M. Joye, Tancrède Lepoint

引用次数: 3

A rights management approach to protection of privacy in a cloud of electronic health records 在电子健康记录云环境中保护隐私的权利管理方法

ACM Digital Rights Management Workshop Pub Date : 2011-10-17 DOI: 10.1145/2046631.2046637

Mohammad Jafari, R. Safavi-Naini, N. Sheppard

引用次数: 25

A chameleon encryption scheme resistant to known-plaintext attack 变色龙加密方案抵抗已知明文攻击

ACM Digital Rights Management Workshop Pub Date : 2010-10-04 DOI: 10.1145/1866870.1866876

E. Chang, Chengfang Fang, Jia Xu

{"title":"A chameleon encryption scheme resistant to known-plaintext attack","authors":"E. Chang, Chengfang Fang, Jia Xu","doi":"10.1145/1866870.1866876","DOIUrl":"https://doi.org/10.1145/1866870.1866876","url":null,"abstract":"From a ciphertext and a secret key assigned to a user, the decryption of a Chameleon encryption scheme produces a message which is the plaintext embedded with a watermark associated to the user. Most existing constructions of Chameleon encryption scheme are LUT (lookup table)-based, where a secret LUT plays the role of the master key and each user has a noisy version of the secret LUT. LUT-based methods have the limitation that the secrecy of the master key, under known-plaintext attack (KPA), relies on the difficulty in solving large linear system. In other words, with some knowledge of the plaintext, a dishonest user is able to derive the LUT, or an approximation of the LUT by solving a linear system. Resistance to such attack is crucial in the context of multimedia encryption since multimedia objects inherently contain high redundancies. Furthermore, for efficiency in decryption, the underlying linear system is likely to be sparse or not overly large, and hence can be solved using reasonable computing resource. In our experiment, a desktop PC is able to find a LUT (with 216 entries) within 2 hours. We propose a scheme that is resistant to KPA. The core of the scheme is a MUTABLE-PRNG (Pseudo Random Number Generator) whereby different but similar sequences are generated from related seeds. We generate such sequence from multiple pseudo random sequences based on majority-vote, and enhance its performance using error-correcting code. The proposed scheme is very simple and it is easy to show that it is resistant to KPA under reasonable cryptographic assumptions. However, it is not clear how much information on the original plaintext is leaked from the watermarked copies. We analyze the scheme and quantify the information loss using average conditional entropy.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129509079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Robust fingerprinting codes: a near optimal construction 强大的指纹识别代码:一个近乎最佳的结构

ACM Digital Rights Management Workshop Pub Date : 2010-10-04 DOI: 10.1145/1866870.1866873

D. Boneh, A. Kiayias, H. Montgomery

引用次数: 14

New construction of identity-based proxy re-encryption 基于身份的代理重加密新结构

ACM Digital Rights Management Workshop Pub Date : 2010-10-04 DOI: 10.1145/1866870.1866880

Song Luo, Jian-bin Hu, Zhong Chen

引用次数: 6

An introduction to interoperable digital rights locker 介绍了可互操作的数字版权锁

ACM Digital Rights Management Workshop Pub Date : 2010-10-04 DOI: 10.1145/1866870.1866881

E. Diehl, A. Robert

引用次数: 0