A Framework for Iterative Signing of Graph Data on the Web

  • Andreas Kasten
  • Ansgar Scherp
  • Peter Schauß
Conference paper

DOI: 10.1007/978-3-319-07443-6_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8465)
Cite this paper as:
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., d’Aquin M., Staab S., Tordai A. (eds) The Semantic Web: Trends and Challenges. ESWC 2014. Lecture Notes in Computer Science, vol 8465. Springer, Cham

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.

Keywords

#eswc2014Kasten 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Andreas Kasten
    • 1
  • Ansgar Scherp
    • 2
  • Peter Schauß
    • 1
  1. 1.University of Koblenz-LandauKoblenzGermany
  2. 2.Kiel University and Leibniz Information Centre for EconomicsKielGermany

Personalised recommendations