Bidirectional and Malleable Proof-of-Ownership for Large File in Cloud Storage

被引:7
作者
Huang, Ke [1 ,2 ]
Zhang, Xiaosong [1 ,2 ,3 ]
Mu, Yi [4 ]
Rezaeibagha, Fatemeh [5 ]
Du, Xiaojiang [6 ]
机构
[1] Univ Elect Sci & Technol China UESTC, Coll Cyber Secur, Chengdu 611731, Sichuan, Peoples R China
[2] Chengdu Jiaozi Financial Holding Grp Co Ltd, Blockchain Res Lab UESTC, Chengdu 610042, Sichuan, Peoples R China
[3] Peng Cheng Lab, Cyberspace Secur Res Ctr, Shenzhen 518000, Guangdong, Peoples R China
[4] City Univ Macau, Inst Data Sci, Taipa 999078, Macao, Peoples R China
[5] Murdoch Univ, Informat Technol Media & Commun Discipline, Perth, WA 6150, Australia
[6] Temple Univ, Dept Comp & Informat Sci, Philadelphia, PA 19122 USA
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Cloud storage; proof-of-ownership; deduplication; cloud computing; PROVABLE OWNERSHIP; DEDUPLICATION; EFFICIENT;
D O I
10.1109/TCC.2021.3054751
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 (BM-PoW) for the above challenge. Our proposed BM-PoW consists of bidirectional PoW (B-PoW), malleable PoW (M-PoW) and dispute arbitration protocol DAP. While our B-PoW is proposed for a static setting, the M-PoW caters specifically for dynamic manipulation of data. In addition, our proposed arbitration protocol DAP 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 B-PoW is secure and efficient for large file in static data archive. In addition, our proposed M-PoW achieves acceptable performance under dynamic setting where data is supposed to be outsourced first and updated later in dynamic data archive.
引用
收藏
页码:2351 / 2365
页数:15
相关论文
共 36 条
  • [1] Abadi M, 2013, LECT NOTES COMPUT SC, V8042, P374, DOI 10.1007/978-3-642-40041-4_21
  • [2] [Anonymous], 2014, PROC 6 USENIX WORKSH
  • [3] [Anonymous], IDC iView: IDC Analyze the future
  • [4] [Anonymous], 2012, IACR CRYPTOL EPRINT
  • [5] Ateniese G., 2008, PROC 4 INT C SECUR P
  • [6] Ateniese G, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P598
  • [7] Message-Locked Encryption and Secure Deduplication
    Bellare, Mihir
    Keelveedhi, Sriram
    Ristenpart, Thomas
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2013, 2013, 7881 : 296 - 312
  • [8] Blasco J, 2014, IEEE CONF COMM NETW, P481, DOI 10.1109/CNS.2014.6997518
  • [9] Chameleon-Hashes with Ephemeral Trapdoors And Applications to Invisible Sanitizable Signatures
    Camenisch, Jan
    Derler, David
    Krenn, Stephan
    Pohls, Henrich C.
    Samelin, Kai
    Slamanig, Daniel
    [J]. PUBLIC-KEY CRYPTOGRAPHY (PKC 2017), PT II, 2017, 10175 : 152 - 182
  • [10] Chaum D., 1993, Advances in Cryptology - CRYPTO '92. 12th Annual International Cryptology Conference Proceedings, P89