Author : A.Amalesh 1
Date of Publication :7th April 2016
Abstract: To make digital artifacts (undesired or unintended alteration in data introduced in a digital process by an involved technique and/or technology ) such as datasets, code, texts, and images verifiable and permanent. Digital artifacts that are supposed to be immutable, there is moreover no commonly accepted method to enforce this immutability. To solve this problem, we propose trusty URIs containing base 64 encryption values.Base64 encoding can be helpful when fairly lengthy identifying information is used in an HTTP environment. For example, a database persistence framework might use Base64 encoding to encode a relatively large unique id (generally 128-bit UUIDs) into a string for use as an HTTP parameter in HTTP forms or HTTP GET URLs. It makes the contents of the data trustworthy which is sent as a URI to the user and it make sure whether it is trusted or not We show how trusty URIs can be used for the verification of digital artifacts, in a manner that is independent of the serialization format in the case of structured data files such as nanopublications .Our goal is to achieve a data security and make the content present is immutable thereby extending the range of verifiability to the entire reference tree.Even the file with large content it becomes possible to implement in enhancing data’s on the web and it is fully compatible with existing standards and protocols
Reference :
-
- T. Kuhn and M. Dumontier, “Trusty URIs: Verifiable, immutable, and permanent digital artifacts for linked data,” in Proc. 11th Extended Semantic Web Conf., 2014, pp. 395–410
- P. Groth, A. Gibson, and J. Velterop, “The anatomy of a nano-publication,” Inf. Serv. Use, vol. 30, no. 1, pp. 51– 56, 2010.
- S. Farrell, D. Kutscher, C. Dannewitz, B. Ohlman, A. Keranen, and P. Hallam-Baker, “Naming things with hashes,” Internet Engineering Task Force (IETF), Standards Track RFC 6920, Apr. 2013.
- R. Hoekstra, “The MetaLex document server,” in Proc. 10th Int. Conf. The Semantic Web, 2011, pp. 128–143.
- M. Altman and G. King, “A proposed standard for the scholarly citation of quantitative data,” D-lib Mag., vol. 13, no. 3, p. 5, 2007.
- M. Bartel, J. Boyer, B. Fox, B. LaMacchia, and E. Simon, (2008, Jun.). XML signature syntax and processing. W3C, Recommenda-tion. [Online]. Available: http://www.w3.org/TR/xmldsig-core/
- J. Carroll, “Signing RDF graphs,” in Proc. 2nd Int. Semantic Web Conf., The Semantic Web, 2003, pp. 369– 384.
- E. Hofig€ and I. Schieferdecker, “Hashing of RDF graphs and a solution to the blank node problem,” in Proc. 10th Int. Workshop Uncertainty Reasoning Semantic Web, 2014, pp. 55.
- M. Bellare, O. Goldreich, and S. Goldwasser, “Incremental cryp-tography: The case of hashing and signing,” in Proc. 14th Annu. Int. Cryptol. Conf., Adv. Cryptol., 1994, pp. 216–233
- C. Sayers and A. Karp, “Computing the digest of an RDF graph,” Mobile and Media Systems Laboratory, HP Laboratories, Palo Alto, USA, Tech. Rep. HPL-2003- 235(R.1), 2004.
- R. Phan and D. Wagner, “Security considerations for incremental hash functions based on pair block chaining,” Comput. Security, vol. 25, no. 2, pp. 131–136, 2006