文章基本信息

标题：An Efficient Proof of Retrievability Scheme for Fully Homomorphic Encrypted Data
本地全文：下载
作者：Yan, Guang ; Yue-Fei, Zhu ; Chun-Xiang, Gu 等
期刊名称：Journal of Networks
印刷版ISSN：1796-2056
出版年度：2013
卷号：8
期号：2
页码：339-344
DOI：10.4304/jnw.8.2.339-344
语种：English
出版社：Academy Publisher
摘要：Proof of retrievability (POR) is an interactive knowledge proof technique for a storage server to prove theintegrity and ownership of clients’ data without downloading them. In this paper we consider efficiency of the POR scheme, when the data stored in cloud is encrypted under fully homomorphic encryption schemes. We presented a POR scheme with new, efficient homomorphic authenticator, which enables constant-size responses and requests fairly little storage and computational power for the clients. The soundness of our scheme is guaranteed by a game-based security proof, under the security model of Juels and Kaliski’s.
关键词：proof of retrievability;fully homomorphic encryption;homomorphic authenticator;game-based security proof