Cryptographic Methods with a Pli Cachete: Towards the Computational Assurance of Integrity

In Gerhard R. Joubert Ian Foster (ed.), Advances in Parallel Computing. Amsterdam: IOS Press. pp. 10 (2020)
  Copy   BIBTEX

Abstract

Unreproducibility stemming from a loss of data integrity can be prevented with hash functions, secure sketches, and Benford's Law when combined with the historical practice of a Pli Cacheté where scientific discoveries were archived with a 3rd party to later prove the date of discovery. Including the distinct systems of preregistation and data provenance tracking becomes the starting point for the creation of a complete ontology of scientific documentation. The ultimate goals in such a system--ideally mandated--would rule out several forms of dishonesty, catch computational and database errors, catch honest mistakes, and allow for automated data audits of large collaborative open science projects.

Author's Profile

Thatcher Collins
University of Washington

Analytics

Added to PP
2019-09-14

Downloads
286 (#53,987)

6 months
54 (#71,749)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?