| Abstract
|
Assuming P<GI<NP, the creation and v … 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 O (n log (n)). 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. signature technology in the Semantic Web.
|
| Author
|
Jeremy J. Carroll +
|
| Bibtype
|
inproceedings +
|
| Booktitle
|
International Semantic Web Conference +
|
| Doi
|
http://springerlink.metapress.com/openurl.asp?genre=article%20%5C&%20issn=0302-9743%20%5C&%20volume=2870%20%5C&%20spage=369 +
|
| Key
|
dblp:conf/semweb/carroll03 +
|
| Modification dateThis property is a special property in this wiki.
|
12 September 2009 16:25:39 +
|
| Pages
|
369-384 +
|
| Paper url
|
http://www.hpl.hp.com/techreports/2003/HPL-2003-142.pdf +
|
| Source
|
http://dblp.uni-trier.de/rec/bibtex/conf/semweb/Carroll03 +
|
| Tag
|
Semantic web +,
Rdf diff +,
Computer science +
|
| Title
|
Signing RDF Graphs +
|
| Year
|
2003 +
|
| Categories |
Conference Paper,
Proceeding Paper,
Publication
|
