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.
Chapter PDF
Similar content being viewed by others
Keywords
References
Arenas, M., Gutierrez, C., Pérez, J.: Foundations of RDF databases. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web. LNCS, vol. 5689, pp. 158–204. Springer, Heidelberg (2009)
Bartel, M., Boyer, J., Fox, B., LaMacchia, B., Simon, E.: XML signature syntax and processing. W3C (2008), http://www.w3.org/TR/xmldsig-core/
Beckett, D.: N-Triples. W3C (2001), http://www.w3.org/2001/sw/RDFCore/ntriples/
Beckett, D.: RDF/XML syntax specification. W3C (2004), http://www.w3.org/TR/rdf-syntax-grammar/
Bellare, M., Micciancio, D.: A new paradigm for collision-free hashing: Incrementality at reduced cost. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 163–192. Springer, Heidelberg (1997)
Berners-Lee, T., Connolly, D.: Notation3 (N3). W3C (2011), http://www.w3.org/TeamSubmission/n3/
Bizer, C., Cyganiak, R.: TriG: RDF Dataset Language. W3C (2013), http://www.w3.org/TR/trig/
Bundesrepublik Deutschland. §86 StGB (1975), http://www.gesetze-im-internet.de/stgb/__86.html
Carroll, J.J.: Signing RDF graphs. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 369–384. Springer, Heidelberg (2003)
Carroll, J.J., Bizer, C., Hayes, P., Stickler, P.: Named graphs, provenance and trust. In: WWW, pp. 613–622. ACM (2005)
Cooper, D., Santesson, S., Farrell, S., Boeyen, S., Housley, R., Polk, T.: Internet X.509 public key infrastructure. RFC 5280, IETF (May 2008)
Fisteus, J.A., García, N.F., Fernández, L.S., Kloos, C.D.: Hashing and canonicalizing Notation 3 graphs. JCSS 76(7), 663–685 (2010)
Freier, A.O., Karlton, P., Kocher, P.C.: The secure sockets layer (SSL) protocol version 3.0. RFC 6101, IETF (2011)
Kasten, A., Scherp, A.: Towards a configurable framework for iterative signing of distributed graph data. In: PrivOn (2013)
Knuth, D.E.: Sorting and searching, 2nd edn. Art of Computer Programming, vol. 3. Addison-Wesley (1998)
Melnik, S.: RDF API draft (2001), http://infolab.stanford.edu/~melnik/rdf/
Motik, B., Parsia, B., Patel-Schneider, P.F.: OWL 2 web ontology language XML serialization. W3C (2009), http://www.w3.org/TR/owl2-xml-serialization/
NIST. Recommendation for cryptographic key generation. SP 800-133 (2012), http://dx.doi.org/10.6028/NIST.SP.800-133
NIST. Recommendation for key management pt. 1. SP 800-57 (2012), http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf
NIST. Secure hash standard. FIPS PUB 180-4 (March 2012), http://csrc.nist.gov/publications/fips/fips180-4/fips-180-4.pdf
NIST. Digital signature standard (DSS). FIPS PUB 186-4 (June 2013), http://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf
Patel-Schneider, P.F., Motik, B.: OWL 2 web ontology language mapping to RDF graphs. W3C (2012), http://www.w3.org/TR/owl2-mapping-to-rdf/
Perlman, R.: An overview of pki trust models. IEEE Network 13(6), 38–43 (1999)
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. CACM 21(2), 120–126 (1978)
Sayers, C., Karp, A.H.: Computing the digest of an RDF graph. Technical report, HP Laboratories (2004)
Sayers, C., Karp, A.H.: RDF graph digest techniques and potential applications. Technical report, HP Laboratories (2004)
Schneier, B.: Protocol Building Blocks. In: Applied Cryptography. Wiley (1996)
Schneier, B.: Key Management. In: Applied Cryptography. Wiley (1996)
Schneier, B.: Security Needs. In: Secrets and Lies. Wiley (2004)
Stanton, P.T., McKeown, B., Burns, R., Ateniese, G.: FastAD: An authenticated directory for billions of objects. ACM SIGOPS 44(1), 45–49 (2010)
Szyperski, C.: Component Software: Beyond Object-Oriented Programming. Addison-Wesley (2002)
Tummarello, G., Morbidoni, C., Puliti, P., Piazza, F.: Signing individual fragments of an RDF graph. In: WWW, pp. 1020–1021. ACM (2005)
Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, p. 288. Springer, Heidelberg (2002)
Zimmermann, P.R.: The official PGP user’s guide. MIT Press (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-319-07443-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-07443-6_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07442-9
Online ISBN: 978-3-319-07443-6
eBook Packages: Computer ScienceComputer Science (R0)