Conference
Timestamp-based Integrity Proofs for Linked Data
Abstract
In this paper, we first investigate the state-of-the-art methods of generating cryptographic hashes that can be used as an integrity proof for RDF datasets. We then propose an efficient method of computing integrity proofs for Linked Data that constructs a sorted Merkle tree for growing RDF datasets based on timestamps (as a key) that are semantically extractable from the RDF dataset. We evaluate our method by comparing it to existing methods …
Authors
Sutton A; Samavi R
Pagination
pp. 1-6
Publisher
Association for Computing Machinery (ACM)
Publication Date
June 10, 2018
DOI
10.1145/3208352.3208353
Name of conference
Proceedings of the International Workshop on Semantic Big Data