Cloud-based outsourced storage relieves the client's burden for storage management and maintenance by providing a comparably low-cost, scalable, location- independent platform. However, the fact that clients no longer have physical possession of data indicates that they are facing a potentially formidable risk for missing or corrupted data. To avoid the security risks, audit services are critical to ensure the integrity and availability of outsourced data and to achieve digital forensics and credibility on cloud computing. Provable data possession (PDP), which is a cryptographic technique for verifying the integrity of data without retrieving it at an untrusted server, can be used to realize audit services. In this paper, profiting from the interactive zero-knowledge proof system, we address the construction of an interactive PDP protocol to prevent the fraudulence of prover (soundness property) and the leakage of verified data (zero- knowledge property). We prove that our construction holds these properties based on the computation Diffie- Hellman assumption and the rewindable black-box knowledge extractor. We also propose an efficient mechanism with respect to probabilistic queries and periodic verification to reduce the audit costs per verification and implement abnormal detection timely. In addition, we present an efficient method for selecting an optimal parameter value to minimize computational overheads of cloud audit services. Our experimental results demonstrate the effectiveness of our approach.
[1]
Matthew K. Franklin,et al.
Identity-Based Encryption from the Weil Pairing
,
2001,
CRYPTO.
[2]
Reza Curtmola,et al.
Provable data possession at untrusted stores
,
2007,
CCS '07.
[3]
Ari Juels,et al.
HAIL: a high-availability and integrity layer for cloud storage
,
2009,
CCS.
[4]
Yevgeniy Dodis,et al.
Proofs of Retrievability via Hardness Amplification
,
2009,
IACR Cryptol. ePrint Arch..
[5]
David Mazières,et al.
Fast and secure distributed read-only file system
,
2000,
TOCS.
[6]
Stephen S. Yau,et al.
Efficient audit service outsourcing for data integrity in clouds
,
2012,
J. Syst. Softw..
[7]
Ivan Damgård,et al.
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions
,
2000,
Public Key Cryptography.
[8]
Roberto Di Pietro,et al.
Scalable and efficient provable data possession
,
2008,
IACR Cryptol. ePrint Arch..
[9]
Hovav Shacham,et al.
Short Group Signatures
,
2004,
CRYPTO.
[10]
Nicolas Brisebarre,et al.
Arithmetic Operators for Pairing-Based Cryptography
,
2007,
CHES.
[11]
Paulo S. L. M. Barreto,et al.
Efficient pairing computation on supersingular Abelian varieties
,
2007,
IACR Cryptol. ePrint Arch..