• DocumentCode
    2383168
  • Title

    A robust and secure overlay storage scheme based on erasure coding

  • Author

    Li, Chuanyou ; Wang, Yun

  • Author_Institution
    Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China
  • fYear
    2010
  • fDate
    1-3 Dec. 2010
  • Firstpage
    177
  • Lastpage
    182
  • Abstract
    Recently, in classical P2P overlay networks, with applying replication technique, a single peer is replaced by a cluster of peers in order to tolerant Byzantine failures. In this paper, a novel robust and secure scheme for storage overlay networks is proposed by applying erasure coding technique to reduce redundancy and enhance privacy protection. For achieving a lightweight data privacy protection, encoded strips are stored and dual distinct hash functions are deployed to construct hash chains to protect location information for encoded strips. Simulation results show that with different percentage of malicious peers, by adjusting encoding parameters, the scheme is available to provide durable data storage service.
  • Keywords
    cryptography; data privacy; encoding; peer-to-peer computing; software fault tolerance; storage management; Byzantine failures; P2P overlay networks; data privacy protection; data storage service; dual distinct hash functions; erasure coding technique; redundancy reduction; replication technique; secure overlay storage scheme; storage overlay networks; Byzantine; Erasure coding; P2P; Privacy;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pervasive Computing and Applications (ICPCA), 2010 5th International Conference on
  • Conference_Location
    Maribor
  • Print_ISBN
    978-1-4244-9144-5
  • Type

    conf

  • DOI
    10.1109/ICPCA.2010.5704094
  • Filename
    5704094