Abstract
We have been developing a secure and reliable distributed storage system, which uses a secret sharing scheme. In order to efficiently store data in the system, this paper introduces an optimal share transfer problem, and proves it to be, generally, NP-hard. It is also shown that the problem can be resolved into a Steiner tree problem. Finally, through computational experiments we perform the comparison of heuristic algorithms for the Steiner tree problem.
This work was supported in part by Grant-in-Aid for Encouragement of Young Scientists No. 17700061 and 19700060 from the Ministry of Education, Culture, Sports and Technology, Japan.
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
Miyamoto, T., Doi, S., Nogawa, H., Kumagai, S.: Autonomous Distributed Secret Sharing Storage System. Syst. & Comp. in Jpn. 37(6), 55–63 (2006)
Shamir, A.: How to Share a Secret. communication of the ACM 22(11), 612–613 (1979)
Kaneko, Y., Shinoda, S.: The Complexity of an Optimal File Transfer Problem. IEICE Trans. Fund. E82-A(2) (1999)
Karp, R.M.: Reducibility among combinatorial problems. Plenum Press, New York (1972)
Haldar, S.: An All Pairs Shortest Paths Distributed Algorithm Using 2n 2 Messages. J. of Algorithms 24, 20–36 (1997)
Chen, G.-H., Houle, M.-E., Kuo, M.-T.: The Steiner problem in distributed computing systems. Inf. Sci. 74, 73–96 (1993)
Kamei, S., Kakugawa, H.: A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem. IEICE Trans. Fund. E87-D(2), 299–307 (2004)
Jungnickel, D.: Graphs, Networks and Algorithms, 2nd edn. Springer, Heidelberg (2004)
Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (2004)
Kou, L., Markowsky, G., Berman, L.: A fast algorithm for steiner trees. Acta Informatica 15, 141–145 (1981)
Wu, Y.F., Widmayer, P., Wong, C.K.: A faster approximation algorithm for the Steiner problem in graphs. Acta Informatica 23, 223–229 (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miyamoto, T., Kumagai, S. (2007). An Optimal Share Transfer Problem on Secret Sharing Storage Systems. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-74742-0_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74741-3
Online ISBN: 978-3-540-74742-0
eBook Packages: Computer ScienceComputer Science (R0)