BibSonomy :: publication :: Signing RDF Graphs
URLDOITeX

publication post of voj

Signing RDF Graphs

Jeremy J. Carroll. HPL-2003-142. HP Labs, (2003)

discussion

(0)

resources (URL, PDF, ...)

URL:http://www.hpl.hp.com/techreports/2003/HPL-2003-142.html
internal link:
?
You can use this internal link to create references to this post in your discussions. Just copy this internal link and paste it in your discussion text.
BibTeX key:Carroll2003

abstract

Assuming P<GI<NP, the creation and verification of a digital signature of an arbitrary RDF graph cannot be done in polynomial time. However, it is possible to define a large class of canonicalizable RDF graphs, such that digital signatures for graphs in this class can be created and verified in Onlogn. Without changing its meaning, an arbitrary RDF graph can be nondeterministically pre-canonicalized into a graph of this class, before signing. The techniques in this paper are key enablers for the use of digital signature technology in the Semantic Web.
BibSonomy is offered by the KDE group of the University of Kassel, the DMIR group of the University of Würzburg, and the L3S Research Center, Germany. Privacy & Terms of Use - Contact