Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
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 checking in cryptographic file systems with constant trusted storage
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Write off-loading: Practical power management for enterprise storage
ACM Transactions on Storage (TOS)
Athos: Efficient Authentication of Outsourced File Systems
ISC '08 Proceedings of the 11th international conference on Information Security
Efficient Remote Data Possession Checking in Critical Information Infrastructures
IEEE Transactions on Knowledge and Data Engineering
MR-PDP: Multiple-Replica Provable Data Possession
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Efficient integrity checking of untrusted network storage
Proceedings of the 4th ACM international workshop on Storage security and survivability
Scalable and efficient provable data possession
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Remote Integrity Check with Dishonest Storage Server
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Publicly Verifiable Remote Data Integrity
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
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
Proofs of retrievability: theory and implementation
Proceedings of the 2009 ACM workshop on Cloud computing security
Proofs of Storage from Homomorphic Identification Protocols
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
SecCloud: Bridging Secure Storage and Computation in Cloud
ICDCSW '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems Workshops
Fair and dynamic proofs of retrievability
Proceedings of the first ACM conference on Data and application security and privacy
Passive NFS tracing of email and research workloads
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
Enabling security in cloud storage SLAs with CloudProof
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
| Hi-index | 0.00 |
The emergence and availability of remote storage providers prompted work in the security community that allows a client to verify integrity and availability of the data she outsourced to an untrusted remove storage server at a relatively low cost. Most recent solutions to this problem allow the client to read and update (insert, modify, or delete) stored data blocks while trying to lower the overhead associated with verifying data integrity. In this work we develop a novel and efficient scheme, computation and communication overhead of which is orders of magnitude lower than those of other state-of-the-art schemes. Our solution has a number of new features such as a natural support for operations on ranges of blocks, and revision control. The performance guarantees that we achieve stem from a novel data structure, termed balanced update tree, and removing the need to verify update operations.