Abstract
The security of important data is a great issue in distributed storage system, especially when the data is stored on the cloud where risk increases and traditional encryption with key may not be secure enough. To deal with the problem, an expanded efficiency secret splitting algorithm (EESSA) is proposed to strengthen the security of data which is not only for long-term storage but also for sharing. Three key technologies are used in EESSA to guarantee security: file manipulation is used to split file to guarantee the data not be obtained by the unauthenticated users; asymmetric cryptosystem is designed to make a secure communication channel to transfer the feature information; security controller makes the whole secure process under the control. The security of the algorithm is proved theoretically, while its feasibility and efficiency is confirmed by experiments.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)
Schoenmakers, B.: A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148–784. Springer, Heidelberg (1999)
Kikuchi, H. (M+1)st-Price Auction Protocol. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol. 2339, pp. 341–363. Springer, Heidelberg (2002)
Lal, S., Kumar, M.: A Directed-Threshold Multi-Signature Scheme. Cryptography and Security ACM-class (2004)
Storer, M.W., Greenan, K.M., et al.: POTSHARDS: secure long-term storage without encryption. In: Proceedings of the USENIX Annual Technical Conference, pp. 1–14. USENIX Association, Santa Clara (2007)
Chen, Z., Yao, W.-B., Xiao, D., Wu, C.-H., Liu, J.-Y., Wang, C.: ESSA: An Efficient and Secure Splitting Algorithm for Distributed Storage Systems. China Communications 7(4), 89–95 (2010)
Singleton, R.: Maximum distance q-nary codes. IEEE Transactions on Information Theory 10(2), 116–118 (1964)
Löbbing, M., Wegener, I.: The Number of Knight’s Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams. The Electronic Journal of Combinatorics 3(1), 5 (1996)
Kyek, O., Parberry, I., et al.: Bounds on the number of knight’s tours. Discrete Applied Mathematics 74(2), 171–181 (1997)
Bu, S., Xu, X., et al.: Analysis on Security of NTRU Public Key Cryptosystem. Computer Engineering and Applications 38(24), 3 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yao, X., Yao, W. (2013). A Trustworthy Storage Framework on the Cloud. In: Yuan, Y., Wu, X., Lu, Y. (eds) Trustworthy Computing and Services. ISCTCS 2012. Communications in Computer and Information Science, vol 320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35795-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-35795-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35794-7
Online ISBN: 978-3-642-35795-4
eBook Packages: Computer ScienceComputer Science (R0)