|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Title:||A framework for iterative signing of graph data on the web|
|Citation:||Kasten A, Scherp A & Schauß P (2014) A framework for iterative signing of graph data on the web. In: Presutti V, d’Amato C, Gandon F, Tordai A, d’Aquin M & Staab S (eds.) The Semantic Web: Trends and Challenges. ESWC 2014. Lecture Notes in Computer Science, 8465. 11th International Conference, European Semantic Web Conference (ESWC) 2014, Anissaras, Greece, 25.05.2014-29.05.2014. Cham, Switzerland: Springer Verlag, pp. 146-160. https://doi.org/10.1007/978-3-319-07443-6_11|
|Series/Report no.:||Lecture Notes in Computer Science, 8465|
|Conference Name:||11th International Conference, European Semantic Web Conference (ESWC) 2014|
|Conference Dates:||2014-05-25 - 2014-05-29|
|Conference Location:||Anissaras, Greece|
|Abstract:||Existing algorithms for signing graph data typically do not cover the whole signing process. In addition, they lack distinctive features such as signing graph data at different levels of granularity, iterative signing of graph data, and signing multiple graphs. In this paper, we introduce a novel framework for signing arbitrary graph data provided, e g., as RDF(S), Named Graphs, or OWL. We conduct an extensive theoretical and empirical analysis of the runtime and space complexity of different framework configurations. The experiments are performed on synthetic and real-world graph data of different size and different number of blank nodes. We investigate security issues, present a trust model, and discuss practical considerations for using our signing framework.|
|Status:||VoR - Version of Record|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|Kasten et al 2014.pdf||Fulltext - Published Version||344.21 kB||Adobe PDF||Under Permanent Embargo Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
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 email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.