Data Publishing in Decentralized System Using Trusty URI’s

Y. Nandini*, E. Prakash Babu**, S. Vellinangiri***
* M.Tech Student, Department of Computer Science and Engineering, SVPCET, Puttur, India.
** Assistant Professor, Department of Computer Science and Engineering, SVPCET, Puttur, India.
***Head of the Department,Department of Computer Science and Engineering, SVPCET, Puttur, India.
Periodicity:October - December'2016
DOI : https://doi.org/10.26634/jse.11.2.13446

Abstract

Today's web has no usual components to make computerized relics, for example, datasets, code, messages, and pictures, which are precise and stay unaltered. Digital artifacts are not modifiable to unchange, and there is no right technique to implement this perpetuity. These disappointments have a great negative effect on the adaptability to imitate the consequences of procedures that depend on web assets and furthermore it impacts regions like science where reproducibility is basic. To tackle this issue, the authors have proposed trusty URIs containing cryptographic condensations. They have also dealt with how trusty URIs will be utilized for the verification of digital artifacts, in a way that is independent of the distributed design in the instance of organized data records like Nanopublications. They exhibited how the constant of those documents end up noticeably immutable, and additionally conditions to external digital artifacts were added, and along these lies extending the scope of undeniable nature to the entire reference tree. This approach adheres to the center standards of the Web, for example, openness and decentralization, and is totally good with existing gauges and conventions. A transformative model demonstrates that these style objectives are absolutely proficient by their approach, which remains sensible for large documents.

Keywords

Digital Artifacts, Nanopublications, Data Publishing, Web Resources.

How to Cite this Article?

Nandini, Y., Babu, E. P., and Vellinangiri, S. (2016). Data Publishing In Decentralized System Using Trusty URI’s. i-manager’s Journal on Software Engineering, 11(2), 26-30. https://doi.org/10.26634/jse.11.2.13446

References

[1]. T. Kuhn, and M. Dumontier, (2014). “Trusty URIs: verifiable, immutable, and permanent digital artifacts for linked data”. in Proc. 11th European Semantic Web Conf., pp. 395–410.
[2]. P. Groth, A. Gibson, and J. Velterop, (2010). “The anatomy of a nanopublication”. Inf. Serv. & Use, Vol. 30, No. 1-2, pp. 51–56.
[3]. Farrell, Kutscher, C. Dannewitz, B. Ohlman, A. Keranen, and Hallam Baker, (2013). “Naming things with hashes”. Internet Engineering Task Force (IETF), Standards Track RFC6920.
[4].R.Hoekstra, (2011). “The MetaLex document server”. In the Semantic Web–ISWC, Springer, pp. 128–143.
[5]. Kuhn, T., and Dumontier, M. (2015). “Making digital artifacts on the web verifiable and reliable”. IEEE Transactions on Knowledge and Data Engineering, Vol. 27, No. 9, pp. 2390-2400.
[6]. Base64, (n.d.). In Wikipedia. Retrieved from https://en.wikipedia.org/wiki/Base64
[7]. J. Broekstra, A. Kampman, and F. Van Harmelen, (2002). “Sesame: A generic architecture for storing and querying RDF and RDF schema”. In the Semantic Web–ISWC 2002, Springer, pp. 54–68.
[8]. M. Altman, and G. King, (2007). “A proposed standard for the scholarly citation of quantitative data”. D-lib Magazine, Vol. 13, No. 3, pp. 5.
[9]. M. Bartel, J. Boyer, B. Fox, B. LaMacchia, and E. Simon, (2008). “XML signature syntax and processing”. W3C, Recommendation, Vol. 12.
[10]. Carroll, J.J. (2003). “Signing RDF graphs”. In International Semantic Web Conference, pp. 369-384. Springer Berlin Heidelberg.
[11]. E. Höfig and I. Schieferdecker, (2014). “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), Vol. 1259, p. 55-66.
[12]. M. Bellare, O. Goldreich, and S. Goldwasser, (1994). “Incremental cryptography: The case of hashing and signing”. Advances in Cryptology–CRYPTO'94, Springer, pp. 216–233.
[13]. C. Sayers, and A. Karp, (2004). “Computing the digest of an RDF graph”. Mobile and Media Systems Laboratory, HP Laboratories, Palo Alto, USA, Tech. Rep. HPL-2003-235.
[14]. R. Phan, and D. Wagner, (2006). “Security considerations for incremental hash functions based on pair block chaining”. Computers & Security, Vol. 25, No. 2, pp. 131–136.
[15]. H. Van de Sompel, R. Sanderson, H. Shankar, and M. Klein, (2014). “Persistent identifiers for scholarly assets and the web: The need for an unambiguous mapping”. International Journal of Digital Curation, Vol. 9, No. 1, pp. 331–342.
[16]. J. McCusker, T. Lebo, C. Chang, D. McGuinness, and P. da Silva, (2012). “Parallel identities for managing open government data”. IEEE Intelligent Systems, Vol. 27, No. 3, p. 55.
[17]. J. McCusker, T. Lebo, A. Graves, D. Difranzo, P. Pinheiro, and D. McGuinness, (2012). “Functional requirements for information resource provenance on the web”. In International Provenance and Annotation of Data and Processes, Springer, pp. 52–66.
[18]. R. Gentleman, (2005). “Reproducible research: A bioinformatics case study”. Statistical Applications in Genetics and Molecular Biology, Vol. 4, No. 1, p. 1034.
[19]. R.D. Peng, (2011). “Reproducible research in computational science”. Science, Vol. 334, No. 6060, p. 1226.
[20]. O.S. Collaboration et al., (2012). “An open, largescale, collaborative effort to estimate the reproducibility of psychological science”. Perspectives on Psychological Science, Vol. 7, No. 6, pp. 657–660.
[21]. S. Bechhofer, D. De Roure, M. Gamble, C. Goble, and I. Buchan, (2010). “Research objects: Towards exchange and reuse of digital knowledge”. The Future of the Web for Collaborative Science, Vol. 10.
[22]. Secure Hash Standard (SHS). National Institute of Standards and Technology (NIST), Tech. Rep. FIPS PUB 180- 4, March2012. Retrieved from http://csrc.nist.gov/ publications/fips/fips180-4/fips- 180-4.pdf
[23] R. Cyganiak, D. Wood, and M. Lanthaler, (2014). “RDF 1.1 concepts and abstract syntax ”. W3C Recommendation. Retrieved from http://www.w3.org/ TR/rdf11-concepts/
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.