Journal
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
Volume 10, Issue 6, Pages 1167-1179Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIFS.2015.2400425
Keywords
Data storage; cloud storage auditing; homomorphic linear authenticator; cloud computation; key-exposure resistance
Funding
- Division of Computer and Network Systems [1262277]
- National Natural Science Foundation of China [61272425, 61402245]
- U.S. National Science Foundation [CNS-1226677]
- Research Grants Council of Hong Kong [CityU 138513]
- Shandong provincial Key Laboratory of Computer Network [SDKLCN-2013-03]
- Direct For Computer & Info Scie & Enginr
- Division Of Computer and Network Systems [1262277] Funding Source: National Science Foundation
Ask authors/readers for more resources
Cloud storage auditing is viewed as an important service to verify the integrity of the data in public cloud. Current auditing protocols are all based on the assumption that the client's secret key for auditing is absolutely secure. However, such assumption may not always be held, due to the possibly weak sense of security and/or low security settings at the client. If such a secret key for auditing is exposed, most of the current auditing protocols would inevitably become unable to work. In this paper, we focus on this new aspect of cloud storage auditing. We investigate how to reduce the damage of the client's key exposure in cloud storage auditing, and give the first practical solution for this new problem setting. We formalize the definition and the security model of auditing protocol with key-exposure resilience and propose such a protocol. In our design, we employ the binary tree structure and the preorder traversal technique to update the secret keys for the client. We also develop a novel authenticator construction to support the forward security and the property of blockless verifiability. The security proof and the performance analysis show that our proposed protocol is secure and efficient.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available