Fast and secure distributed read-only file system
ACM Transactions on Computer Systems (TOCS)
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Dynamic authenticated index structures for outsourced databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Strong accountability for network storage
ACM Transactions on Storage (TOS)
Pors: proofs of retrievability for large files
Proceedings of the 14th ACM conference on Computer and communications security
Provable data possession at untrusted stores
Proceedings of the 14th ACM conference on Computer and communications security
Integrity auditing of outsourced data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Arithmetic Operators for Pairing-Based Cryptography
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Scalable and efficient provable data possession
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Compact Proofs of Retrievability
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Proofs of Retrievability via Hardness Amplification
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
HAIL: a high-availability and integrity layer for cloud storage
Proceedings of the 16th ACM conference on Computer and communications security
Dynamic provable data possession
Proceedings of the 16th ACM conference on Computer and communications security
Communications of the ACM
A Study of User-Friendly Hash Comparison Schemes
ACSAC '09 Proceedings of the 2009 Annual Computer Security Applications Conference
BAF: An Efficient Publicly Verifiable Secure Audit Logging Scheme for Distributed Systems
ACSAC '09 Proceedings of the 2009 Annual Computer Security Applications Conference
Enabling public verifiability and data dynamics for storage security in cloud computing
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Security and privacy implications of cloud computing: lost in the cloud
iNetSec'10 Proceedings of the 2010 IFIP WG 11.4 international conference on Open research problems in network security
Authenticating query results in data publishing
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields
IEEE Transactions on Information Theory
Knox: privacy-preserving auditing for shared data with large groups in the cloud
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Pragmatic assessment of research intensive areas in cloud: a systematic review
ACM SIGSOFT Software Engineering Notes
Efficient integrity auditing services for cloud computing using raptor codes
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Hi-index | 0.00 |
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.