Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/28072
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKasten, Andreasen_UK
dc.contributor.authorScherp, Ansgaren_UK
dc.contributor.editorDecker, Sen_UK
dc.contributor.editorHendler, Jen_UK
dc.contributor.editorKirrane, Sen_UK
dc.date.accessioned2018-11-06T15:16:23Z-
dc.date.available2018-11-06T15:16:23Z-
dc.date.issued2013-12-31en_UK
dc.identifier.urihttp://hdl.handle.net/1893/28072-
dc.description.abstractWhen 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.en_UK
dc.language.isoenen_UK
dc.publisherCEUR Workshop Proceedingsen_UK
dc.relationKasten 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 Proceedingsen_UK
dc.relation.ispartofseriesCEUR Workshop Proceedings, 1121en_UK
dc.rightsThe 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.en_UK
dc.titleTowards a configurable framework for iterative signing of distributed graph dataen_UK
dc.typeConference Paperen_UK
dc.citation.jtitleCEUR Workshop Proceedingsen_UK
dc.citation.issn1613-0073en_UK
dc.citation.volume1121en_UK
dc.citation.publicationstatusPublisheden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.citation.btitleProceedings 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)en_UK
dc.citation.conferencedates2013-10-21 - 2013-10-22en_UK
dc.citation.conferencelocationSydney, Australiaen_UK
dc.citation.conferencenamePrivacy Online 2013: Society, Privacy and the Semantic Web - Policy and Technologyen_UK
dc.citation.isbnN/Aen_UK
dc.publisher.addressAachen, Germanyen_UK
dc.contributor.affiliationUniversity of Koblenz-Landauen_UK
dc.contributor.affiliationUniversity of Mannheimen_UK
dc.identifier.scopusid2-s2.0-84946221527en_UK
dc.identifier.wtid1007317en_UK
dc.contributor.orcid0000-0002-2653-9245en_UK
dc.date.accepted2013-08-12en_UK
dc.date.firstcompliantdepositdate2018-10-24en_UK
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings

Files in This Item:
File Description SizeFormat 
Kasten-Scherp 2013.pdfFulltext - Published Version311.99 kBAdobe PDFView/Open


This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

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.