咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Bi-directional and concurrent ... 收藏

Bi-directional and concurrent proof of ownership for stronger storage services with de-duplication

Bi-directional and concurrent proof of ownership for stronger storage services with de-duplication

作     者:Taek-Young YOUN Ku-Young CHANG 

作者机构:Electronics and Telecommunications Research Institute 

出 版 物:《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期:2018年第61卷第3期

页      面:84-94页

核心收录:

学科分类:0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 081001[工学-通信与信息系统] 0812[工学-计算机科学与技术(可授工学、理学学位)] 

基  金:supported by Electronics and Telecommunications Research Institute (ETRI) grant funded by the Korean government (17ZH1700  Development of Storage and Search Technologies over Encrypted Database) 

主  题:cloud storage secure de-duplication data out-source proof of ownership bi-directional and concurrent proof 

摘      要:In storage service, data de-duplication is a specialized technique for eliminating duplicate copies of repeating data in storage. Especially, client-side de-duplication has more merits than server-side deduplication since they can improve both the space efficiency and the communication bandwidth. For secure client-side de-duplication, we need a way to prove the ownership of a file to be stored. In the upload step,the server should verify the ownership of a client to give the right of the file without uploading it. On the contrary, the client also want to verify the retrievability for the file since he will delete it from his storage after protocol execution. Existing proof of ownership techniques have been designed for server s need. In this paper, we first point out that we need the second property in client s view point, and give a very simple and practical solution which can support the server and the client to prove that they have the same file. We first describe a generic strategy which can help us to construction a bi-directional and concurrent proof of ownership technique from an ordinary proof of ownership technique, and then give an efficient hash-based scheme with security proof in the random oracle model.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分