Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
OceanStore: an architecture for global-scale persistent storage
ACM SIGPLAN Notices
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
Ivy: a read/write peer-to-peer file system
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Plutus: Scalable Secure File Sharing on Untrusted Storage
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
Dynamic authenticated index structures for outsourced databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Store, Forget, and Check: Using Algebraic Signatures to Check Remotely Administered Storage
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
How to build a trusted database system on untrusted storage
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Secure untrusted data repository (SUNDR)
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Certificate revocation and certificate update
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
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
Proceedings of the 15th ACM conference on Computer and communications security
Scalable and efficient provable data possession
Proceedings of the 4th international conference on Security and privacy in communication netowrks
The complexity of online memory checking
Journal of the ACM (JACM)
Time and space efficient algorithms for two-party authenticated data structures
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Computational bounds on hierarchical data processing with applications to information security
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
HAIL: a high-availability and integrity layer for cloud storage
Proceedings of the 16th ACM conference on Computer and communications 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
Privacy-preserving public auditing for data storage security in cloud computing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Toward publicly auditable secure cloud data storage services
IEEE Network: The Magazine of Global Internetworking
Remote data checking for network coding-based distributed storage systems
Proceedings of the 2010 ACM workshop on Cloud computing security workshop
FC'10 Proceedings of the 14th international conference on Financial cryptograpy and data security
Fair and dynamic proofs of retrievability
Proceedings of the first ACM conference on Data and application security and privacy
Remote data checking using provable data possession
ACM Transactions on Information and System Security (TISSEC)
Adaptive, secure, and scalable distributed data outsourcing: a vision paper
Proceedings of the 2011 workshop on Dynamic distributed data-intensive applications, programming abstractions, and systems
Adaptive data-driven service integrity attestation for multi-tenant cloud systems
Proceedings of the Nineteenth International Workshop on Quality of Service
Dark clouds on the horizon: using cloud storage as attack vector and online slack space
SEC'11 Proceedings of the 20th USENIX conference on Security
Secure cloud storage: available infrastructures and architectures review and evaluation
TrustBus'11 Proceedings of the 8th international conference on Trust, privacy and security in digital business
Silverline: toward data confidentiality in storage-intensive cloud applications
Proceedings of the 2nd ACM Symposium on Cloud Computing
Delegable provable data possession for remote data in the clouds
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Secure and efficient proof of storage with deduplication
Proceedings of the second ACM conference on Data and Application Security and Privacy
Efficient audit service outsourcing for data integrity in clouds
Journal of Systems and Software
A cloud provider-agnostic secure storage protocol
CRITIS'10 Proceedings of the 5th international conference on Critical Information Infrastructures Security
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
Efficient query integrity for outsourced dynamic databases
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop
Robust dynamic remote data checking for public clouds
Proceedings of the 2012 ACM conference on Computer and communications security
New approaches to security and availability for cloud data
Communications of the ACM
Iris: a scalable cloud file system with efficient integrity checks
Proceedings of the 28th Annual Computer Security Applications Conference
Geolocation of data in the cloud
Proceedings of the third ACM conference on Data and application security and privacy
Multi-user dynamic proofs of data possession using trusted hardware
Proceedings of the third ACM conference on Data and application security and privacy
Towards self-repairing replication-based storage systems using untrusted clouds
Proceedings of the third ACM conference on Data and application security and privacy
Proof of possession for cloud storage via lagrangian interpolation techniques
NSS'12 Proceedings of the 6th international conference on Network and System Security
Efficient dynamic provable possession of remote data via balanced update trees
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Data-oblivious graph algorithms for secure computation and outsourcing
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Proofs of retrievability with public verifiability and constant communication cost in cloud
Proceedings of the 2013 international workshop on Security in cloud computing
Using algebraic signatures to check data possession in cloud storage
Future Generation Computer Systems
Efficient and secure data storage operations for mobile cloud computing
Proceedings of the 8th International Conference on Network and Service Management
Efficient integrity auditing services for cloud computing using raptor codes
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Practical dynamic proofs of retrievability
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Transparent, distributed, and replicated dynamic provable data possession
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
DupLESS: server-aided encryption for deduplicated storage
SEC'13 Proceedings of the 22nd USENIX conference on Security
Data dynamics for remote data possession checking in cloud storage
Computers and Electrical Engineering
On the security of auditing mechanisms for secure cloud storage
Future Generation Computer Systems
Security and privacy for storage and computation in cloud computing
Information Sciences: an International Journal
Hi-index | 0.02 |
We consider the problem of efficiently proving the integrity of data stored at untrusted servers. In the provable data possession (PDP) model, the client preprocesses the data and then sends it to an untrusted server for storage, while keeping a small amount of meta-data. The client later asks the server to prove that the stored data has not been tampered with or deleted (without downloading the actual data). However, the original PDP scheme applies only to static (or append-only) files. We present a definitional framework and efficient constructions for dynamic provable data possession (DPDP), which extends the PDP model to support provable updates to stored data. We use a new version of authenticated dictionaries based on rank information. The price of dynamic updates is a performance change from O(1) to O(logn) (or O(nεlog n), for a file consisting of n blocks, while maintaining the same (or better, respectively) probability of misbehavior detection. Our experiments show that this slowdown is very low in practice (e.g. 415KB proof size and 30ms computational overhead for a 1GB file). We also show how to apply our DPDP scheme to outsourced file systems and version control systems (e.g. CVS).