UMAC: Fast and Secure Message Authentication
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
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
Provable data possession at untrusted stores
Proceedings of the 14th ACM conference on Computer and communications security
Auditing to keep online storage services honest
HOTOS'07 Proceedings of the 11th USENIX workshop on Hot topics in operating systems
Efficient Remote Data Possession Checking in Critical Information Infrastructures
IEEE Transactions on Knowledge and Data Engineering
Cryptographic primitives enforcing communication and storage complexity
FC'02 Proceedings of the 6th international conference on Financial cryptography
Integrity Verification of Multiple Data Copies over Untrusted Cloud Servers
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Efficient dynamic provable possession of remote data via balanced update trees
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Transparent, distributed, and replicated dynamic provable data possession
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Hi-index | 0.00 |
More and more customers are outsourcing data storage to remote archive service providers that are responsible for properly preserving the data. As such, it has become crucial for an archive service to be capable of providing evidence to demonstrate the integrity of data for which it is responsible, from the time it receives the data until the expiration of the archival period. Pairing-based provable data integrity (PDI) scheme is proposed that enables not only the customer but also a third-party verifier to check remote data integrity. This PDI scheme is provably secure and efficient. Compared to the best-known prior art, our experiments under defined conditions show that our PDI scheme works 50 times faster in fingerprinting the data, and the resulting fingerprints are 30 times smaller in size.