Making Digital Artifacts On The Web Verifiable and Reliable By Using Cryptographic Hash Key
MLA Style:Naseema Shaik, Noha Abdullah ayedalshahrani, Afnan saadalali,Amjad mohammedsaad Alqahtani, Salhasaeedhedan "Making Digital Artifacts On The Web Verifiable and Reliable By Using Cryptographic Hash Key," International Journal of Computer Trends and Technology 67.11 (2019):38-41.
APA Style Naseema Shaik, Noha Abdullah ayedalshahrani, Afnan saadalali,Amjad mohammedsaad Alqahtani, Salhasaeedhedan. Making Digital Artifacts On The Web Verifiable and Reliable By Using Cryptographic Hash Key International Journal of Computer Trends and Technology, 67(11),38-41.
Currently we used single server to making digital artifacts and we are increasing burden to the server. To making digital resources on the web verifiable, immutable, as well as permanent, we have several techniques to comprise cryptographic hash values in URIs such as called as trusty URIs. At present the problems which we are facing are, there is no reliable standard procedure of verifying whether a received file truly represents the correct as well as original state of that artefact and by using single server to making digital artefacts and we are increasing burden to the server. In this paper we exhibit how the substance of these records get to be one of a kind. Our implementation holds good for the all levels in the Web, for example, transparent and fragmented engineering, which is completely good for present conventional models.
 P. Groth, A. Gibson, and J. Velterop, ?The anatomy of a nanopublication,? Information Services and Use, vol. 30, no. 1, pp. 51–56, 2010.
 T. Kuhn and M. Dumontier, ?Trusty URIs: Verifiable, immutable, and permanent digital artefacts for linked data,? in Proceedings of the 11th Extended Semantic Web Conference (ESWC 2014), ser.Lecture Notes in Computer Science. Springer, 2014.
 R. Hoekstra, ?The MetaLex document server,? in The Semantic Web — ISWC 2011. Springer, 2011, pp. 128– 143.
 M. Bartel, J. Boyer, B. Fox, B. LaMacchia, and E. Simon, ?XML signature syntax and processing,? W3C, Recommendation, June 2008. [Online]. Available: http://www.w3.org/TR/xmldsig-core.
 E. Hofig and I. Schieferdecker, ?Hashing of rdf graphs and a ¨ solution to the blank node problem,? in 10th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2014), 2014, p. 55.
 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,? Computers & Security, vol. 25, no. 2, pp. 131– 136, 2006.
 J. McCusker, T. Lebo, C. Chang, D. McGuinness, and P. da Silva, ?Parallel identities for managing open government data,? IEEE Intelligent Systems, vol. 27, no. 3, p. 55, 2012.
 A. Callahan, J. Cruz-Toledo, and M. Dumontier, ?Ontology-based querying with Bio2RDF‘s linked open data,? Journal of Biomedical Semantics, vol. 4, no. Suppl 1, p. S1, 2013.
 J. Broekstra, A. Kampman, and F. Van Harmelen, ?Sesame: A generic architecture for storing and querying RDF and RDF schema,? in The Semantic Web — ISWC 2002. Springer, 2002,pp. 54–68.
Sematic Web, Nanopublications, Trusty URI’s, Digital Technology.