An Optimal Share Transfer Problem on Secret Sharing Storage Systems

Toshiyuki MIYAMOTO  Sadatoshi KUMAGAI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E90-A   No.11   pp.2458-2464
Publication Date: 2007/11/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e90-a.11.2458
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Concurrent/Hybrid Systems: Theory and Applications)
Category: 
Keyword: 
distributed storage system,  secret sharing scheme,  Steiner tree,  NP-complete,  distributed algorithm,  

Full Text: PDF(385KB)>>
Buy this Article




Summary: 
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.