English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21656049      Online Users : 527
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/115536


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/115536


    Title: Blockchain-based random auditor committee for integrity verification
    Authors: Che, Lanxiang;Chen, Lanxiang;Fu, Qingxiao;Fu, Qingxiao;Mu, Yi;Mu, Yi;Zen, Lingfang;Zeng, Lingfang;Reza, Fatemeh;Rezaeibagha, Fatemeh;黃明祥;Hwang, Min-Shiang
    Contributors: 資訊電機學院資訊工程學系
    Keywords: Cloud storage;Integrity verification;Random auditor committee;Election algorithm;Blockchain
    Date: 2022-06-01
    Issue Date: 2023-03-29 02:32:25 (UTC+0)
    Publisher: 亞洲大學
    Abstract: With the popularity of cloud storage, integrity verification for outsourced data has attracted more and more attention. The majority of existing research works rely on a unique third-party auditor (TPA) or fixed TPAs to audit the integrity of outsourced data, and thus they are vulnerable to DoS and collusion attacks as the TPA is not completely trusted. To conquer this problem, a blockchain-based random auditor committee is proposed to replace the fixed TPAs for the integrity verification (call scheme for short). The proposed blockchain consensus algorithm utilizes a verifiable random function (VRF) to select the third-party auditor committee (TPAC) which performs contract verification. The leader of TPAs (LTPA) packs the verification proof into a blockchain called verification chain. The main idea is employing the output of a VRF for leader election to make it probabilistic, such that specific nodes cannot be targeted in advance and a certain fraction of the nodes being malicious can be tolerated. We present rigorous security analysis to demonstrate the security of the proposed scheme. Meanwhile, the comprehensive performance evaluation shows that the proposed scheme improves the performance of data integrity verification effectively.
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML164View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback