H. Goldstein, G. Heileman, M. Heileman, Theo Nicolakis, C. Pizano, Bianca Prumo, Michael D. Webb
The Greek Orthodox Archdiocese of America~(GOA) has amassed a rich and varied collection of artifacts associated with two thousand years of religious and historical tradition, as well as more than a century of chronicles in America. The items in this archive include iconography, art, photographs, letters, and other memorabilia. The GOA has endeavored to digitize these assets in order to preserve them, while at the same time make them more accessible for appropriate and beneficial uses. Specifically, the Department of Internet Ministries at the GOA was tasked with overseeing this digitization effort, as well as with the creation of appropriate tools and technology for accessing the resulting digital archive. The challenges associated with this work included the wide diversity of media types, the need to attach specific restrictions to the use of different items, and the desire to provide a user experience that was transparent and not daunting or discouraging. At a fairly early stage it was determined that emerging digital rights management (DRM) capabilities would be necessary in order to realize the goals of the project. These capabilities, however, had to be implemented while accounting for a previously deployed digital asset management (DAM) and web publishing system, not to mention the existing IT infrastructure. This paper presents a case study that describes the efforts associated with the specification, creation, and deployment of an effective DRM system that incorporates rights enforcement technology, and works in synergy with the previously deployed DAM system at the GOA.
{"title":"Protecting digital archives at the Greek Orthodox Archdiocese of America","authors":"H. Goldstein, G. Heileman, M. Heileman, Theo Nicolakis, C. Pizano, Bianca Prumo, Michael D. Webb","doi":"10.1145/947380.947384","DOIUrl":"https://doi.org/10.1145/947380.947384","url":null,"abstract":"The Greek Orthodox Archdiocese of America~(GOA) has amassed a rich and varied collection of artifacts associated with two thousand years of religious and historical tradition, as well as more than a century of chronicles in America. The items in this archive include iconography, art, photographs, letters, and other memorabilia. The GOA has endeavored to digitize these assets in order to preserve them, while at the same time make them more accessible for appropriate and beneficial uses. Specifically, the Department of Internet Ministries at the GOA was tasked with overseeing this digitization effort, as well as with the creation of appropriate tools and technology for accessing the resulting digital archive. The challenges associated with this work included the wide diversity of media types, the need to attach specific restrictions to the use of different items, and the desire to provide a user experience that was transparent and not daunting or discouraging. At a fairly early stage it was determined that emerging digital rights management (DRM) capabilities would be necessary in order to realize the goals of the project. These capabilities, however, had to be implemented while accounting for a previously deployed digital asset management (DAM) and web publishing system, not to mention the existing IT infrastructure. This paper presents a case study that describes the efforts associated with the specification, creation, and deployment of an effective DRM system that incorporates rights enforcement technology, and works in synergy with the previously deployed DAM system at the GOA.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114542225","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}
Agrawal and Kiernan's watermarking technique for database relations [1] and Li et al's fingerprinting extension [6] both depend critically on primary key attributes. Hence, those techniques cannot embed marks in database relations without primary key attributes. Further, the techniques are vulnerable to simple attacks that alter or delete the primary key attribute.This paper proposes a new fingerprinting scheme that does not depend on a primary key attribute. The scheme constructs virtual primary keys from the most significant bits of some of each tuple's attributes. The actual attributes that are used to construct then virtual primary key differ from tuple to tuple. Attribute selection is based on a secret key that is known to the merchant only. Further, the selection does not depend on an apriori ordering over the attributes, or on knowledge of the original relation or fingerprint codeword.The virtual primary keys are then used in fingerprinting as in previous work [6]. Rigorous analysis shows that, with high probability, only embedded fingerprints can be detected and embedded fingerprints cannot be modified or erased by a variety of attacks. Attacks include adding, deleting, shuffling, or modifying tuples or attributes (including a primary key attribute if one exists), guessing secret keys, and colluding with other recipients of a relation.
{"title":"Constructing a virtual primary key for fingerprinting relational data","authors":"Yingjiu Li, Vipin Swarup, S. Jajodia","doi":"10.1145/947380.947398","DOIUrl":"https://doi.org/10.1145/947380.947398","url":null,"abstract":"Agrawal and Kiernan's watermarking technique for database relations [1] and Li et al's fingerprinting extension [6] both depend critically on primary key attributes. Hence, those techniques cannot embed marks in database relations without primary key attributes. Further, the techniques are vulnerable to simple attacks that alter or delete the primary key attribute.This paper proposes a new fingerprinting scheme that does not depend on a primary key attribute. The scheme constructs virtual primary keys from the most significant bits of some of each tuple's attributes. The actual attributes that are used to construct then virtual primary key differ from tuple to tuple. Attribute selection is based on a secret key that is known to the merchant only. Further, the selection does not depend on an apriori ordering over the attributes, or on knowledge of the original relation or fingerprint codeword.The virtual primary keys are then used in fingerprinting as in previous work [6]. Rigorous analysis shows that, with high probability, only embedded fingerprints can be detected and embedded fingerprints cannot be modified or erased by a variety of attacks. Attacks include adding, deleting, shuffling, or modifying tuples or attributes (including a primary key attribute if one exists), guessing secret keys, and colluding with other recipients of a relation.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127051374","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}
Protocol attacks against watermarking schemes pose a threat to modern digital rights management systems; for example, a successful attack may allow to copy a watermark between two digital objects or to forge a valid watermark. Such attacks enable a traitor to hinder a dispute resolving process or accuse an innocent party of a copyright infringement. Secure DRM systems based on watermarks must therefore prevent such protocol attacks. In this paper we introduce a formal framework that enables us to assert rigorously the security of watermarks against protocol attacks. Furthermore, we show how watermarking schemes can be secured against some protocol attacks by using a cryptographic signature of a trusted third party.
{"title":"Watermarking schemes provably secure against copy and ambiguity attacks","authors":"André Adelsbach, S. Katzenbeisser, H. Veith","doi":"10.1145/947380.947395","DOIUrl":"https://doi.org/10.1145/947380.947395","url":null,"abstract":"Protocol attacks against watermarking schemes pose a threat to modern digital rights management systems; for example, a successful attack may allow to copy a watermark between two digital objects or to forge a valid watermark. Such attacks enable a traitor to hinder a dispute resolving process or accuse an innocent party of a copyright infringement. Secure DRM systems based on watermarks must therefore prevent such protocol attacks. In this paper we introduce a formal framework that enables us to assert rigorously the security of watermarks against protocol attacks. Furthermore, we show how watermarking schemes can be secured against some protocol attacks by using a cryptographic signature of a trusted third party.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123686950","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}
Protection of copyrights and revenues of content owners in the digital world has been gaining importance in the recent years. This paper presents a way of fingerprinting text documents that can be used to identify content and expression similarities in documents, as a way of facilitating tracking of digital copies of works, to ensure proper compensation to content owners.The fingerprints we collected consist of surface, syntactic, and semantic features of documents. Because they reflect mostly how things are said, we call these features stylistic fingerprints. However, how things are said are not independent of what is said, therefore these features have predictive power with respect to both content and expression.We tested the ability of these stylistic fingerprints to identify content and expression similarities between documents using a corpus of translated novels. On this corpus, these fingerprints identified the source of a given book chapter (content) successfully 90% of the time and the translator of the chapter (expression) 67% of the time using ten-fold cross validation and decision trees.In comparison, fingerprints based on the vocabularies of documents recognized the source of a given book chapter accurately 93% of the time and the expression of a particular translator 61% of the time.We believe that the right fingerprints can identify modified and literal copies of works, securing revenues for content owners. Enabling the content owners to secure revenues from distribution of their works can alleviate the digital copyright problem and reduce the need to prevent distribution, giving a chance to solutions that promote uninhibited distribution and use of works by the public.
{"title":"Content and expression-based copy recognition for intellectual property protection","authors":"Özlem Uzuner, Randall Davis","doi":"10.1145/947380.947393","DOIUrl":"https://doi.org/10.1145/947380.947393","url":null,"abstract":"Protection of copyrights and revenues of content owners in the digital world has been gaining importance in the recent years. This paper presents a way of fingerprinting text documents that can be used to identify content and expression similarities in documents, as a way of facilitating tracking of digital copies of works, to ensure proper compensation to content owners.The fingerprints we collected consist of surface, syntactic, and semantic features of documents. Because they reflect mostly how things are said, we call these features stylistic fingerprints. However, how things are said are not independent of what is said, therefore these features have predictive power with respect to both content and expression.We tested the ability of these stylistic fingerprints to identify content and expression similarities between documents using a corpus of translated novels. On this corpus, these fingerprints identified the source of a given book chapter (content) successfully 90% of the time and the translator of the chapter (expression) 67% of the time using ten-fold cross validation and decision trees.In comparison, fingerprints based on the vocabularies of documents recognized the source of a given book chapter accurately 93% of the time and the expression of a particular translator 61% of the time.We believe that the right fingerprints can identify modified and literal copies of works, securing revenues for content owners. Enabling the content owners to secure revenues from distribution of their works can alleviate the digital copyright problem and reduce the need to prevent distribution, giving a chance to solutions that promote uninhibited distribution and use of works by the public.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129746806","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}
Broadcast Encryption allows a broadcaster to broadcast an encrypted message so that only a dynamically changing designated group of users can decrypt it. The stateless setting considers the case where the private key at each user is never updated. A central open problem in this area is to design a stateless scheme where both the size of transmission header which encapsulates the session key and the size of private key at each user are small and independent of the number of users (all/privileged/revoked users). We propose schemes that meet this requirement by providing a tradeoff between security against collusion and non-secret storage size. The proposed schemes are based upon new notions of one-way accumulators which are of independent interest.
{"title":"Broadcast encryption with short keys and transmissions","authors":"Nuttapong Attrapadung, K. Kobara, H. Imai","doi":"10.1145/947380.947388","DOIUrl":"https://doi.org/10.1145/947380.947388","url":null,"abstract":"Broadcast Encryption allows a broadcaster to broadcast an encrypted message so that only a dynamically changing designated group of users can decrypt it. The stateless setting considers the case where the private key at each user is never updated. A central open problem in this area is to design a stateless scheme where both the size of transmission header which encapsulates the session key and the size of private key at each user are small and independent of the number of users (all/privileged/revoked users). We propose schemes that meet this requirement by providing a tradeoff between security against collusion and non-secret storage size. The proposed schemes are based upon new notions of one-way accumulators which are of independent interest.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127851305","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}
Remotely sensed satellite images are an important source of geographical data commonly used as input for various types of classification algorithms. For example, these algorithms are commonly used to classify earth land cover, analyze crop conditions, assess mineral and petroleum deposits, and quantify urban growth. Many vendors of digital images are using or are considering the use of invisible watermarking as a means of protecting their images from theft or unauthorized usage. Indeed, the use of invisible watermarking is routinely considered for use in emerging digital rights management~(DRM) systems that may be deployed to manage and protect the rights associated with satellite imagery, or types of "scientific" imagery~(e.g., in the medical field) that routinely have mathematical analyses applied to them. The concern then is how this watermarking impacts subsequent analyses. Specifically, the invisible watermarking process involves making imperceptible modifications to the pixel values of an image. However, even though these changes may be imperceptible to the human observer, they must be of sufficient magnitude to allow for watermark detection. Because of this, the use of invisible watermarking can also impact the performance of image classification algorithms. This paper is concerned with quantifying the impact that invisible watermarks have on satellite image classification. In particular, Landsat satellite images were watermarked using a number of well-known techniques, and the misclassification that resulted from this watermarking was measured. Experimental results show that even weak watermarking can lead to significant misclassification when common image classification algorithms are applied. Thus, the use of watermarking within DRM systems needs to be carefully considered, with particular attention given to the type of content that the watermarking will be applied to.
{"title":"The effects of invisible watermarking on satellite image classification","authors":"G. Heileman, Yunlong Yang","doi":"10.1145/947380.947396","DOIUrl":"https://doi.org/10.1145/947380.947396","url":null,"abstract":"Remotely sensed satellite images are an important source of geographical data commonly used as input for various types of classification algorithms. For example, these algorithms are commonly used to classify earth land cover, analyze crop conditions, assess mineral and petroleum deposits, and quantify urban growth. Many vendors of digital images are using or are considering the use of invisible watermarking as a means of protecting their images from theft or unauthorized usage. Indeed, the use of invisible watermarking is routinely considered for use in emerging digital rights management~(DRM) systems that may be deployed to manage and protect the rights associated with satellite imagery, or types of \"scientific\" imagery~(e.g., in the medical field) that routinely have mathematical analyses applied to them. The concern then is how this watermarking impacts subsequent analyses. Specifically, the invisible watermarking process involves making imperceptible modifications to the pixel values of an image. However, even though these changes may be imperceptible to the human observer, they must be of sufficient magnitude to allow for watermark detection. Because of this, the use of invisible watermarking can also impact the performance of image classification algorithms. This paper is concerned with quantifying the impact that invisible watermarks have on satellite image classification. In particular, Landsat satellite images were watermarked using a number of well-known techniques, and the misclassification that resulted from this watermarking was measured. Experimental results show that even weak watermarking can lead to significant misclassification when common image classification algorithms are applied. Thus, the use of watermarking within DRM systems needs to be carefully considered, with particular attention given to the type of content that the watermarking will be applied to.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126180529","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}
In this paper we examine how copyright protection of digital items can be securely managed in a 3G mobile phone and other devices. First, the basic concepts, strategies, and requirements for digital rights management are reviewed. Next, a framework for protecting digital content in the embedded environment of a mobile phone is proposed and the elements in this system are defined. The means to enforce security in this system are described and a novel "Family Domain" approach to content management is introduced. Our new approach uses key sharing to help alleviate bad user experiences that are associated with some rights management systems. Examples outlining the enrollment of devices and the acquisition, rendering, and superdistribution of content are shown. Our proposed system is not only applicable to a mobile phone system, but may also be extended to other embedded systems, such as personal digital assistants, set-top boxes, or personal computers.
{"title":"Digital rights management in a 3G mobile phone and beyond","authors":"T. S. Messerges, E. A. Dabbish","doi":"10.1145/947380.947385","DOIUrl":"https://doi.org/10.1145/947380.947385","url":null,"abstract":"In this paper we examine how copyright protection of digital items can be securely managed in a 3G mobile phone and other devices. First, the basic concepts, strategies, and requirements for digital rights management are reviewed. Next, a framework for protecting digital content in the embedded environment of a mobile phone is proposed and the elements in this system are defined. The means to enforce security in this system are described and a novel \"Family Domain\" approach to content management is introduced. Our new approach uses key sharing to help alleviate bad user experiences that are associated with some rights management systems. Examples outlining the enrollment of devices and the acquisition, rendering, and superdistribution of content are shown. Our proposed system is not only applicable to a mobile phone system, but may also be extended to other embedded systems, such as personal digital assistants, set-top boxes, or personal computers.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133146221","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}
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already in the registration phase: the honest-but-curious arbitrator can easily determine the signer's secret key.On a positive note, the authors of [22] informally introduced a connection between fair exchange and "sequential two-party multisignature schemes" (which we call two-signatures), but used an insecure two-signature scheme in their actual construction. Nonetheless, we show that this connection can be properly formalized to imply provably secure fair exchange protocols. By utilizing the state-of-the-art non-interactive two-signature of Boldyreva [6], we obtain an efficient and provably secure (in the random oracle model) fair exchange protocol, which is based on GDH signatures [9].Of independent interest, we introduce a unified model for non-interactive fair exchange protocols, which results in a new primitive we call verifiably committed signatures. Verifiably committed signatures generalize (non-interactive) verifiably encrypted signatures [8] and two-signatures, both of which are sufficient for fair exchange.
{"title":"Breaking and repairing optimistic fair exchange from PODC 2003","authors":"Y. Dodis, L. Reyzin","doi":"10.1145/947380.947387","DOIUrl":"https://doi.org/10.1145/947380.947387","url":null,"abstract":"In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already in the registration phase: the honest-but-curious arbitrator can easily determine the signer's secret key.On a positive note, the authors of [22] informally introduced a connection between fair exchange and \"sequential two-party multisignature schemes\" (which we call two-signatures), but used an insecure two-signature scheme in their actual construction. Nonetheless, we show that this connection can be properly formalized to imply provably secure fair exchange protocols. By utilizing the state-of-the-art non-interactive two-signature of Boldyreva [6], we obtain an efficient and provably secure (in the random oracle model) fair exchange protocol, which is based on GDH signatures [9].Of independent interest, we introduce a unified model for non-interactive fair exchange protocols, which results in a new primitive we call verifiably committed signatures. Verifiably committed signatures generalize (non-interactive) verifiably encrypted signatures [8] and two-signatures, both of which are sufficient for fair exchange.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125622317","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}
In the Foundation series, Asimov predicted a 1,000 years of darkness following the fall of the galactic empire. In the book Noir, K.W Jeter describes a world where IP is the ultimate war. Combine them together and you have likely scenario No. 1.The Internet era enabled communication and information exchange on a global scale. But it also opened the door to copyright infringement on a global scale. Music, books, movies, software, games, speeches, research papers - everything is now fair game. The only protection the movie studios ever had was bandwidth - and it is quickly evaporating due to faster network connectivity via broadband and smarter downloading technologies such as BitTorrent.Intellectual property, copyrights and the like are the key to a democratic, free-market civilization and greed is a prime mover - so if all is 'free' and we have a 'constitutional right' to 'share' - where is the future of innovation and creativity?This paper will describe the current state of the great IP war (early stages of border unrest and some commando activity), outline potential futures, and make some suggestions as to how to help direct the world toward a reasonable future.In each case, we will cover the business, legal, and social implications of the scenario and we will discuss the various ways the computing industry can help to influence the future outcome.
{"title":"The IP war: apocalypse or revolution?","authors":"T. Gal, H. Singer, Laird Popkin","doi":"10.1145/947380.947381","DOIUrl":"https://doi.org/10.1145/947380.947381","url":null,"abstract":"In the Foundation series, Asimov predicted a 1,000 years of darkness following the fall of the galactic empire. In the book Noir, K.W Jeter describes a world where IP is the ultimate war. Combine them together and you have likely scenario No. 1.The Internet era enabled communication and information exchange on a global scale. But it also opened the door to copyright infringement on a global scale. Music, books, movies, software, games, speeches, research papers - everything is now fair game. The only protection the movie studios ever had was bandwidth - and it is quickly evaporating due to faster network connectivity via broadband and smarter downloading technologies such as BitTorrent.Intellectual property, copyrights and the like are the key to a democratic, free-market civilization and greed is a prime mover - so if all is 'free' and we have a 'constitutional right' to 'share' - where is the future of innovation and creativity?This paper will describe the current state of the great IP war (early stages of border unrest and some commando activity), outline potential futures, and make some suggestions as to how to help direct the world toward a reasonable future.In each case, we will cover the business, legal, and social implications of the scenario and we will discuss the various ways the computing industry can help to influence the future outcome.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130522797","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}
In this paper, we present our experiences concerning the enforcement of access rights extracted from ODRL-based digital contracts. We introduce the generalized Contract Schema (CoSa) which is an approach to provide a generic representation of contract information on top of rights expression languages. We give an overview of the design and implementation of the xoRELInterpreter software component. In particular, the xoRELInterpreter interprets digital contracts that are based on rights expression languages (e.g. ODRL or XrML) and builds a runtime CoSa object model. We describe how the xorbac access control component and the xoRELInterpreter component are used to enforce access rights that we extract from ODRL-based digital contracts. Thus, our approach describes how ODRL-based contracts can be used as a means to disseminate certain types of access control information in distributed systems.
{"title":"Experiences with the enforcement of access rights extracted from ODRL-based digital contracts","authors":"S. Guth, G. Neumann, Mark Strembeck","doi":"10.1145/947380.947392","DOIUrl":"https://doi.org/10.1145/947380.947392","url":null,"abstract":"In this paper, we present our experiences concerning the enforcement of access rights extracted from ODRL-based digital contracts. We introduce the generalized Contract Schema (CoSa) which is an approach to provide a generic representation of contract information on top of rights expression languages. We give an overview of the design and implementation of the xoRELInterpreter software component. In particular, the xoRELInterpreter interprets digital contracts that are based on rights expression languages (e.g. ODRL or XrML) and builds a runtime CoSa object model. We describe how the xorbac access control component and the xoRELInterpreter component are used to enforce access rights that we extract from ODRL-based digital contracts. Thus, our approach describes how ODRL-based contracts can be used as a means to disseminate certain types of access control information in distributed systems.","PeriodicalId":124354,"journal":{"name":"ACM Digital Rights Management Workshop","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122739897","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：