Real-time proof of violation with adaptive huffman coding hash tree for cloud storage service

Jehn Ruey Jiang, Wei Sheng Chung

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper proposes two adaptive Huffman coding hash tree algorithms to construct the hash tree of a file system. The algorithms are used to design the real-time proof of violation (PoV) scheme for the cloud storage service to achieve mutual non-repudiation between the user and the service provider. The PoV scheme can then generate cryptographic proofs once the service-level agreement (SLA) is violated. Based on adaptive Huffman coding, the proposed algorithms add hash tree nodes dynamically when a file is accessed for the first time. Every node keeps a count to reflect the frequency of occurrence of the associated file, and all nodes' counts and the tree structure are adjusted on-the-fly for every file access. This can significantly reduce the memory and computation overheads required by the PoV scheme. The file access patterns of the NCUCCWiki and the SNIA IOTTA datasets are used to evaluate the performance of the proposed algorithms. The algorithms are also compared with a related hash tree construction algorithm used in a PoV scheme, named ERA, to show their superiority in performance.

Original languageEnglish
Title of host publicationProceedings - 2019 IEEE 12th Conference on Service-Oriented Computing and Applications, SOCA 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages147-153
Number of pages7
ISBN (Electronic)9781728154114
DOIs
StatePublished - Nov 2019
Event12th IEEE Conference on Service-Oriented Computing and Applications, SOCA 2019 - Kaohsiung, Taiwan
Duration: 18 Nov 201921 Nov 2019

Publication series

NameProceedings - 2019 IEEE 12th Conference on Service-Oriented Computing and Applications, SOCA 2019

Conference

Conference12th IEEE Conference on Service-Oriented Computing and Applications, SOCA 2019
Country/TerritoryTaiwan
CityKaohsiung
Period18/11/1921/11/19

Keywords

  • Cloud storage service
  • Hash tree
  • Huffman coding
  • Non-repudiation
  • Proof of violation
  • Service-level agreement

Fingerprint

Dive into the research topics of 'Real-time proof of violation with adaptive huffman coding hash tree for cloud storage service'. Together they form a unique fingerprint.

Cite this