Abstract

Cloud storage is a cost-effective platform to accommodate massive data at low cost. However, advances of cloud services propel data generation, which pushes storage servers to its limit. Deduplication is a popular technique enjoyed by most current cloud servers, which detects and deletes redundant data to save storage and bandwidth. For security concerns, proof-of-ownership (PoW) can be used to guarantee ownership of data such that no malicious user could pass deduplication easily or utilize such mechanism for malicious purposes. Generally, PoW is implemented in static data archive where the data file is supposed to be read-only. However, to satisfy users’ needs for dynamical manipulation on data and support real-time data services, it is required to devise efficient PoW for dynamic archive. Inspired by malleable signature, which offers authentication even after its committed message changes, we propose the notion of bidirectional and malleable proof-of-ownership ( <inline-formula><tex-math notation="LaTeX">$\sf {BM\mbox{-}PoW}$</tex-math></inline-formula> ) for the above challenge. Our proposed <inline-formula><tex-math notation="LaTeX">$\sf {BM\mbox{-}PoW}$</tex-math></inline-formula> consists of bidirectional PoW ( <inline-formula><tex-math notation="LaTeX">${\mbox{B-PoW}}$</tex-math></inline-formula> ), malleable PoW ( <inline-formula><tex-math notation="LaTeX">${\mbox{M-PoW}}$</tex-math></inline-formula> ) and dispute arbitration protocol <inline-formula><tex-math notation="LaTeX">$\sf {DAP}$</tex-math></inline-formula> . While our <inline-formula><tex-math notation="LaTeX">${\mbox{B-PoW}}$</tex-math></inline-formula> is proposed for a static setting, the <inline-formula><tex-math notation="LaTeX">${\mbox{M-PoW}}$</tex-math></inline-formula> caters specifically for dynamic manipulation of data. In addition, our proposed arbitration protocol <inline-formula><tex-math notation="LaTeX">$\sf {DAP}$</tex-math></inline-formula> achieves accountable redaction which can arbitrate the originality of file ownership. We provide the security analysis of our proposal, and performance evaluation that suggests our proposed <inline-formula><tex-math notation="LaTeX">${\mbox{B-PoW}}$</tex-math></inline-formula> is secure and efficient for large file in static data archive. In addition, our proposed <inline-formula><tex-math notation="LaTeX">${\mbox{M-PoW}}$</tex-math></inline-formula> achieves acceptable performance under dynamic setting where data is supposed to be outsourced first and updated later in dynamic data archive.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.