Abstract
This paper analyzes the efficiency and security of bilinear-map-based schemes and brings about an AAA based publicly auditable scheme for cloud computing, which is much more efficient. In this scheme, a trust model including four entities is designed to provide both integrity and confidentiality protection. The proposed scheme can be proved to achieve the security goals that no cheating cloud server can pass the auditing without storing users’ data intact. The efficiency of the proposal is evaluated by analyzing the fulfillment of the design goals, including the computation cost, communication cost and storage cost of our scheme. This light weight publicly auditable Proof-of-storage scheme achieves security goals perfectly, and has an excellent efficiency performance superior to the current bilinear-map-based publicly auditable Proof-of-storage scheme.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Armbrust M, Armando F, Rean G, et al. Above the Clouds: A Berkeley View of Cloud Computing [R]. Technical Report UCB/EECS-2009-28, 2009: 1–6.
The Amazon S3 Team. Amazon S3 availability event [EB/OL].[2013-07-20].http://status.aws.amazon.com/s320080720.html.
Arrington M. Gmail disaster: Reports of mass email deletions[EB/OL].[2013-12-28]. http://techcrunch.com/2006/12/28/gmail-disaster-reports-of-mass-email-deletions/.
Krigsman M. Apple’s mobile me Experiences post-launch pain[EB/OL].[2013-07-11]. http://www.zdnet.com/blog/projectfailures/apples-mobileme-experiences-post-launch-pain/908.
Juels A, Burton J, Kaliski S. PORs: proofs of retrievability for large files[C]//Proceedings of the 14th ACM Conference on Computer and Communications Security. New York: ACM Press, 2007: 584–597.
Ateniese G, Randal B, Reza C, et al. Provable data possession at untrusted stores[C]//Proceedings of the 14th ACM Conference on Computer and Communications Security. New York: ACM Press, 2007: 598–609.
Wang C, Ren K, Li J, et al. Toward publicly auditable secure cloud data storage services [J]. Network, 2010, 24(4): 19–24.
Shah M A, Mary B, Jeffrey C M, et al. Auditing to keep online storage services honest[C]//HOTOS’07 Proceedings of the 11th USENIX Workshop on Hot Topics in Operating Systems. Berkeley: USENIX Association, 2007.
Ateniese G, Randal B, Reza C, et al. Provable data possession at untrusted stores[C]//Proceedings of the 14th ACM Conference on Computer and Communications Security. New York: ACM Press, 2007: 598–609.
Shah M A, Mary B, Jeffrey C. M, et al. Auditing to keep online storage services honest[C]//HOTOS’07 Proceedings of the 11th USENIX Workshop on Hot Topics in Operating Systems. Berkeley: USENIX Association, 2007.
Shacham H, Waters B. Compact proofs of retrievability [C]// Advnce in Cryptology ASIACRYPT 2008, LNCS 5350. Berlin: Springer-Verlag, 2008: 90–107.
Wang Q, Wang C, Li J, et al. Enabling public verifiability and data dynamics for storage security in cloud computing[C]//ESORIC’09 Proceeding of the 14th European Conference on Research in Computer Security. Berlin: Springer -Verlag, 2009: 355–370.
Wang C, Wang Q, Ren K, et al. Privacy-preserving public auditing for storage security in cloud computing [C]// INFOCOM, 2010 Proceedings IEEE. New York: IEEE Press, 2010: 1–9.
Aboba B, Simon D, Eronen P, et al. Extensible authentica tion protocol (EAP) [EB/OL]. [2014-01-28]. http://www.rfc-editor.org/rfc3748.txt.
Eronen P, Hiller T, Zorn G. Diameter extensible authentication protocol (EAP) application [EB/OL]. [2014-02-18]. http://www.rfc-editor.org/rfc/rfc407.txt.
Montgomery Peter L. Modular multiplication without trial division [J]. Mathematics of Computation, 1985, 44(170): 519–521.
Elkeelany Q, Matalgah M M, Sheikh K P, et al. Performance analysis of IPSec protocol: encryption and authentication[C]//Procceding of IEEE Communications Conference. New York: IEEE Press, 2002: 1164–1168.
Xenakis C, Nikolaos L, Lazaros M, et al. A generic characterization of the overheads imposed by IPSEC and associated cryptographic algorithms [J]. The International Journal of Computer and Telecommunications Networking, 2006, 50(17): 3225–3241.
Orman H, Hoffman P. Determining strengths for public keys used for exchanging symmetric keys [EB/OL]. [2013-12-10] http://www.rfc-editor.org/rfc3766.txt.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China (61101088) and the Opening Project of Key Lab of Information Network Security of Ministry of Public Security (C13607)
Biography: PEI Bei, female, Ph. D. candidate, research direction: information security.
Rights and permissions
About this article
Cite this article
Pei, B., Chen, C. & Wan, C. Key management for outsourced data security. Wuhan Univ. J. Nat. Sci. 19, 449–454 (2014). https://doi.org/10.1007/s11859-014-1038-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11859-014-1038-9