IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5536326.html
   My bibliography  Save this article

A Data Preservation Method Based on Blockchain and Multidimensional Hash for Digital Forensics

Author

Listed:
  • Gongzheng Liu
  • Jingsha He
  • Xinggang Xuan
  • Wei Wang

Abstract

Since digital forensics becomes more and more popular, more and more attention has been paid to the originality and validity of data, and data preservation technology emerges as the times require. However, the current data preservation models and technologies are only the combination of cryptography technology, and there is a risk of being attacked and cracked. And in the process of data preservation, human participation is also needed, which may lead to data tampering. To solve problems given, this paper presents a data preservation model based on blockchain and multidimensional hash. With the decentralization and smart contract characteristics of blockchain, data can be automatically preserved without human participation to form a branch chain of custody in the unit of case, and blockchain has good antiattack performance, which is the so-called 51% attack. Meanwhile, in order to solve the problem of data confusion and hard to query caused by the excessive number of cases, hash, cryptography, and timestamps are used to form a serialized main chain of custody. Because of the confliction problem of hash and judicial trial needs to absolutely guarantee the authenticity and validity of data, multidimensional hash is used to replace regular hash. In this way, the data preservation becomes an automatic, nonhuman-interventional process. Experiments have been carried out to show the security and effectiveness of the proposed model.

Suggested Citation

  • Gongzheng Liu & Jingsha He & Xinggang Xuan & Wei Wang, 2021. "A Data Preservation Method Based on Blockchain and Multidimensional Hash for Digital Forensics," Complexity, Hindawi, vol. 2021, pages 1-12, April.
  • Handle: RePEc:hin:complx:5536326
    DOI: 10.1155/2021/5536326
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5536326.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5536326.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/5536326?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:5536326. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.