STORRE
STORRE: Stirling Online Research Repository
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1893/28072| Appears in Collections: | Computing Science and Mathematics Conference Papers and Proceedings |
| Author(s): | Kasten, Andreas Scherp, Ansgar |
| Title: | Towards a configurable framework for iterative signing of distributed graph data |
| Editor(s): | Decker, S Hendler, J Kirrane, S |
| Citation: | Kasten A & Scherp A (2013) Towards a configurable framework for iterative signing of distributed graph data. In: Decker S, Hendler J & Kirrane S (eds.) Proceedings of the Workshop on Society, Privacy and the Semantic Web - Policy and Technology (PrivOn2013) co-located with the 12th International Semantic Web Conference (ISWC 2013), volume 1121. CEUR Workshop Proceedings, 1121. Privacy Online 2013: Society, Privacy and the Semantic Web - Policy and Technology, Sydney, Australia, 21.10.2013-22.10.2013. Aachen, Germany: CEUR Workshop Proceedings. |
| Issue Date: | 31-Dec-2013 |
| Date Deposited: | 24-Oct-2018 |
| Series/Report no.: | CEUR Workshop Proceedings, 1121 |
| Conference Name: | Privacy Online 2013: Society, Privacy and the Semantic Web - Policy and Technology |
| Conference Dates: | 2013-10-21 - 2013-10-22 |
| Conference Location: | Sydney, Australia |
| Abstract: | When publishing graph data on the web such as vocabularies using RDF(S) or OWL, one has only limited means to verify its authenticity and integrity. Today’s approaches require a high signature overhead and do not allow for an iterative signing of graph data. This paper presents a configurable framework for signing arbitrary graph data provided in RDF(S), Named Graphs, or OWL. Our framework supports signing graph data at different levels of granularity: minimum self-contained graphs (MSG), sets of MSGs, and entire graphs. It supports an iterative signing of graph data, e. g., when different parties provide different parts of a common graph, and allows for signing multiple graphs. Both can be done with a constant, low overhead for the signature graph, even when iteratively signing graph data. |
| Status: | VoR - Version of Record |
| Rights: | The copyright is owned by the authors. Copying is permitted only for private and academic purposes. The permission for academic use implies an attribution obligation, i.e., you must properly cite the items that you use in your own published work. Modification is not permitted unless a suitable license is granted by its copyright owners. Copying or use for commercial purposes is forbidden unless an explicit permission is acquired from the copyright owners. |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Kasten-Scherp 2013.pdf | Fulltext - Published Version | 311.99 kB | Adobe PDF | View/Open |
This item is protected by original copyright |
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.