【摘要】 可恢复性证明是一种外包存储服务中的数据完整性检测技术.本文致力于交互式证明系统标准模型下的可恢复性证明协议构造方法研究,提出了首个能够防止证明者欺骗和验证数据泄露的交互式可恢复性证明协议,并通过构造多项式时间的可回卷知识抽取器,给出了基于计算Diffie-Hellman假设下的协议完备性、稳固性,以及零知识性证明.特别是,所提方案的验证过程只要求低的、固定大小的负载,达到了最小化通信复杂性的目的.更多还原

【Abstract】 Proof of retrievability (POR) is a technique for ensuring the integrity of data in outsourced storage services.In this paper,we address the construction of POR protocol on the standard model of interactive proof systems.We propose the first interactive POR scheme to prevent the fraudulence of prover and the leakage of verified data.We also give full proofs of soundness and zero-knowledge properties by constructing a polynomialtime rewindable knowledge extractor under the computational Diffie-Hellman assumption.In particular,the verification process of this scheme requires a low,constant amount of overhead,which minimizes communication complexity.更多还原