Computing the digest of an RDF graph
Craig P. Sayers, Alan H. Karp · 2004
RDF(Resource Description Framework), graph, digest, signature, cryptography, security Efficient algorithms are needed for computing the digest of a Resource Description Framework (RDF) graph. These may be used to assign unique content-dependent identifiers and for use in digital signatures, allowing a recipient to verify that RDF was generated by a particular individual and/or has not been altered in transit. Ideally the digest algorithms should still permit verification of the RDF graph even when it has been transported via intermediaries who may serialize in different formats and alter the blank node identifiers.