Abstract
As the society increasingly relies on digitally stored and accessed information, supporting the availability, persistence, integrity, and confidentiality of the information becomes more critical. Mirroring is a simple but practical approach allowing reasonable availability and accessibility, but it cannot provide security. This paper proposes an approach which integrates data encryption and distribution to allow high security while providing the same degree of availability as mirroring. It is based on LU decomposition of matrix. Analysis confirms that it allows slightly higher availability compared with mirroring scheme for both read and write operation. The proposed scheme needs almost the same storage space as mirroring.
This work was supported in part by 21C Frontier Ubiquitous Computing and Networking, Korea Research Foundation Grant (KRF – 2003 – 041 – D20421) and Brain Korea 21 Project in 2004. Corresponding author: Hee Yong Youn
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hsiao, H.-I., DeWitt, D.J.: A performance study of three high availability data replication strategies. In: Proceedings of ICPDIS, pp. 18–28 (1991)
Long, D.D.E.: A Technique for Managing Mirrored Disks, pp. 272–277. IEEE, Los Alamitos (2001)
Long, D.D.E.: The Management of Replication in a Distributed System. University of California, San Diego (1988)
Bakkaloglu, M., Wylie, J.J., Wang, C., Ganger, G.R.: On Correlated Failures in Survivable Storage Systems: School of Computer Science Carnegie Mellon University, Pittsburgh, PA15213 (2002)
Cannetti, R., Gennaro, R., Jarecki, S., Krawcxyk, H., Rabin, T.: Adaptive Security for Threshold Cryptosystems. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98–115. Springer, Heidelberg (1999)
Blakley, G.R., Meadows, C.: Security of ramp schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 242–268. Springer, Heidelberg (1985)
Menon, J., Riegel, J., Wyllie, J.C.: Algorithms for Software and Low-Cost Hardware RAIDs. In: COMPCON, pp. 411–418 (1995)
Patterson, D.A., Gibson, G.A., Katz, R.H.: A Case for Redundant Arrays of Inexpensive Disks (RAID). In: Proceeding of SIGMOD Conference, pp. 109–116 (1988)
Santis, D., Masucci, B.: Multiple Ramp Schemes. IEEE Trans. Information Theory, 1720–1728 (1999)
Karnin, E., Greene, J., Hellman, M.: On Secret Sharing Systems. IEEE Trans. Information Theory, 35–41 (1983)
Krawczyk, H.: Distributed fingerprints and secure information dispersal. In: ACM Symposium on Principles of Distributed Computing, pp. 207–218 (1993)
Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Symposium on Operating Systems Design and Implementation, pp. 173–186. ACM Press, New York (1999)
Iyengar, A., et al.: Design and Implementation of a Secure Distributed Computing Systems. In: Proc. 14th IFIP International Information Security Conference (SEC 1998), ACM Press, New York (1998)
Deswarte, Y., Blain, L., Fabre, J.-C.: Intrusion tolerance in distributed computing systems. In: IEEE Symposium on Security and Privacy, pp. 110–121 (1991)
Birkhauser: Linear Algebra, pp. 33–37. Birkhauser, Boston (1997)
Nakos, G., Joyner, D.: Linear Algebra with Applications, pp. 188–194. Brooks/Cole, USA (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, S.J., Youn, H.Y. (2004). A Novel Data Encryption and Distribution Approach for High Security and Availability Using LU Decomposition. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24768-5_68
Download citation
DOI: https://doi.org/10.1007/978-3-540-24768-5_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22060-2
Online ISBN: 978-3-540-24768-5
eBook Packages: Springer Book Archive